Reviewerly/exHarmony huggingface dataset:
Network effects in blockchain and supply chain: a theoretical research synthesis

Purpose This paper addresses a gap in research literature in the fields of blockchain technology (BC), supply chain network dynamics (SC) and network effect phenomena (NE). Extant BC and SC literature describes the potential benefits to be reaped through the adoption of BC technology. While BC technology does not yet meet the researched expectations of adoption, performance and efficacy, the authors analyze the three inter-related fields (BC, SC and NE) to bridge this gap in theory. Design/methodology/approach This paper begins with a research review correlating the technological fundamentals of BC technology into fundamental value propositions for SC logistics contexts. The authors review the gap between these theoretical technological functions and the current ecosystem of BC applications. With an overarching understanding of BC in SC contexts, this paper then explores the phenomena of NE and attempts to synthesize various interrelated aspects of the three fields (BC, SC and NE). Research frameworks from extant literature are used for cross-comparing legacy software/information system solutions with potential and existing BC-based solutions. Case studies are utilized to support this analysis. Findings Several key considerations and themes are identified to better inform practitioner and researcher decision-making. Novel insights pertain to BC platform architecture and application modularity, integrated governance and decision-making capabilities, and the automation capabilities that arise from a healthy application and smart contract ecosystem. Originality/value The core contribution is the synthesis of network effect theory with SC phenomena and BC theory and the exploration of how these three fields are inter-related in the maturation of BC technology. Specifically, the authors deepen insights from extant literature by contextualizing findings with relevant interdisciplinary theoretical frameworks.
Identifying Emeishan basalt by supervised learning with Landsat-5 and ASTER data

Multispectral-sensor images are advantageous in terms of discriminating major lithologies due to their high spatial resolution and intermediate spectral resolution, in addition to their low cost and high accessibility in comparison to hyperspectral images. In this study, Landsat-5 Thematic Mapper ™ and the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) data—which are the most widely used multispectral data for the discrimination of the mixed rock units—are utilized to identify basalts in our study area. Further, prior knowledge regarding basalt-distribution areas in our study region is obtained from the geological-survey results conducted by the Sichuan Geological Survey at 2005, which is used as the reference of correction to assess our identified results. Small portions of this prior area of basalt distribution were verified through field checks, which were then determined as sites for use as training data for remote-sensing imagery. Three supervised-classification algorithms within ENVI 5.3—k-nearest neighbors (KNN), maximum likelihood classification (MLC), and support vertical machine (SVM)—were utilized for model identification. As a result, six models were constructed, including the KNN prediction of basalts by ASTER images, SVM prediction by ASTER, MLC prediction by ASTER, KNN prediction by Landsat-5 images, SVM prediction by Landsat-5, and MLC prediction by Landsat-5. The performances of the six models, in terms of precision and accuracy, show that the optimum model is Landsat-5 by SVM, with a precision of 70.92% and accuracy of 99.97%, followed by the ASTER by SVM model, with a precision of 67.72% and accuracy of 99.89% and the Landsat-5 by KNN model, with a precision of 57.23% and accuracy of 99.85%.
Emerging ICT Technologies for Agriculture, Training, and Capacity Building for Farmers in Developing Countries

This chapter explores the use of emerging ICT technologies for agriculture in Zimbabwe, a developing country in sub-Saharan Africa. It investigates the concept of ICT technologies and their potential impact on agriculture. The chapter then brings the background and context of the study. The chapter is premised on a qualitative approach which fuses a literature review to situate the chapter and eight (8) in-depth interviews and a ten (10) member focus group discussion to gather empirical data. The findings reveal that there are emerging ICT technologies in Zimbabwe which include artificial intelligence, drone technology, IoT, robots, and big data. However, the application and use of these technologies are still very localized and limited to big and highly capacitated commercial farmers, with very few smallholder farmers using the technology because of challenges that impede the adoption and use of these emerging ICT technologies for agriculture by the bulk of farmers. The chapter submitted measures that could be implemented to try and increase the adoption and increased use of these technologies.
Energy–time optimal path planning in dynamic flows: Theory and schemes

We obtain, solve, and verify fundamental differential equations for energy–time path planning in dynamic flows. The equations govern the energy–time reachable sets, optimal paths, and optimal controls for autonomous vehicles navigating to any destination in known dynamic environments, minimizing both energy usage and travel time. Based on Hamilton–Jacobi theory for reachability and the level set method, the resulting methodology computes the Pareto optimal solutions to the multi-objective path planning problem, numerically solving the exact equations governing the evolution of reachability fronts and optimal paths in the augmented energy and physical-space domain. Our approach is applicable to path planning in various dynamic flow environments and energy types. We first validate the methodology through a benchmark case of crossing a steady jet for which we compare our results to semi-analytical optimal energy–time solutions. We then consider unsteady flow environments and solve for energy–time optimal missions in a quasi-geostrophic double-gyre flow field. Results show that our theory and schemes can provide all the energy–time optimal solutions and that these solutions can be strongly influenced by unsteady flow conditions.
Achieving optimal rewards in cryptocurrency stubborn mining with state transition analysis

Bitcoin uses a decentralized network of miners and a distributed consensus algorithm to agree on blockchains to process transactions, and designs certain incentive strategy to ensure the system run persistently. However, recent research finds that it is vulnerable to specific game-theoretic attacks, in which a rational attack can gain a disproportionate share of reward by deviating from the honest behaviors. Among these attacks, stubborn mining is generally regarded as the most effective one. This paper propose the optimal stubborn mining strategy, trying to obtain the maximum revenue in stubborn mining. Through careful analysis, we find that the mining strategies in stubborn mining, under different conditions, can be represented as a Markovian Decision Process (MDP), and solving the MDP can result in the optimal strategy. In solving the MDP, we first transform it into a transition-reward Matrices, and then evaluate it to get the largest reward. With the method mentioned above, the attackers can get 46.9% additional than honest miners, and this attack outweighs traditional selfish mining (a compelling and well-studied mining attack) by up to 7.53%.
Cross-convolutional transformer for automated multi-organs segmentation in a variety of medical images

Objective.It is a huge challenge for multi-organs segmentation in various medical images based on a consistent algorithm with the development of deep learning methods. We therefore develop a deep learning method based on cross-convolutional transformer for these automated- segmentation to obtain better generalization and accuracy.Approach.We propose a cross-convolutional transformer network (C2Former) to solve the segmentation problem. Specifically, we first redesign a novel cross-convolutional self-attention mechanism in terms of the algorithm to integrate local and global contexts and model long-distance and short-distance dependencies to enhance the semantic feature understanding of images. Then multi-scale feature edge fusion module is proposed to combine the image edge features, which effectively form multi-scale feature streams and establish reliable relational connections in the global context. Finally, we use three different modalities, imaging three different anatomical regions to train and test multi organs and evaluate segmentation performance.Main results.We use the evaluation metrics of Dice similarity coefficient (DSC) and 95% Hausdorff distance (HD95) for each dataset. Experiments showed the average DSC of 83.22% and HD95 of 17.55 mm on the Synapse dataset (CT images of abdominal multi-organ), the average DSC of 91.42% and HD95 of 1.06 mm on the ACDC dataset (MRI of cardiac substructures) and the average DSC of 86.78% and HD95 of 16.85 mm on the ISIC 2017 dataset (skin cancer images). In each dataset, our proposed method consistently outperforms the compared networks.Significance.The proposed deep learning network provides a generalized and accurate solution method for multi-organ segmentation in the three different datasets. It has the potential to be applied to a variety of medical datasets for structural segmentation.
Robust two-state swap by stimulated Raman adiabatic passage

Efficient initialization and manipulation of quantum states is important for numerous applications and it usually requires the ability to perform high fidelity and robust swapping of the populations of quantum states. Stimulated Raman adiabatic passage (STIRAP) has been known to perform efficient and robust inversion of the ground states populations of a three-level system. However, its performance is sensitive to the initial state of the system. In this contribution we demonstrate that a slight modification of STIRAP, where we introduce a non-zero single-photon detuning, allows for efficient and robust population swapping for any initial state. The results of our work could be useful for efficient and robust state preparation, dynamical decoupling and design of quantum gates in ground state qubits via two-photon interactions.
Turkish abstractive text document summarization using text to text transfer transformer

Text summarization is the process of reducing text size while preserving its key points. Thanks to this process, the reading time of the text is also reduced which contributes to reaching the desired information quickly, especially in today's world where time is much more important. In addition, summarization can be used to create a solution to extract outstanding information from the text. In this study, we focus on abstract summarization, which can draw more human like conclusions from the text. A summarization study was carried out on the data set that was collected from online Turkish news sources. Rouge and Bert-score performance metrics were used to compare the performance of this study using the text to text transfer transformer (T5) method. The precision values ​​of the Rouge-1, Rouge-2, Rouge-L and Bert-score performance metrics obtained in this study were found to be 0.6913, 0.6623, 0.7528 and 0.8718, respectively. Recall values ​​were 0.9210, 0.8917, 0.9183 and 0.9138, respectively. F measure values ​​were 0.7649, 0.7338, 0.8084 and 0.8913 respectively. Considering the success of the results obtained in the study, a method that can obtain successful results for Turkish text summarization is presented and the original dataset is made available to other researchers.
Panoramic Panoptic Segmentation: Insights Into Surrounding Parsing for Mobile Agents via Unsupervised Contrastive Learning

In this work, we introduce panoramic panoptic segmentation, as the most holistic scene understanding, both in terms of Field of View (FoV) and image-level understanding for standard camera-based input. A complete surrounding understanding provides a maximum of information to a mobile agent. This is essential information for any intelligent vehicle to make informed decisions in a safety-critical dynamic environment such as real-world traffic. In order to overcome the lack of annotated panoramic images, we propose a framework which allows model training on standard pinhole images and transfers the learned features to the panoramic domain in a cost-minimizing way. The domain shift from pinhole to panoramic images is non-trivial as large objects and surfaces are heavily distorted close to the image border regions and look different across the two domains. Using our proposed method with dense contrastive learning, we manage to achieve significant improvements over a non-adapted approach. Depending on the efficient panoptic segmentation architecture, we can improve 3.5–6.5% measured in Panoptic Quality (PQ) over non-adapted models on our established Wild Panoramic Panoptic Segmentation (WildPPS) dataset. Furthermore, our efficient framework does not need access to the images of the target domain, making it a feasible domain generalization approach suitable for a limited hardware setting. As additional contributions, we publish WildPPS: The first panoramic panoptic image dataset to foster progress in surrounding perception and explore a novel training procedure combining supervised and contrastive training.
Multi-Modal Transformer with Global-Local Alignment for Composed Query Image Retrieval

In this paper, we study the composed query image retrieval, which aims at retrieving the target image similar to the composed query, i.e., a reference image and the desired modification text. Compared with conventional image retrieval, this task is more challenging as it not only requires precisely aligning the composed query and target image in a common embedding space, but also simultaneously extracting related information from the reference image and modification text. In order to properly extract related information from the composed query, existing methods usually embed vision-language inputs using different feature encoders, e.g., CNN for images and LSTM/BERT for text, and then employ a complicated manually-designed composition module for learning the joint image-text representation. However, the architecture discrepancy in feature encoders would restrict the vision-language plenitudinous interaction. Meanwhile, certain complicated composition designs might significantly hamper the generalization ability of the model. To tackle these problems, we propose a new framework termed ComqueryFormer, which effectively processes the composed query with the Transformer for this task. Specifically, to eliminate the architecture discrepancy, we leverage a unified transformer-based architecture to homogeneously encode the vision-language inputs. Meanwhile, instead of the complicated composition module, the neat yet effective cross-modal transformer is adopted to hierarchically fuse the composed query at various vision scales. On the other hand, we introduce an efficient global-local alignment module to narrow the distance between the composed query and the target image. It not only considers the divergence in the global joint embedding space but also forces the model to focus on the local detail differences. Extensive experiments on three real-world datasets demonstrate the superiority of our ComqueryFormer. Our code can be found at: <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/uestc-xyh/ComqueryFormer</uri> .
From Multiple Independent Metrics to Single Performance Measure Based on Objective Function

It is extremely common in engineering to design algorithms to perform various tasks. In data-driven decision making in any field one needs to ascertain the quality of an algorithm. Therefore, a robust assessment of algorithms is essential in deciding the best algorithm as well as in improving algorithms. To perform such an assessment objectively is obvious in the case of a single performance metric, but it is unclear in the case of multiple metrics. Nonetheless, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$F_{1}$ </tex-math></inline-formula> measure is widely used in cases with two metrics; <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$F_{1}$ </tex-math></inline-formula> measure represents the harmonic mean (HM) of two metrics. Of course, there are other means, e.g., the arithmetic mean (AM) and the geometric mean (GM). As motivations for using them are intuitive and none of them are based on any objective function, it is difficult to judge objectively which is the best one. In this paper, the single metric case is examined to develop two objective functions that are applicable for any number of metrics. These two objective functions lead to two different performance measures - the distance from the origin (DO) and the distance from the ideal position (DIP). It introduces a new concept of the remaining phase space for the evaluation of the quality of a performance measure. On further and closer examinations of the original goal and the phase space of the metrics, amongst these five measures, either HM or DIP is found to be the best. Specifically, it is found that HM is the best measure at the lower performance end, while DIP is clearly the best measure at the higher performance end and is of much practical interest. Rules for deciding the best algorithm and the order of a set of algorithms are presented. These results are derived in the context of multiple independent and bounded metrics. Furthermore, several properties and detailed discussions are provided, following which some published results are reviewed in the present context to elucidate some points.
HE-Booster: An Efficient Polynomial Arithmetic Acceleration on GPUs for Fully Homomorphic Encryption

Fully Homomorphic Encryption (FHE) enables secure offloading of computations to untrusted cloud servers as it allows computing on encrypted data. However, existing well-known FHE schemes suffer from heavy performance overheads. Thus numerous accelerations based on FPGAs, ASICs, and GPUs have been proposed. Compared to FPGAs and ASICs, GPUs have obvious advantages in productivity and development costs. And also, GPUs have already been widely deployed in commercial cloud or supercomputing centers. Therefore, we present HE-Booster, an efficient GPU-based FHE acceleration design. For single-GPU acceleration, a thorough systematic design is exploited to map five common phases in typical FHE schemes to the GPU parallel architecture. In particular, inspired by the regular architecture of NTT/INTT, a novel inter-thread local synchronization is proposed to exploit thread-level parallelism. For multi-GPU acceleration, we propose a scalable parallelization design that exploits <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">data-level parallelism</i> through fine-grained data partition under different representations. Finally, experiments on 1 NVIDIA GPU demonstrate that our work outperforms 251.7×, 78.5× and 164.9× than three mainstream CPU-based libraries HElib, SEAL, and PALISADE, and up to 170.5× speedup is obtained compared to the GPU-accelerated library cuHE. What's more, performing 8 homomorphic multiplications on 8 GPUs can deliver up to a 7.66× performance boost compared to a single-GPU implementation.
Sequential Monte Carlo: A Unified Review

Sequential Monte Carlo methods—also known as particle filters—offer approximate solutions to filtering problems for nonlinear state-space systems. These filtering problems are notoriously difficult to solve in general due to a lack of closed-form expressions and challenging expectation integrals. The essential idea behind particle filters is to employ Monte Carlo integration techniques in order to ameliorate both of these challenges. This article presents an intuitive introduction to the main particle filter ideas and then unifies three commonly employed particle filtering algorithms. This unified approach relies on a nonstandard presentation of the particle filter, which has the advantage of highlighting precisely where the differences between these algorithms stem from. Some relevant extensions and successful application domains of the particle filter are also presented.
Twenty years of e-learning in health science: A bibliometric

Education about health sciences has historically been limited in the curriculum of health professionals and largely inaccessible to the public. In practice, most of the health science education is still running conventionally. Supposedly with the advancement of technology and the use of the internet everywhere, learning such as e-learning can be important, especially in the health sector. Until this research was conducted, only 514 academic documents about e-learning in health sciences were found for 20 years from 2001 to 2020, obtained in searching on the Scopus database. This study presents a comprehensive overview of studies related to E-learning in the Health Sciences sector. This study uses bibliometric analysis and indexed digital methods to map scientific publications throughout the world. This research employs the Scopus database to gather information, as well as the Scopus online analysis tool and Vosviewer to show the bibliometric network. The method consists with five stages: determining search keywords, initial search results, refinement of search results, initial compilation, and data analysis. Among the most published and indexed articles by Scopus, papers published by researchers in the United States have the highest number of publications (80), followed by United Kingdom (63) and Australia with 45 academic publications. The processed data shows the pattern and trend of increasing the number of international publications in E-learning in Health Sciences field, which Scopus index.
Sentiments comparison on Twitter about LGBT

Twitter has become one of the most popular mediums for people to voice their opinions freely on any topic from around the world. Most companies use sentiment analysis from Twitter to see how well their product is. These opinions are categorized into three types which are positive, negative, and neutral sentiments. This paper focuses on Sentiment Analysis of LGBT, which has become a trending and controversial topic for society to talk about. We took these Tweets from fifty states in the United States of America and pre-process them before classifying their sentiment. We test five algorithms to classify the sentiments which are TextBlob PatternAnalyzer, Naive Bayes, Linear Support Vector Machine, Logistic Regression, and XGBoost using both non pre-processed data and pre-processed data. We found that the Logistic Regression without text-preprocessing gives us the best result with a 70.87% F1-score. After applying our sentiment classifier to the US tweets that talked about LGBT, we found that most tweets have a neutral sentiment.