Reviewerly/exHarmony huggingface dataset:
The Influence of Target Layout and Clicking Method on Picking Time and Dragging Performance Based on Eye-Control Technique

Eye-tracking has been a hot topic in human-computer interaction. Nevertheless, previous studies usu-ally adopted eye-tracking as information output rather than input. The eye-control technique can achieve convenient and rapid real-time operation through the movement of the eyes and reduce un-necessary manual operations. Because the layout determines the location orientation, organizational complexity, cognitive consistency, and predictive ability of the information display, the interface lay-out design affects the user's perception of information intensity, complexity, and logic. Moreover, the method of target clicking by eye-control techniques, which include blink and dwell, also depends on the application and user’s ability. The purpose of this study is to investigate the influence of target layout and target picking method on picking time and dragging performance based on eye-control technique. The results indicate that the target picking method, i.e., blink or dwell, had significant effects on the dragging time and dragging numbers. However, there was no significant effect of target layout on picking time and dragging performance (dragging time and numbers), which may be related to the setting of the experimental conditions (e.g., lighting level and screen resolution). Moreover, the target picking method and the target layout had no significant interaction effect on picking time and drag-ging performance. The findings are anticipated to provide helpful implications for future eye control technique design.
Blockchain concepts, architectures, and Smart city applications in fog and edge computing environments

Impossible does seem to be intimated when it comes to making things smarter and interconnected as the modern era nourishes the Internet of Things (IoT) trending towards the least human intervention. Besides benefiting fields such medical, industry, and education, the IoT has also reformed vehicular ad hoc networks (VANETs) towards the Internet of Vehicles (IoV) by not just only assuring road safety but also by providing infotainment, insurance coverage, and other Internet applications that facilitate and enhance user’s vehicle experience. Content-centric networking (CCN) is a proven low-delay and independent-of-link stability architecture for the provisioning of all these facilities instead of using host-centric architecture. In CCN, the prime focus is to secure data rather than the user, which mitigates publishing false data and uplifts the need for validating the provided data. Blockchain is the technology which stores transaction, validated data, and is tamper-proof and able to be audited. IoVs with CCN form content-centric Internet of Vehicles (CC-IoVs) with temporary connectivity and data sharing, elevating the need for validated, tamper-proof, and auditable data (i.e., blockchain). Blockchain is a decentralised ledger and needs exhaustive computations; edge computing serves well to fulfil this need in a divide-and-conquer manner for calculations and data storage in blockchain-enabled CC-IoVs. In this chapter, we present a scheme that validates offensive events resulting from speeding vehicles, creates a block, and then adds the block to the chain associated to that highway. The proposed mechanism aims to work in the absence of speed cameras and traffic wardens with minimal network overhead, delay, and financial impact. In terms of least network overhead and delay, the proposed approach produces better results as compared to the prevalent technique.
Fueling Clinical and Translational Research in Appalachia: Informatics Platform Approach

Background The Appalachian population is distinct, not just culturally and geographically but also in its health care needs, facing the most health care disparities in the United States. To meet these unique demands, Appalachian medical centers need an arsenal of analytics and data science tools with the foundation of a centralized data warehouse to transform health care data into actionable clinical interventions. However, this is an especially challenging task given the fragmented state of medical data within Appalachia and the need for integration of other types of data such as environmental, social, and economic with medical data. Objective This paper aims to present the structure and process of the development of an integrated platform at a midlevel Appalachian academic medical center along with its initial uses. Methods The Appalachian Informatics Platform was developed by the Appalachian Clinical and Translational Science Institute’s Division of Clinical Informatics and consists of 4 major components: a centralized clinical data warehouse, modeling (statistical and machine learning), visualization, and model evaluation. Data from different clinical systems, billing systems, and state- or national-level data sets were integrated into a centralized data warehouse. The platform supports research efforts by enabling curation and analysis of data using the different components, as appropriate. Results The Appalachian Informatics Platform is functional and has supported several research efforts since its implementation for a variety of purposes, such as increasing knowledge of the pathophysiology of diseases, risk identification, risk prediction, and health care resource utilization research and estimation of the economic impact of diseases. Conclusions The platform provides an inexpensive yet seamless way to translate clinical and translational research ideas into clinical applications for regions similar to Appalachia that have limited resources and a largely rural population.
Contrastive Research of College Students' English Learning Methods Based on Internet and Traditional Environment

Before the popularity of smart phone, traditional English learning way was chosen by a lot of students. Traditional English learning way made the study more difficult for many students, and resulting in non-active study phenomenon. In recent years, with the help of smart phone APP, the quality and ability of students’ learning have been generally improved. It dramatically improves student's learning interest. The rapid emerging of Internet Technology in China provides tremendous development space for virtual learning. At the same time, it also launches enormous challenge to traditional learning way. Traditional learning way suffers unprecedented crisis, however, virtual learning way which from being questioned, there are inevitability and value of virtual learning which people begin to think about. In order to deal with the new situation, this paper outlines the online learning method and the traditional learning method respectively through comparative analysis. Through the literature review method to search the relevant references, the information obtained is integrated and summarized, the existing problems of network learning methods and traditional learning methods are analyzed. We can further put forward rational suggestions for future development.
ParaHist: FPGA Implementation of Parallel Event-Based Histogram for Optical Flow Calculation

In this paper, we present an FPGA-based architecture for histogram generation to support event-based camera optical flow calculation. Our proposed histogram generation mechanism reduces memory and logic resources by storing the time difference between consecutive events, instead of the absolute time of each event. Additionally, we explore the trade-off between system resource usage and histogram accuracy as a function of the precision at which time is encoded. Our results show that across three event-based camera benchmarks we can reduce the encoding of time from 32 to 7 bits with a loss of only approximately 3% in histogram accuracy. In comparison to a software implementation, our architecture shows a significant speedup.
3D shape measurement with an uncalibrated camera using the feature quantity type whole-space tabulation method

A prototype of a 3D shape measurement device with two cameras was developed, and the prototype was used to confirm the effectiveness of the 3D shape measurement method that does not require camera parameters. For 3D shape measurement using a fringe projection method, generally the pixel coordinate in the image and phase information of the projected fringe pattern are used; however, 3D coordinates can be obtained from only three fringe phase values. Recently, authors proposed this method as a feature quantity type whole-space tabulation method. There were no camera parameters required because pixel coordinates were not used, and thus a camera calibration-free 3D shape measurement can be realized. Moreover, the experimental evaluation was performed using the prototype having two cameras. Although these cameras were located at different positions and had lenses with different focal lengths, their measured shapes of an object were almost identical. An experiment of 3D shape measurement using an uncalibrated camera was performed. The effectiveness of the proposed method was quantitatively validated from experimental result obtained using the developed prototype.
Comprehensive Readiness Exam of Bachelors of Pedagogical Education in the Structure of the Independent Assessment of the Quality of Education

The purpose of the study is to justify the role and content of a comprehensive readiness exam for a future teaching profession in the structure of the independent assessment of the quality of education.The results of testing assessment materials and procedures for a comprehensive readiness exam on students of the Minin University (Nizhny Novgorod, Russia) in the educational field "Education and pedagogical sciences" are presented.A comprehensive readiness exam as a component of the independent assessment of the quality of education provides a model of targeted teacher training with a control system.It can be considered a successful solution in the field of teacher training in the formation of Russian national teacher growth system.A comprehensive readiness exam is considered by the authors as a mechanism for selecting motivated and highly qualified personnel and is defined as a comprehensive exam aimed at determining the compliance of real educational results achieved with social and personal expectations about the degree of readiness to receive a pedagogical profession.The components of a comprehensive readiness exam are the student's portfolio, testing in psychology and pedagogy, and (course/training) project defense within the subject area of future pedagogical activity.
Conditional wave theory of environmental interactions with a quantum particle

This paper presents a Conditional Wave Theory of collisional quantum decoherence, which reproduces the behavior of the Joos-Zeh master equation via a Schr\"odinger-like equation with a time-dependent logarithmic non-linearity.
Identifying Opportunities for Collective Curation During Archaeological Excavations

Archaeological excavations are comprised of interdisciplinary teams that create, manage, and share data as they unearth and analyse material culture. These team-based settings are ripe for collective curation during these data lifecycle stages. However, findings from four excavation sites show that the data interdisciplinary teams create are not well integrated. Knowing this, we recommended opportunities for collective curation to improve use and reuse of the data within and outside of the team.
Intersections of popular musicianship and computer science practices

Since the introduction of music education within public schools, curricular offerings have not developed in parallel with the myriad of practices popular musicians engage with outside school contexts. In other academic disciplines such as computer science, curricula and practices are iterative in nature and are responsive to the ever-changing practices that people engage with outside educational contexts. Although popular musicians are using computer science practices for music-related purposes, such practices are seldom discussed within music education scholarship. This article begins with an exploration of such intersections by describing hardware practices popular musicians use to modify, design or build electronic devices for music-related purposes. The following section introduces coding practices that people use to create and modify music software, as well as to make music with code. The article concludes by unpacking potential implications and considerations for educators interested in the intersections of popular musicianship and computer science practices.
Identifying Critical States by the Action-Based Variance of Expected Return

The balance of exploration and exploitation plays a crucial role in accelerating reinforcement learning (RL). To deploy an RL agent in human society, its explainability is also essential. However, basic RL approaches have difficulties in deciding when to choose exploitation as well as in extracting useful points for a brief explanation of its operation. One reason for the difficulties is that these approaches treat all states the same way. Here, we show that identifying critical states and treating them specially is commonly beneficial to both problems. These critical states are the states at which the action selection changes the potential of success and failure substantially. We propose to identify the critical states using the variance in the Q-function for the actions and to perform exploitation with high probability on the identified states. These simple methods accelerate RL in a grid world with cliffs and two baseline tasks of deep RL. Our results also demonstrate that the identified critical states are intuitively interpretable regarding the crucial nature of the action selection. Furthermore, our analysis of the relationship between the timing of the identification of especially critical states and the rapid progress of learning suggests there are a few especially critical states that have important information for accelerating RL rapidly.
Efficient Forward-Secure Threshold Signatures

Forward-secure threshold signatures are useful to mitigate the damage of secret key exposure. Constructions based on bilinear pairings are particularly interesting because they achieve shorter signatures than RSA-based constructions. We construct a forward-secure threshold signature scheme based on bilinear pairings. Compared to existing schemes, our scheme is much more efficient since it has a non-interactive key update and signing procedure. Additionally, our scheme does not require a trusted dealer and has optimal resilience as well as small signatures. Our scheme is the first one which achieves all of these and that can also be implemented on standardized curves. We prove our scheme EUF-CMA secure against adaptive malicious adversaries. Our technical approach is a combination of the forward-secure single user signature scheme by Drijvers and Neven with a slightly modified version of the distributed key generation protocol by Gennaro et al. This modified version allows the participating parties to adjust their secret key shares in a forward secure way.
Non-Additivity in Classical-Quantum Wiretap Channels

Due to Csiszar and Koerner, the private capacity of classical wiretap channels has a single-letter characterization in terms of the private information. For quantum wiretap channels, however, it is known that regularization of the private information is necessary to reach the capacity. Here, we study hybrid classical-quantum wiretap channels in order to resolve to what extent quantum effects are needed to witness non-additivity phenomena in quantum Shannon theory. For wiretap channels with quantum inputs but classical outputs, we prove that the characterization of the capacity in terms of the private information stays single-letter. Hence, entangled input states are of no asymptotic advantage in this setting. For wiretap channels with classical inputs, we show by means of explicit examples that the private information already becomes non-additive when either one of the two receivers becomes quantum (with the other receiver staying classical). This gives non-additivity examples that are not caused by entanglement and illustrates that quantum adversaries are strictly different from classical adversaries in the wiretap model.
Dynamics of the homogeneous two-qubit <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:mi>X</mml:mi><mml:mi>X</mml:mi><mml:mi>Z</mml:mi></mml:mrow></mml:math> central spin model with the spin bath prepared in superpositions of symmetric Dicke states

We obtain exact dynamics of a two-qubit central spin model (CSM) consisting of two interacting qubits homogeneously coupled to a spin bath via the $XXZ$-type coupling, with the bath initially prepared in linear superpositions of the symmetric Dicke states. Using the interaction picture Hamiltonian with respect to the non-spin-flipping part of the model, we derive a sequence of equations of motion within each magnetization sector satisfied by the probability amplitudes of the time-evolved state. These equations of motion admit analytical solutions for the single-qubit CSM in which one of the two central qubits decouples from the rest of the system. Based on this, we provide a quantitative interpretation to the observed collapse-revival phenomena in the single-qubit Rabi oscillations when the bath is prepared in the spin coherent state. We then study the disentanglement and coherence dynamics of two initially entangled noninteracting qubits when the two qubits interact with individual baths or with a common bath. For individual baths the coherent dynamics is found to positively correlated to the single-qubit purity dynamics, and entanglement sudden disappearance and revivals are observed in both cases. The entanglement creation of two initially separable qubits coupled to a common bath is also studied and collapse and revival behaviors in the entanglement dynamics are observed. Choosing the equally weighted state and the $W$-class states as the bath initial states, we finally study the dynamics of entanglement between two individual bath spins and demonstrate the entanglement sharing mechanism in such a system.
Machine Reading Comprehension on Multiclass Questions Using Bidirectional Attention Flow Models with Contextual Embeddings and Transfer Learning in Thai Corpus

In this paper, we develop a machine reading comprehension (MRC) model for Thai corpus provided by National Electronics and Computer Technology Center (NECTEC) under Thailand's 22nd National Software Contest (NSC2019). The dataset consists of 17,000 question-answer pairs which can be classified as (1) factoid and (2) yes-no questions. In this paper, we propose a deep learning architecture that supports multiclass questions based on Bidirectional Attention Flow model (BIDAF), one of recent machine reading comprehension models. It originally supports only factoid questions. To obtain the best performance, various architectures have been compared including (1) single model with special tokens, (2) joint model, and (3) cascading model. To further improve accuracy, there are two more contributions in our framework. First, contextualized word embeddings are built from a pre-trained language model called Bidirectional Encoder Representations from Transformers (BERT) to be used with our model. Second, transfer learning from a natural language inference (NLI) dataset has been employed. The experimental results show that our model significantly outperforms a baseline on both types of questions.
Joint separable numerical range and bipartite ultrafine entanglement witnessing

In 2017 an idea considering a pair of Hermitian operators of product form was published, which is called ultrafine entanglement witnessing. In 2018 some rigorous results were given. Here we improve their work. First we point this idea can be directly derived from an earlier concept named joint separable numerical range and explain how it works as a series of witnesses. Second by a simple method we present a sufficient condition for an effective pair. Finally we prove this condition is necessary for optimization.
NCC Based Correspondence Problem for First- and Second-Order Graph Matching

Automatically finding correspondences between object features in images is of main interest for several applications, as object detection and tracking, identification, registration, and many derived tasks. In this paper, we address feature correspondence within the general framework of graph matching optimization and with the principal aim to contribute. We proposed two optimized algorithms: first-order and second-order for graph matching. On the one hand, a first-order normalized cross-correlation (NCC) based graph matching algorithm using entropy and response through Marr wavelets within the scale-interaction method is proposed. First, we proposed a new automatic feature detection processing by using Marr wavelets within the scale-interaction method. Second, feature extraction is executed under the mesh division strategy and entropy algorithm, accompanied by the assessment of the distribution criterion. Image matching is achieved by the nearest neighbor search with normalized cross-correlation similarity measurement to perform coarse matching on feature points set. As to the matching points filtering part, the Random Sample Consensus Algorithm (RANSAC) removes outliers correspondences. One the other hand, a second-order NCC based graph matching algorithm is presented. This algorithm is an integer quadratic programming (IQP) graph matching problem, which is implemented in Matlab. It allows developing and comparing many algorithms based on a common evaluation platform, sharing input data, and a customizable affinity matrix and matching list of candidate solution pairs as input data. Experimental results demonstrate the improvements of these algorithms concerning matching recall and accuracy compared with other algorithms.
On Private Information Retrieval Supporting Range Queries

Private information retrieval (PIR) allows a client to retrieve data from a database without the database server learning what data is being retrieved. Although many PIR schemes have been proposed in the literature, almost all of these focus on retrieval of a single database element, and do not consider more flexible retrieval queries such as basic range queries. Furthermore, while practically-oriented database schemes aiming at providing flexible and privacy-preserving queries have been proposed, to the best of our knowledge, no formal treatment of range queries has been considered for these. In this paper, we firstly highlight that a simple extension of the standard PIR security notion to range queries, is insufficient in many usage scenarios, and propose a stronger security notion aimed at addressing this. We then show a simple generic construction of a PIR scheme meeting our stronger security notion, and propose a more efficient direct construction based on function secret sharing – while the former has a round complexity logarithmic in the size of the database, the round complexity of the latter is constant. Finally, we report on the practical performance of our direct construction.