Reviewerly/exHarmony huggingface dataset:
Deciphering the Blockchain: A Comprehensive Analysis of Bitcoin's Evolution, Adoption, and Future Implications

This research paper provides a comprehensive analysis of Bitcoin, delving into its evolution, adoption, and potential future implications. As the pioneering cryptocurrency, Bitcoin has sparked significant interest and debate in recent years, challenging traditional financial systems and introducing the world to the power of blockchain technology. This paper aims to offer a thorough understanding of Bitcoin's underlying cryptographic principles, network architecture, and consensus mechanisms, primarily focusing on the Proof-of-Work model. We also explore the economic aspects of Bitcoin, examining price fluctuations, market trends, and factors influencing its value. A detailed investigation of the regulatory landscape, including global regulatory approaches, taxation policies, and legal challenges, offers insights into the hurdles and opportunities faced by the cryptocurrency. Furthermore, we discuss the adoption of Bitcoin in various use cases, its impact on traditional finance, and its role in the growing decentralized finance (DeFi) sector. Finally, the paper addresses the future of Bitcoin and cryptocurrencies, identifying emerging trends, technological innovations, and environmental concerns. We evaluate the potential impact of central bank digital currencies (CBDCs) on Bitcoin's future, as well as the broader implications of this technology on global finance. By providing a holistic understanding of Bitcoin's past, present, and potential future, this paper aims to serve as a valuable resource for scholars, policymakers, and enthusiasts alike.
Low-Shot Learning for Fictional Claim Verification

In this paper, we study the problem of claim verification in the context of claims about fictional stories in a low-shot learning setting. To this end, we generate two synthetic datasets and then develop an end-to-end pipeline and model that is tested on both benchmarks. To test the efficacy of our pipeline and the difficulty of benchmarks, we compare our models' results against human and random assignment results. Our code is available at https://github.com/Derposoft/plot_hole_detection.
StyleGAN Salon: Multi-View Latent Optimization for Pose-Invariant Hairstyle Transfer

Our paper seeks to transfer the hairstyle of a reference image to an input photo for virtual hair try-on. We target a variety of challenges scenarios, such as transforming a long hairstyle with bangs to a pixie cut, which requires removing the existing hair and inferring how the forehead would look, or transferring partially visible hair from a hat-wearing person in a different pose. Past solutions leverage StyleGAN for hallucinating any missing parts and producing a seamless face-hair composite through so-called GAN inversion or projection. However, there remains a challenge in controlling the hallucinations to accurately transfer hairstyle and preserve the face shape and identity of the input. To overcome this, we propose a multi-view optimization framework that uses "two different views" of reference composites to semantically guide occluded or ambiguous regions. Our optimization shares information between two poses, which allows us to produce high fidelity and realistic results from incomplete references. Our framework produces high-quality results and outperforms prior work in a user study that consists of significantly more challenging hair transfer scenarios than previously studied. Project page: https://stylegan-salon.github.io/.
Personalized Cognitive Tutoring using Davinci-003 API for Adaptive Question Generation and Assessment

This paper presents a cognitive tutor powered by Davinci 003 API that generates and evaluates personalized questions for students on any topic they choose. The tutor adapts to the student's level of understanding and fosters knowledge transfer by generating questions that relate the topic to different domains. This solution has the potential to improve student learning outcomes by providing personalized and adaptive questions that challenge them at their optimal level of difficulty. The feasibility of this solution has been demonstrated through a working prototype developed using Microsoft PowerApps. Additional research could reveal how affective computing principles could be integrated into the system to analyze the emotional valence of the user and how the system could be tuned to meet the specific needs of learners across the ASD spectrum. This solution is novel and offers more comprehensive support to a diverse range of learners than existing AI tutors, such as Quizlet's Q-Chat. The paper also includes an equity statement that outlines the author's commitment to promoting educational equity and addressing potential biases in the project.
MoStGAN-V: Video Generation with Temporal Motion Styles

Video generation remains a challenging task due to spatiotemporal complexity and the requirement of synthesizing diverse motions with temporal consistency. Previous works attempt to generate videos in arbitrary lengths either in an autoregressive manner or regarding time as a continuous signal. However, they struggle to synthesize detailed and diverse motions with temporal coherence and tend to generate repetitive scenes after a few time steps. In this work, we argue that a single time-agnostic latent vector of style-based generator is insufficient to model various and temporally-consistent motions. Hence, we introduce additional time-dependent motion styles to model diverse motion patterns. In addition, a Motion Style Attention modulation mechanism, dubbed as MoStAtt, is proposed to augment frames with vivid dynamics for each specific scale (i.e., layer), which assigns attention score for each motion style w.r.t deconvolution filter weights in the target synthesis layer and softly attends different motion styles for weight modulation. Experimental results show our model achieves state-of-the-art performance on four unconditional $256^2$ video synthesis benchmarks trained with only 3 frames per clip and produces better qualitative results with respect to dynamic motions. Code and videos have been made available at https://github.com/xiaoqian-shen/MoStGAN-V.
Microblog: An Interactive Learning Media for Learning English

This research intended to design a Microblog on Instagram as interactive learning media to learn the descriptive text for Grade 7. The media designed to assist students comprehend in English learning, especially descriptive text. This research was conducted at SMP Negeri 16 Tanjungpinang for the academic year 2021/2022 on class VII E, which consisted of 38 students. This research was Research and Development (R&amp;D). The development model was Thiagarajan model which are 4D (Define, Design, Develop, and Disseminate). Moreover, this research was limited to Develop stage. The instrument to collect the data was several questionnaires which consist of validation questionnaire and student practicality questionnaire. The results of data analysis revealed that the score of media validation is 86% with "very good/very valid" and the score of material validation is 90% with "very good/very valid". Thus, the score of the media trial to observe the practicality of the media is 80% with "practical". The Microblog on Instagram as Interactive Learning Media was valid and proper to use for learning and advantageous for students to comprehend English learning materials, especially on descriptive text.
Multi-Linear Kernel Regression and Imputation in Data Manifolds

&lt;p&gt;This paper introduces an efficient multi-linear non- parametric (kernel-based) approximation framework for data regression and imputation, and its application to dynamic magnetic-resonance imaging (dMRI). Data features are assumed to reside in or close to a smooth manifold embedded in a reproducing kernel Hilbert space. Landmark points are identified to describe concisely the point cloud of features by linear approximating patches which mimic the concept of tangent spaces to smooth manifolds. The multi-linear model effects dimensionality reduction, enables efficient computations, and extracts data patterns and their geometry without any training data or additional information. Numerical tests on dMRI data under severe under-sampling demonstrate remarkable improvements in efficiency and accuracy of the proposed approach over its predecessors, popular data modeling methods, as well as recent tensor-based and deep-image-prior schemes &lt;/p&gt;
Quantification of carpal tunnel morphology using centroid-to-boundary distance shape signatures

Morphology analysis is valuable to understanding risk factors and the etiology of carpal tunnel (CT) syndrome. The objective of this study was to investigate morphology changes along the length of the CT using shape signatures (SS). Analysis was performed on ten cadaveric specimens in neutral wrist posture. Centroid-to-boundary distance SS were generated for proximal, middle, and distal CT cross-sections. Phase shift and Euclidean distance were quantified relative to a template SS for each specimen. Medial, lateral, palmar, and dorsal peaks were identified on each SS to generate metrics of tunnel width, tunnel depth, peak amplitude, peak angle. Width and depth measures were also performed using previously reported methods to serve as a basis of comparison. The phase shift revealed twisting of 21° between the ends of the tunnel. Distance from the template and width varied significantly over the length of the tunnel, while depth did not. Measures of width and depth using the SS method were consistent with previously reported methods. The SS method afforded the advantage of peak analysis with overall trends of peak amplitude indicating flattening of the tunnel at the proximal and distal ends relative to a rounder shape in the middle.
Context-Aware Classification of Legal Document Pages

For many business applications that require the processing, indexing, and retrieval of professional documents such as legal briefs (in PDF format etc.), it is often essential to classify the pages of any given document into their corresponding types beforehand. Most existing studies in the field of document image classification either focus on single-page documents or treat multiple pages in a document independently. Although in recent years a few techniques have been proposed to exploit the context information from neighboring pages to enhance document page classification, they typically cannot be utilized with large pre-trained language models due to the constraint on input length. In this paper, we present a simple but effective approach that overcomes the above limitation. Specifically, we enhance the input with extra tokens carrying sequential information about previous pages - introducing recurrence - which enables the usage of pre-trained Transformer models like BERT for context-aware page classification. Our experiments conducted on two legal datasets in English and Portuguese respectively show that the proposed approach can significantly improve the performance of document page classification compared to the non-recurrent setup as well as the other context-aware baselines.
LSketch: A Label-Enabled Graph Stream Sketch Toward Time-Sensitive Queries

Graph streams represent data interactions in real applications. The mining of graph streams plays an important role in network security, social network analysis, and traffic control, among others. However, the sheer volume and high dynamics cause great challenges for efficient storage and subsequent query analysis on them. Current studies apply sketches to summarize graph streams. We propose LSketch that works for heterogeneous graph streams, which effectively preserves the label information carried by the streams in real scenes, thereby enriching the expressive ability of sketches. In addition, as graph streams continue to evolve over time, edges too old may lose their practical significance. Therefore, we introduce the sliding window model into LSketch to eliminate the expired edges automatically. LSketch uses sub-linear storage space and can support structure based queries and time-sensitive queries with high accuracy. We perform extensive experiments over four real datasets, demonstrating the superiority of the proposed method over state-of-the-art methods, in aspects of query accuracy and time efficiency.
MemeFier: Dual-stage Modality Fusion for Image Meme Classification

Hate speech is a societal problem that has significantly grown through the Internet. New forms of digital content such as image memes have given rise to spread of hate using multimodal means, being far more difficult to analyse and detect compared to the unimodal case. Accurate automatic processing, analysis and understanding of this kind of content will facilitate the endeavor of hindering hate speech proliferation through the digital world. To this end, we propose MemeFier, a deep learning-based architecture for fine-grained classification of Internet image memes, utilizing a dual-stage modality fusion module. The first fusion stage produces feature vectors containing modality alignment information that captures non-trivial connections between the text and image of a meme. The second fusion stage leverages the power of a Transformer encoder to learn inter-modality correlations at the token level and yield an informative representation. Additionally, we consider external knowledge as an additional input, and background image caption supervision as a regularizing component. Extensive experiments on three widely adopted benchmarks, i.e., Facebook Hateful Memes, Memotion7k and MultiOFF, indicate that our approach competes and in some cases surpasses state-of-the-art. Our code is available on https://github.com/ckoutlis/memefier.
SwarmGear: Heterogeneous Swarm of Drones with Reconfigurable Leader Drone and Virtual Impedance Links for Multi-Robot Inspection

The continuous monitoring by drone swarms remains a challenging problem due to the lack of power supply and the inability of drones to land on uneven surfaces. Heterogeneous swarms, including ground and aerial vehicles, can support longer inspections and carry a higher number of sensors on board. However, their capabilities are limited by the mobility of wheeled and legged robots in a cluttered environment. In this paper, we propose a novel concept for autonomous inspection that we call SwarmGear. SwarmGear utilizes a heterogeneous swarm that investigates the environment in a leader-follower formation. The leader drone is able to land on rough terrain and traverse it by four compliant robotic legs, possessing both the functionalities of an aerial and mobile robot. To preserve the formation of the swarm during its motion, virtual impedance links were developed between the leader and the follower drones. We evaluated experimentally the accuracy of the hybrid leader drone's ground locomotion. By changing the step parameters, the optimal step configuration was found. Two types of gaits were evaluated. The experiments revealed low crosstrack error (mean of 2 cm and max of 4.8 cm) and the ability of the leader drone to move with a 190 mm step length and a 3 degree standard yaw deviation. Four types of drone formations were considered. The best formation was used for experiments with SwarmGear, and it showed low overall crosstrack error for the swarm (mean 7.9 cm for the type 1 gait and 5.1 cm for the type 2 gait). The proposed system can potentially improve the performance of autonomous swarms in cluttered and unstructured environments by allowing all agents of the swarm to switch between aerial and ground formations to overcome various obstacles and perform missions over a large area.
IoT Federated Blockchain Learning at the Edge

IoT devices are sorely underutilized in the medical field, especially within machine learning for medicine, yet they offer unrivaled benefits. IoT devices are low-cost, energy-efficient, small and intelligent devices. In this paper, we propose a distributed federated learning framework for IoT devices, more specifically for IoMT (Internet of Medical Things), using blockchain to allow for a decentralized scheme improving privacy and efficiency over a centralized system; this allows us to move from the cloud-based architectures, that are prevalent, to the edge. The system is designed for three paradigms: 1) Training neural networks on IoT devices to allow for collaborative training of a shared model whilst decoupling the learning from the dataset to ensure privacy. Training is performed in an online manner simultaneously amongst all participants, allowing for the training of actual data that may not have been present in a dataset collected in the traditional way and dynamically adapt the system whilst it is being trained. 2) Training of an IoMT system in a fully private manner such as to mitigate the issue with confidentiality of medical data and to build robust, and potentially bespoke, models where not much, if any, data exists. 3) Distribution of the actual network training, something federated learning itself does not do, to allow hospitals, for example, to utilize their spare computing resources to train network models.
Parallel circuit implementation of variational quantum algorithms

We present a method to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution, that maximally exploits the limited number of qubits in hardware to solve large problem instances. We apply this specifically to combinatorial optimization problems, where inherent structures from the problem can be identified, thus directly informing how to create these parallelized quantum circuits, which we call slices. We test our method by creating a parallelized version of the Quantum Approximate Optimization Algorithm, which we call pQAOA, and explain how our methods apply to other quantum algorithms like the Variational Quantum Eigensolver and quantum annealing. We show that not only can our method address larger problems, but that it is also possible to run full VQA models while training parameters using only one slice. These results show that the loss of information induced by splitting does not necessarily affect the training of parameters in quantum circuits for optimization. This implies that combinatorial optimization problems are encoded with redundant information in quantum circuits of current VQAs. Therefore, to attain quantum advantage for combinatorial optimization, future quantum algorithms should be designed to incorporate information that is free of such redundancies.
Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution

Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. Compared to classical key exchange, it has two main advantages: (i) The key is unconditionally hidden to the eyes of any attacker, and (ii) its security assumes only the existence of authenticated classical channels which, in practice, can be realized using Minicrypt assumptions, such as the existence of digital signatures. On the flip side, QKD protocols typically require multiple rounds of interactions, whereas classical key exchange can be realized with the minimal amount of two messages using public-key encryption. A long-standing open question is whether QKD requires more rounds of interaction than classical key exchange. In this work, we propose a two-message QKD protocol that satisfies everlasting security, assuming only the existence of quantum-secure one-way functions. That is, the shared key is unconditionally hidden, provided computational assumptions hold during the protocol execution. Our result follows from a new construction of quantum public-key encryption (QPKE) whose security, much like its classical counterpart, only relies on authenticated classical channels.
Comptage des quiddit{é}s sur les corps finis et sur quelques anneaux $\mathbb{Z}/N\mathbb{Z}$

The $\lambda$-quiddities of size $n$ are $n$-tuples of elements of a fixed set, solutions of a matrix equation appearing in the study of Coxeter friezes. These can be considered on various sets with very different structures from one set to another. The main objective of this text is to obtain explicit formulas giving the number of $\lambda$-quiddities of size $n$ over finite fields and over the rings $\mathbb{Z}/N\mathbb{Z}$ with $N=4m$ and $m$ square free. We will also give some elements about the asymptotic behavior of the number of $\lambda$-quiddities verifying an irreducibility condition over $\mathbb{Z}/N\mathbb{Z}$ when $N$ goes to the infinity.
Static Fuzzy Bag-of-Words: a lightweight sentence embedding algorithm

The introduction of embedding techniques has pushed forward significantly the Natural Language Processing field. Many of the proposed solutions have been presented for word-level encoding; anyhow, in the last years, new mechanism to treat information at an higher level of aggregation, like at sentence- and document-level, have emerged. With this work we address specifically the sentence embeddings problem, presenting the Static Fuzzy Bag-of-Word model. Our model is a refinement of the Fuzzy Bag-of-Words approach, providing sentence embeddings with a predefined dimension. SFBoW provides competitive performances in Semantic Textual Similarity benchmarks, while requiring low computational resources.
BotTriNet: A Unified and Efficient Embedding for Social Bots Detection via Metric Learning

The rapid and accurate identification of bot accounts in online social networks is an ongoing challenge. In this paper, we propose BOTTRINET, a unified embedding framework that leverages the textual content posted by accounts to detect bots. Our approach is based on the premise that account personalities and habits can be revealed through their contextual content. To achieve this, we designed a triplet network that refines raw embeddings using metric learning techniques. The BOTTRINET framework produces word, sentence, and account embeddings, which we evaluate on a real-world dataset, CRESCI2017, consisting of three bot account categories and five bot sample sets. Our approach achieves state-of-the-art performance on two content-intensive bot sets, with an average accuracy of 98.34% and f1score of 97.99%. Moreover, our method makes a significant breakthrough on four content-less bot sets, with an average accuracy improvement of 11.52% and an average f1score increase of 16.70%. Our contribution is twofold: First, we propose a unified and effective framework that combines various embeddings for bot detection. Second, we demonstrate that metric learning techniques can be applied in this context to refine raw embeddings and improve classification performance. Our approach outperforms prior works and sets a new standard for bot detection in social networks.