Reviewerly/exHarmony huggingface dataset:
Design guidelines for limiting and eliminating virtual reality-induced symptoms and effects at work: a comprehensive, factor-oriented review

Virtual reality (VR) can induce side effects known as virtual reality-induced symptoms and effects (VRISE). To address this concern, we identify a literature-based listing of these factors thought to influence VRISE with a focus on office work use. Using those, we recommend guidelines for VRISE amelioration intended for virtual environment creators and users. We identify five VRISE risks, focusing on short-term symptoms with their short-term effects. Three overall factor categories are considered: individual, hardware, and software. Over 90 factors may influence VRISE frequency and severity. We identify guidelines for each factor to help reduce VR side effects. To better reflect our confidence in those guidelines, we graded each with a level of evidence rating. Common factors occasionally influence different forms of VRISE. This can lead to confusion in the literature. General guidelines for using VR at work involve worker adaptation, such as limiting immersion times to between 20 and 30 min. These regimens involve taking regular breaks. Extra care is required for workers with special needs, neurodiversity, and gerontechnological concerns. In addition to following our guidelines, stakeholders should be aware that current head-mounted displays and virtual environments can continue to induce VRISE. While no single existing method fully alleviates VRISE, workers' health and safety must be monitored and safeguarded when VR is used at work.
Characterizing Coin-Based Voting Governance in DPoS Blockchains

Delegated-Proof-of-Stake (DPoS) blockchains are governed by a committee of dozens of members elected via coin-based voting mechanisms. This paper presents a large-scale empirical study of two critical characteristics, personal impact and participation rate, of three leading DPoS blockchains. Our findings reveal the existence of decisive voters whose votes can alter election outcomes, as well as the fact that almost half of the coins have never been used in committee elections. Our research contributes to demystifying the actual use of coin-based voting governance and offers novel insights into the potential security risks of DPoS blockchains.
Generating optical cat states via quantum interference of multi-path free-electron–photons interactions

The novel quantum effects induced by the free-electron-photons interaction have attracted increasing interest due to their potential applications in ultrafast quantum information processing. Here, we propose a scheme to generate optical cat states based on the quantum interference of multi-path free-electron-photons interactions that take place simultaneously with strong coupling strength. By performing a projection measurement on the electron, the state of light changes significantly from a coherent state into a non-Gaussian state with either Wigner negativity or squeezing property, both possess metrological power to achieve quantum advantage. More importantly, we show that the Wigner negativity oscillates with the coupling strength, and the optical cat states are successfully generated with high fidelity at all the oscillation peaks. This oscillation reveals the quantum interference effect of the multiple quantum pathways in the interaction of the electron with photons, by that various nonclassical states of light are promising to be fast prepared and manipulated. These findings inspire further exploration of emergent quantum phenomena and advanced quantum technologies with free electrons.
Learned Data-aware Image Representations of Line Charts for Similarity Search

Finding line-chart images similar to a given line-chart image query is a common task in data exploration and image query systems, e.g. finding similar trends in stock markets or medical Electroencephalography images. The state-of-the-art approaches consider either data-level similarity (when the underlying data is present) or image-level similarity (when the underlying data is absent). In this paper, we study the scenario that during query time, only line-chart images are available. Our goal is to train a neural network that can turn these line-chart images into representations that are aware of the data used to generate these line charts, so as to learn better representations. Our key idea is that we can collect both data and line-chart images to learn such a neural network (at training step), while during query (or inference) time, we support the case that only line-chart images are provided. To this end, we present LineNet, a Vision Transformer-based Triplet Autoencoder model to learn data-aware image representations of line charts for similarity search. We design a novel pseudo labels selection mechanism to guide LineNet to capture both data-aware and image-level similarity of line charts. We further propose a diversified training samples selection strategy to optimize the learning process and improve the performance. We conduct both quantitative evaluation and case studies, showing that LineNet significantly outperforms the state-of-the-art methods for searching similar line-chart images.
Understanding Research Related to Designing for Children's Privacy and Security: A Document Analysis

Many children are growing up in a "digital-by-default" world, where technologies mediate many of their interactions. There is emerging consensus that those who design technology must support children's privacy and security. However, privacy and security are complex concepts that are challenging to design for, and centering the interests of children is similarly difficult. Through a document analysis of 90 HCI publications, we examine what problems and solutions designing for children's privacy and security addresses and how this research engages with children. Applying Solove's privacy taxonomy, we find that research addresses a range of problems related to information collection, processing, dissemination, and invasion at the organizational, system, and individual levels. Children's participation in this research is largely limited to providing feedback rather than helping to guide the research itself. Based on these findings, we offer recommendations for designers to sharpen their privacy and security contributions and center children in their work.
Gaze depth estimation for eye-tracking systems

Eye-tracking holds numerous promises for improving the mixed reality experience. While eye-tracking devices are capable of accurate gaze mapping on 2D surfaces, depth estimation of gaze points remains a challenging problem. Most gaze-based interaction applications are supported by estimation techniques that find a mapping between gaze data and corresponding targets on a 2D surface. This approach inevitably leads to a biased outcome, as the nearest objects in the line of sight will tend to be the target of interest more often. One viable solution would be to estimate gaze as a 3D coordinate (x, y, z) rather than the traditional 2D coordinate (x, y). This article first introduces a new comprehensive 3D gaze dataset collected in a realistic scene setting. Data was collected using a head-mounted eye-tracker and a depth estimation camera. Next, we present a novel depth estimation model, trained on the new gaze dataset to accurately predict gaze depth based on calibrated gaze vectors. This method could help develop a mapping between gaze and 3D objects on a 3D plane. The presented model improves the reliability of depth measurement of visual attention in real scenes as well as the accuracy of depth-based scenes in virtual reality environments. Improving situational awareness using 3D gaze data will benefit several domains, particularly human-vehicle interaction, autonomous driving, and augmented reality.
Validation of the EDUSS Framework for Self-Actualization Based on Transparent User Models: A Qualitative Study

Self-actualization is the process of striving toward full potential and achieving higher goals in one’s life. Originally studied in psychology, this concept has been adopted by various disciplines, including recommender systems, as a means of addressing issues like the filter bubble problem and promoting transparency. In an earlier work, we developed a theoretically-sound framework named EDUSS to systematically design interactive visualizations of transparent user models for self-actualization. We aim in this paper to validate the effectiveness of using the EDUSS framework to support self-actualization. To this end, we implemented interactive visualizations of transparent user interest models designed with the help of the EDUSS framework into the transparent Recommendation and Interest Modeling Application (RIMA). Further, we conducted a qualitative user study (N=10) to investigate the effect of these visualizations in supporting users to achieve self-actualization. Our study showed qualitative evidence validating that applying the EDUSS framework to design systems for self-actualization has the potential to help users reach self-actualization goals to a certain extent.
Robust Graph Autoencoder-Based Detection of False Data Injection Attacks Against Data Poisoning in Smart Grids

Machine learning-based detection of false data injection attacks (FDIAs) in smart grids relies on labeled measurement data for training and testing. The majority of existing detectors are developed assuming that the adopted datasets for training have correct labeling information. However, such an assumption is not always valid as training data might include measurement samples that are incorrectly labeled as benign, namely, adversarial data poisoning samples, which have not been detected before. Neglecting such an aspect makes detectors susceptible to data poisoning. Our investigations revealed that detection rates (DRs) of existing detectors significantly deteriorate by up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$9 - 29\%$</tex-math></inline-formula> when subject to data poisoning in generalized and topology-specific settings. Thus, we propose a generalized graph neural network (GNN)-based anomaly detector that is robust against FDIAs and data poisoning. It requires only benign datasets for training and employs an autoencoder with Chebyshev graph convolutional recurrent layers with attention mechanism to capture the spatial and temporal correlations within measurement data. The proposed convolutional recurrent graph autoencoder (CR-GAE) model is trained and tested on various topologies (from 14, 39, and 118-bus systems). Due to such factors, it yields stable generalized detection performance that is degraded by only <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$1.6 - 3.7\%$</tex-math></inline-formula> in DR against high levels of data poisoning and unseen FDIAs in unobserved topologies.
Fuzzy Influenced Process to Generate Comparable to Parallel Corpora

Data-driven supervised approaches rely on the parallel corpus. Due to lack of data and resources availability, it has become more difficult to achieve accurate outputs. In addition, the efficiency of the machine translation system depends on the quality of the used corpora. Hindi still lacks good quality parallel corpora and needs more resources for accurate machine translation. Comparable corpora are easily available compared to parallel corpora, but they cannot be used directly in machine translation. In our present research, we propose an algorithm to mine these comparable corpora from the web, and generate the parallel corpora automatically. Machine translation systems, system combination approach, and IR-based technique join their hands together to choose the set of sentence pairs. Then the sentence pairs having the best score are chosen to prepare the final parallel corpora. The primary modules of this architecture are fuzzy logic-based evaluation metric, information retrieval module, statistical machine translation system, Google neural machine translation system, Microsoft machine translation system, and system combination module for machine translation. For case study, we prepare the Hindi-English parallel corpora of (30825 + 51235) = 82060 sentence pairs. Evaluation results show that the F-Score measurement varies from 95.73 to 96.98 for various data sets. The source code and prepared dataset (comparable and parallel corpus) can be found at https://github.com/debajyoty/Comparable-partallel-Algo2.git.
Deep Neural Networks for Encrypted Inference with TFHE

Fully homomorphic encryption (FHE) is an encryption method that allows to perform computation on encrypted data, without decryption. FHE preserves the privacy of the users of online services that handle sensitive data, such as health data, biometrics, credit scores and other personal information. A common way to provide a valuable service on such data is through machine learning and, at this time, neural networks are the dominant machine learning model for unstructured data. In this work we show how to construct Deep Neural Networks (DNN) that are compatible with the constraints of TFHE, an FHE scheme that allows arbitrary depth computation circuits. We discuss the constraints and show the architecture of DNNs for two computer vision tasks. We benchmark the architectures using the Concrete stack ( https://github.com/zama-ai/concrete-ml ), an open-source implementation of TFHE.
Automating and Optimizing Data-Centric What-If Analyses on Native Machine Learning Pipelines

Software systems that learn from data with machine learning (ML) are used in critical decision-making processes. Unfortunately, real-world experience shows that the pipelines for data preparation, feature encoding and model training in ML systems are often brittle with respect to their input data. As a consequence, data scientists have to run different kinds of data centric what-if analyses to evaluate the robustness and reliability of such pipelines, e.g., with respect to data errors or preprocessing techniques. These what-if analyses follow a common pattern: they take an existing ML pipeline, create a pipeline variant by introducing a small change, and execute this pipeline variant to see how the change impacts the pipeline's output score. The application of existing analysis techniques to ML pipelines is technically challenging as they are hard to integrate into existing pipeline code and their execution introduces large overheads due to repeated work. We propose mlwhatif to address these integration and efficiency challenges for data-centric what-if analyses on ML pipelines. mlwhatif enables data scientists to declaratively specify what-if analyses for an ML pipeline, and to automatically generate, optimize and execute the required pipeline variants. Our approach employs pipeline patches to specify changes to the data, operators and models of a pipeline. Based on these patches, we define a multi-query optimizer for efficiently executing the resulting pipeline variants jointly, with four subsumption-based optimization rules. Subsequently, we detail how to implement the pipeline variant generation and optimizer of mlwhatif. For that, we instrument native ML pipelines written in Python to extract dataflow plans with re-executable operators. We experimentally evaluate mlwhatif, and find that its speedup scales linearly with the number of pipeline variants in applicable cases, and is invariant to the input data size. In end-to-end experiments with four analyses on more than 60 pipelines, we show speedups of up to 13x compared to sequential execution, and find that the speedup is invariant to the model and featurization in the pipeline. Furthermore, we confirm the low instrumentation overhead of mlwhatif.
PrivLava: Synthesizing Relational Data with Foreign Keys under Differential Privacy

Answering database queries while preserving privacy is an important problem that has attracted considerable research attention in recent years. A canonical approach to this problem is to use synthetic data. That is, we replace the input database R with a synthetic database R* that preserves the characteristics of R, and use R* to answer queries. Existing solutions for relational data synthesis, however, either fail to provide strong privacy protection, or assume that R contains a single relation. In addition, it is challenging to extend the existing single-relation solutions to the case of multiple relations, because they are unable to model the complex correlations induced by the foreign keys. Therefore, multi-relational data synthesis with strong privacy guarantees is an open problem. In this paper, we address the above open problem by proposing PrivLava, the first solution for synthesizing relational data with foreign keys under differential privacy, a rigorous privacy framework widely adopted in both academia and industry. The key idea of PrivLava is to model the data distribution in R using graphical models, with latent variables included to capture the inter-relational correlations caused by foreign keys. We show that PrivLava supports arbitrary foreign key references that form a directed acyclic graph, and is able to tackle the common case when R contains a mixture of public and private relations. Extensive experiments on census data sets and the TPC-H benchmark demonstrate that PrivLava significantly outperforms its competitors in terms of the accuracy of aggregate queries processed on the synthetic data.
Designated Verifier Signature with Claimability

This paper considers the problem of balancing traceability and anonymity in designated verifier signatures (DVS), which are a kind of group-oriented signatures. That is, we propose claimable designated verifier signatures (CDVS), where a signer is able to claim that he/she indeed created a signature later. Ordinal DVS does not provide any traceability, which could indicate too strong anonymity. Thus, adding claimability, which can be seen as a sort of traceability, moderates anonymity. We demonstrate two generic constructions of CDVS from (i) ring signatures, (non-ring) signatures, pseudorandom function, and commitment scheme, and (ii) claimable ring signatures (by Park and Sealfon, CRYPTO’19).
Artificial ecosystem optimization by means of fitness distance balance model for engineering design optimization

Abstract Optimization techniques have contributed to significant strides in complex real-world engineering problems. However, they must overcome several difficulties, such as the balance between the capacities for exploitation and exploration and avoiding local optimum. An enhanced Artificial Ecosystem Optimization (AEO) is proposed incorporating Fitness Distance Balance Model (FDB) for handling various engineering design optimization problems. In the proposed optimizer, the combined FDB design aids in selecting individuals who successfully contribute to population-level searches. Therefore, the FDB model is integrated with the AEO algorithm to increase the solution quality in nonlinear and multidimensional optimization situations. The FDBAEO is developed for handling six well-studied engineering optimization tasks considering the welded beam, the rolling element bearing, the pressure vessel, the speed reducer, the planetary gear train, and the hydrostatic thrust bearing design problems. The simulation outcomes were evaluated compared to the systemic AEO algorithm and other recent meta-heuristic approaches. The findings demonstrated that the FDBAEO reached the global optimal point more successfully. It has demonstrated promising abilities. Also, the proposed FDBAEO shows greater outperformance compared to several recent algorithms of Atomic Orbital Search, Arithmetic-Trigonometric, Beluga whale, Chef-Based, and Artificial Ecosystem Optimizers. Moreover, it declares great superiority compared to various reported optimizers.
GIS-Based Multi Criteria Analysis for Solar Power Plant Site Selection Support in Mecca

One of the major sources of renewable energy, particularly electricity generation and water desalination, is solar energy. The National Initiative to produce Water and Electricity started when the electricity consumption in Saudi Arabia begun to increase by about 5% per year. The current investigation aims to use a multicriteria GIS technique to identify the best spatial location for solar energy collection in the Mecca Administrative District. The best locations for solar power plant construction were determined with the use of a set of factors and criteria, including planning and environmental criteria, and terrain calibrator. These criteria were defined through a thorough literature review. This information was then used to create a digital geographic database, which was incorporated into an integrated GIS to produce a spatial fit model. According to the suitability data, most of Mecca region is ideal for solar energy projects, with an applicability percentage ranging between 30% and 80%. These findings are encouraging and promising for Mecca's renewable energy industry and they should be considered. It was discovered by examining these spatial locations and the level of suitability to the specifications that the lands with a sufficient share of more than 80% form an area of around 4000km2 and makeup 3% of all suitable lands. The governorates of the Mecca Administrative Area are home to most of these exceptionally suited locations. The Taif governorate takes first place with 35% of the total area and the two governorates of Turbah are placed second and third with 24% and 14%. In the Mecca Administrative Area, the appropriate lands for solar energy projects are distributed spatially according to a digital map. The study proposes incorporating the findings into the Saudi national plan for renewable energy sources.
Reducing the Impact of Sensor Orientation Variability in Human Activity Recognition Using a Consistent Reference System

Sensor- orientation is a critical aspect in a Human Activity Recognition (HAR) system based on tri-axial signals (such as accelerations); different sensors orientations introduce important errors in the activity recognition process. This paper proposes a new preprocessing module to reduce the negative impact of sensor-orientation variability in HAR. Firstly, this module estimates a consistent reference system; then, the tri-axial signals recorded from sensors with different orientations are transformed into this consistent reference system. This new preprocessing has been evaluated to mitigate the effect of different sensor orientations on the classification accuracy in several state-of-the-art HAR systems. The experiments were carried out using a subject-wise cross-validation methodology over six different datasets, including movements and postures. This new preprocessing module provided robust HAR performance even when sudden sensor orientation changes were included during data collection in the six different datasets. As an example, for the WISDM dataset, sensors with different orientations provoked a significant reduction in the classification accuracy of the state-of-the-art system (from 91.57 ± 0.23% to 89.19 ± 0.26%). This important reduction was recovered with the proposed algorithm, increasing the accuracy to 91.46 ± 0.30%, i.e., the same result obtained when all sensors had the same orientation.