Reviewerly/exHarmony huggingface dataset:
Finite-Sample Analysis for SARSA with Linear Function Approximation

SARSA is an on-policy algorithm to learn a Markov decision process policy in reinforcement learning. We investigate the SARSA algorithm with linear function approximation under the setting, where a single sample trajectory is available. With a Lipschitz continuous policy improvement operator that is smooth enough, SARSA has been shown to converge asymptotically. However, its non-asymptotic analysis is challenging and remains unsolved due to the non-i.i.d. samples, and the fact that the behavior policy changes dynamically with time. In this paper, we develop a novel technique to explicitly characterize the stochastic bias of a type of stochastic approximation procedures with time-varying Markov transition kernels. Our approach enables non-asymptotic convergence analyses of this type of stochastic approximation algorithms, which may be of independent interest. Using our bias characterization technique and a gradient descent type of analysis, we further provide the finite-sample analysis on the mean square error of the SARSA algorithm. In the end, we present a fitted SARSA algorithm, which includes the original SARSA algorithm and its variant as special cases. This fitted SARSA algorithm provides a framework for \textit{iterative} on-policy fitted policy iteration, which is more memory and computationally efficient. For this fitted SARSA algorithm, we also present its finite-sample analysis.
Characteristics and scenarios of solar energy development in Iran: Fuzzy cognitive map-based approach

Widespread use of promising solar energy is an integral attribute of governments toward global efforts in mitigating future emission and reducing the fossil fuel consumption trajectory. However, the outlook of solar energy development at the strategic level is driven by inherent uncertainties in a long-term perspective. As these unpredictable volatilities come into play, they heavily influence the future trends formed by a range of exogenous and endogenous factors including Political, Economic, Social, Technological, Environmental, and Legal (PESTEL). This study aimed at identifying, characterizing, and analyzing influential PESTEL factors shaping the dynamics of Solar Photovoltaics (SPV) in an uncertain environment. For this purpose, the Fuzzy Cognitive Mapping (FCM) method was employed for the case of Iran to investigate how involved factors dynamically interact and collectively behave in system. A participatory stepwise framework was developed consisting of three steps by conducting a survey and two workshops with the participation of multidisciplinary stakeholders. Aa a result, a semi-quantitative model was formed in an integrated FCM comprising 31 interwoven concepts. To further outline possible future trends, five key concepts were determined that explored four plausible projections of Iran's SPV sector. The scenario outcome suggests that the industry is profoundly affected by external economic and political factors. Two scenarios “Cornered in a Dead-End” and “At Wits' End” project that, by 2030, the sector experiences a declining growth trend. “The Period of Tolerance” scenario does not envisage a dramatic change from the current trajectory, while in only “Blue Sky” the country's SPV sector anticipate a moderate growth.
Infinite Families of Near MDS Codes Holding <i>t</i>-Designs

An [n, k, n - k + 1] linear code is called an MDS code. An [n, k, n - k] linear code is said to be almost maximum distance separable (almost MDS or AMDS for short). A code is said to be near maximum distance separable (near MDS or NMDS for short) if the code and its dual code both are almost maximum distance separable. The first near MDS code was the [11, 6, 5] ternary Golay code discovered in 1949 by Golay. This ternary code holds 4-designs, and its extended code holds a Steiner system S(5, 6, 12) with the largest strength known. In the past 70 years, sporadic near MDS codes holding t-designs were discovered and a lot of infinite families of near MDS codes over finite fields were constructed. However, the question as to whether there is an infinite family of near MDS codes holding an infinite family of t-designs for t ≥ 2 remains open for 70 years. This paper settles this long-standing problem by presenting an infinite family of near MDS codes over GF(3 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sup> ) holding an infinite family of 3-designs and an infinite family of near MDS codes over GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2s</sup> ) holding an infinite family of 2-designs. The subfield subcodes of these two families of codes are also studied, and are shown to be dimension-optimal or distance-optimal.
MuSig2: Simple Two-Round Schnorr Multi-signatures

Multi-signatures enable a group of signers to produce a joint signature on a joint message. Recently, Drijvers et al. (S&P’19) showed that all thus far proposed two-round multi-signature schemes in the pure DL setting (without pairings) are insecure under concurrent signing sessions. While Drijvers et al. proposed a secure two-round scheme, this efficiency in terms of rounds comes with the price of having signatures that are more than twice as large as Schnorr signatures, which are becoming popular in cryptographic systems due to their practicality (e.g., they will likely be adopted in Bitcoin). If one needs a multi-signature scheme that can be used as a drop-in replacement for Schnorr signatures, then one is forced to resort either to a three-round scheme or to sequential signing sessions, both of which are undesirable options in practice. In this work, we propose $$\mathsf {MuSig2} $$ , a simple and highly practical two-round multi-signature scheme. This is the first scheme that simultaneously i) is secure under concurrent signing sessions, ii) supports key aggregation, iii) outputs ordinary Schnorr signatures, iv) needs only two communication rounds, and v) has similar signer complexity as ordinary Schnorr signatures. Furthermore, it is the first multi-signature scheme in the pure DL setting that supports preprocessing of all but one rounds, effectively enabling a non-interactive signing process without forgoing security under concurrent sessions. We prove the security of $$\mathsf {MuSig2} $$ in the random oracle model, and the security of a more efficient variant in the combination of the random oracle and the algebraic group model. Both our proofs rely on a weaker variant of the OMDL assumption.
TJU-DHD: A Diverse High-Resolution Dataset for Object Detection

Vehicles, pedestrians, and riders are the most important and interesting objects for the perception modules of self-driving vehicles and video surveillance. However, the state-of-the-art performance of detecting such important objects (esp. small objects) is far from satisfying the demand of practical systems. Large-scale, rich-diversity, and high-resolution datasets play an important role in developing better object detection methods to satisfy the demand. Existing public large-scale datasets such as MS COCO collected from websites do not focus on the specific scenarios. Moreover, the popular datasets (e.g., KITTI and Citypersons) collected from the specific scenarios are limited in the number of images and instances, the resolution, and the diversity. To attempt to solve the problem, we build a diverse high-resolution dataset (called TJU-DHD). The dataset contains 115,354 high-resolution images (52% images have a resolution of 1624$\times$1200 pixels and 48% images have a resolution of at least 2,560$\times$1,440 pixels) and 709,330 labeled objects in total with a large variance in scale and appearance. Meanwhile, the dataset has a rich diversity in season variance, illumination variance, and weather variance. In addition, a new diverse pedestrian dataset is further built. With the four different detectors (i.e., the one-stage RetinaNet, anchor-free FCOS, two-stage FPN, and Cascade R-CNN), experiments about object detection and pedestrian detection are conducted. We hope that the newly built dataset can help promote the research on object detection and pedestrian detection in these two scenes. The dataset is available at https://github.com/tjubiit/TJU-DHD.
Meta-Transfer Learning Driven Tensor-Shot Detector for the Autonomous Localization and Recognition of Concealed Baggage Threats

Screening baggage against potential threats has become one of the prime aviation security concerns all over the world, where manual detection of prohibited items is a time-consuming and hectic process. Many researchers have developed autonomous systems to recognize baggage threats using security X-ray scans. However, all of these frameworks are vulnerable against screening cluttered and concealed contraband items. Furthermore, to the best of our knowledge, no framework possesses the capacity to recognize baggage threats across multiple scanner specifications without an explicit retraining process. To overcome this, we present a novel meta-transfer learning-driven tensor-shot detector that decomposes the candidate scan into dual-energy tensors and employs a meta-one-shot classification backbone to recognize and localize the cluttered baggage threats. In addition, the proposed detection framework can be well-generalized to multiple scanner specifications due to its capacity to generate object proposals from the unified tensor maps rather than diversified raw scans. We have rigorously evaluated the proposed tensor-shot detector on the publicly available SIXray and GDXray datasets (containing a cumulative of 1,067,381 grayscale and colored baggage X-ray scans). On the SIXray dataset, the proposed framework achieved a mean average precision (mAP) of 0.6457, and on the GDXray dataset, it achieved the precision and F1 score of 0.9441 and 0.9598, respectively. Furthermore, it outperforms state-of-the-art frameworks by 8.03% in terms of mAP, 1.49% in terms of precision, and 0.573% in terms of F1 on the SIXray and GDXray dataset, respectively.
Capture the contagion network of bitcoin – Evidence from pre and mid COVID-19

COVID-19 is the first global scale crisis since the inception of Bitcoin. We compare the contagion phenomenon of Bitcoin and other financial markets or assets pre and during the COVID-19 shock in both contemporaneous and non-contemporaneous manner. This paper uses the directed acyclic graph (DAG), spillover index, and network topology to provide strong evidence on the directional contagion outcomes of Bitcoin and other assets. The empirical results show that the contagion effect between Bitcoin and developed markets is strengthened during the COVID-19 crisis. Particularly, European market has a dominant role. Excluding Bitcoin’s own shocks, United State and European markets are the main contagion sources to Bitcoin. European market also works as a intermediary to deliver infectious from United State and market fear. The findings show that gold always has contagion effect with Bitcoin, while gold, US dollar and bond market are the contagion receivers of Bitcoin under the shock of COVID-19. The empirical results further proved the safe haven, hedge and diversifier potential of Bitcoin in economic stable time, but also shows that the sustainability of these properties is undermined during the market turmoil.
Introduction to the Fourth Annual Lifelog Search Challenge, LSC'21

The Lifelog Search Challenge (LSC) is an annual benchmarking challenge for comparing approaches to interactive retrieval from multi-modal lifelogs. LSC'21, the fourth challenge, attracted sixteen participants, each of which had developed interactive retrieval systems for large multimodal lifelogs. These interactive retrieval systems participated in a comparative evaluation in front of an online live-audience at the LSC workshop at ACM ICMR'21. This overview presents the motivation for LSC'21, the lifelog dataset used in the competition, and the participating systems.
Traffic Management: Multi-Scale Vehicle Detection in Varying Weather Conditions Using YOLOv4 and Spatial Pyramid Pooling Network

Detecting and counting on road vehicles is a key task in intelligent transport management and surveillance systems. The applicability lies both in urban and highway traffic monitoring and control, particularly in difficult weather and traffic conditions. In the past, the task has been performed through data acquired from sensors and conventional image processing toolbox. However, with the advent of emerging deep learning based smart computer vision systems the task has become computationally efficient and reliable. The data acquired from road mounted surveillance cameras can be used to train models which can detect and track on road vehicles for smart traffic analysis and handling problems such as traffic congestion particularly in harsh weather conditions where there are poor visibility issues because of low illumination and blurring. Different vehicle detection algorithms focusing the same issue deal only with on or two specific conditions. In this research, we address detecting vehicles in a scene in multiple weather scenarios including haze, dust and sandstorms, snowy and rainy weather both in day and nighttime. The proposed architecture uses CSPDarknet53 as baseline architecture modified with spatial pyramid pooling (SPP-NET) layer and reduced Batch Normalization layers. We also augment the DAWN Dataset with different techniques including Hue, Saturation, Exposure, Brightness, Darkness, Blur and Noise. This not only increases the size of the dataset but also make the detection more challenging. The model obtained mean average precision of 81% during training and detected smallest vehicle present in the image
Clustering multivariate functional data in group-specific functional subspaces

With the emergence of numerical sensors in many aspects of everyday life, there is an increasing need in analyzing multivariate functional data. This work focuses on the clustering of such functional data, in order to ease their modeling and understanding. To this end, a novel clustering technique for multivariate functional data is presented. This method is based on a functional latent mixture model which fits the data into group-specific functional subspaces through a multivariate functional principal component analysis. A family of parsimonious models is obtained by constraining model parameters within and between groups. An Expectation Maximization algorithm is proposed for model inference and the choice of hyper-parameters is addressed through model selection. Numerical experiments on simulated datasets highlight the good performance of the proposed methodology compared to existing works. This algorithm is then applied to the analysis of the pollution in French cities for 1 year.
Recent computational methods for white blood cell nuclei segmentation: A comparative study

Background and objective: Leukaemia is a disease found worldwide; it is a type of cancer that originates in the bone marrow and is characterised by an abnormal proliferation of white blood cells (leukocytes). In order to correctly identify this abnormality, haematologists examine blood smears from patients. A diagnosis obtained by this method may be influenced by factors such as the experience and level of fatigue of the haematologist, resulting in non-standard reports and even errors. In the literature, several methods have been proposed that involve algorithms to diagnose this disease. However, no reviews or surveys have been conducted. This paper therefore presents an empirical investigation of computational methods focusing on the segmentation of leukocytes. Methods: In our study, 15 segmentation methods were evaluated using five public image databases: ALL-IDB2, BloodSeg, Leukocytes, JTSC Database and CellaVision. Following the standard methodology for literature evaluation, we conducted a pixel-level segmentation evaluation by comparing the segmented image with its corresponding ground truth. In order to identify the strengths and weaknesses of these methods, we performed an evaluation using six evaluation metrics: accuracy, specificity, precision, recall, kappa, Dice, and true positive rate. Results: The segmentation algorithms performed significantly differently for different image databases, and for each database, a different algorithm achieved the best results. Moreover, the two best methods achieved average accuracy values higher than 97%, with an excellent kappa index. Also, the average Dice index indicated that the similarity between the segmented leukocyte and its ground truth was higher than 0.85 for these two methods This result confirms the high level of similarity between these images but does not guarantee that a method has segmented all leukocyte nuclei. We also found that the method that performed best segmented only 58.44% of all leukocytes. Conclusions: Of the techniques used to segment leukocytes, we note that clustering algorithms, the Otsu threshold, simple arithmetic operations and region growing are the approaches most widely used for this purpose. However, these computational methods have not yet overcome all the challenges posed by this problem.
Simple and precise static analysis of untrusted Linux kernel extensions

Extended Berkeley Packet Filter (eBPF) is a Linux subsystem that allows safely executing untrusted user-defined extensions inside the kernel. It relies on static analysis to protect the kernel against buggy and malicious extensions. As the eBPF ecosystem evolves to support more complex and diverse extensions, the limitations of its current verifier, including high rate of false positives, poor scalability, and lack of support for loops, have become a major barrier for developers.
Machine learning phase transitions with a quantum processor

Machine learning has emerged as a promising approach to study the properties of many-body systems. Recently proposed as a tool to classify phases of matter, the approach relies on classical simulation methods$-$such as Monte Carlo$-$which are known to experience an exponential slowdown when simulating certain quantum systems. To overcome this slowdown while still leveraging machine learning, we propose a variational quantum algorithm which merges quantum simulation and quantum machine learning to classify phases of matter. Our classifier is directly fed labeled states recovered by the variational quantum eigensolver algorithm, thereby avoiding the data reading slowdown experienced in many applications of quantum enhanced machine learning. We propose families of variational ansatz states that are inspired directly by tensor networks. This allows us to use tools from tensor network theory to explain properties of the phase diagrams the presented method recovers. Finally, we propose a nearest-neighbour (checkerboard) quantum neural network. This majority vote quantum classifier is successfully trained to recognize phases of matter with $99\%$ accuracy for the transverse field Ising model and $94\%$ accuracy for the XXZ model. These findings suggest that our merger between quantum simulation and quantum enhanced machine learning offers a fertile ground to develop computational insights into quantum systems.
A novel feature descriptor for image retrieval by combining modified color histogram and diagonally symmetric co-occurrence texture pattern

In this paper, we have proposed a novel feature descriptors combining color and texture information collectively. In our proposed color descriptor component, the inter-channel relationship between Hue (H) and Saturation (S) channels in the HSV color space has been explored which was not done earlier. We have quantized the H channel into a number of bins and performed the voting with saturation values and vice versa by following a principle similar to that of the HOG descriptor, where orientation of the gradient is quantized into a certain number of bins and voting is done with gradient magnitude. This helps us to study the nature of variation of saturation with variation in Hue and nature of variation of Hue with the variation in saturation. The texture component of our descriptor considers the co-occurrence relationship between the pixels symmetric about both the diagonals of a 3 × 3 window. Our work is inspired from the work done by Dubey et al. (IEEE Signal Process Lett 22(9):1215–1219, [2015]). These two components, viz. color and texture information individually perform better than existing texture and color descriptors. Moreover, when concatenated the proposed descriptors provide a significant improvement over existing descriptors for content base color image retrieval. The proposed descriptor has been tested for image retrieval on five databases, including texture image databases—MIT-VisTex database and Salzburg texture database and natural scene databases Corel 1K, Corel 5K and Corel 10K. The precision and recall values experimented on these databases are compared with some state-of-art local patterns. The proposed method provided satisfactory results from the experiments.
WisenetMD: Motion Detection Using Dynamic Background Region Analysis

In this paper, we propose a method for calculating the dynamic background region in a video and removing false positives in order to overcome the problems of false positives that occur due to the dynamic background and frame drop at slow speeds. Therefore, we need an efficient algorithm with a robust performance value including processing speed. The foreground is separated from the background by comparing the similarities between false positives and the foreground. In order to improve the processing speed, the median filter was optimized for the binary image. The proposed method was based on a CDnet 2012/2014 dataset and we achieved precision of 76.68%, FPR of 0.90%, FNR of 18.02%, and an F-measure of 75.35%. The average ranking across categories is 14.36, which is superior to the background subtraction method. The proposed method was operated at 45 fps (CPU), 150 fps (GPU) at 320 × 240 resolution. Therefore, we expect that the proposed method can be applied to current commercialized CCTV without any hardware upgrades.
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery

The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token Passing (TP) is a recent MAPD algorithm that is efficient and effective. We make TP even more efficient and effective by using a novel combinatorial search algorithm, called Safe Interval Path Planning with Reservation Table (SIPPwRT), for single-agent path planning. SIPPwRT uses an advanced data structure that allows for fast updates and lookups of the current paths of all agents in an online setting. The resulting MAPD algorithm TP-SIPPwRT takes kinematic constraints of real robots into account directly during planning, computes continuous agent movements with given velocities that work on non-holonomic robots rather than discrete agent movements with uniform velocity, and is complete for wellformed MAPD instances. We demonstrate its benefits for automated warehouses using both an agent simulator and a standard robot simulator. For example, we demonstrate that it can compute paths for hundreds of agents and thousands of tasks in seconds and is more efficient and effective than existing MAPD algorithms that use a post-processing step to adapt their paths to continuous agent movements with given velocities.