Reviewerly/exHarmony huggingface dataset:
Cryptocurrencies: applications and investment opportunities

Purpose This study investigates the role of cryptocurrencies in enhancing the performance of portfolios constructed from traditional asset classes. Using a long sample period covering not only the large value increases but also the dramatic declines during the beginning of 2018, the purpose of this paper is to provide a more complete analysis of the dynamic nature of cryptocurrencies as individual investment opportunities, and as components of optimal portfolios. Design/methodology/approach The mean-variance optimization technique of Merton (1990) is applied to develop the risk and return characteristics of the efficient portfolios, along with the optimal weights of the asset class components in the portfolios. Findings The authors provide evidence that as a single investment, the best cryptocurrency is Ripple, followed by Bitcoin and Litecoin. Furthermore, cryptocurrencies have a useful role in the optimal portfolio construction and in investments, in addition to their original purposes for which they were created. Bitcoin is the best cryptocurrency enhancing the characteristics of the optimal portfolio. Ripple and Litecoin follow in terms of their usefulness in an optimal portfolio as single cryptocurrencies. Including all these cryptocurrencies in a portfolio generates the best (most optimal) results. Contributions of the cryptocurrencies to the optimal portfolio evolve over time. Therefore, the results and conclusions of this study have no guarantee for continuation in an exact manner in the future. However, the increasing popularity and the unique characteristics of cryptocurrencies will assist their future presence in investment portfolios. Originality/value This is one of the first studies that examine the role of popular cryptocurrencies in enhancing a portfolio composed of traditional asset classes. The sample period is the largest that has been used in this strand of the literature, and allows to compare optimal portfolios in early/recent subsamples, and during the pre-/post-cryptocurrency crisis periods.
Bidirectional Convolutional LSTM Neural Network for Remote Sensing Image Super-Resolution

Single-image super-resolution (SR) is an effective approach to enhance spatial resolution for numerous applications such as object detection and classification when the resolution of sensors is limited. Although deep convolutional neural networks (CNNs) proposed for this purpose in recent years have outperformed relatively shallow models, enormous parameters bring the risk of overfitting. In addition, due to the different scale of objects in images, the hierarchical features of deep CNN contain additional information for SR tasks, while most CNN models have not fully utilized these features. In this paper, we proposed a deep yet concise network to address these problems. Our network consists of two main structures: (1) recursive inference block based on dense connection reuse of local low-level features, and recursive learning is applied to control the model parameters while increasing the receptive fields; (2) a bidirectional convolutional LSTM (BiConvLSTM) layer is introduced to learn the correlations of features from each recursion and adaptively select the complementary information for the reconstruction layer. Experiments on multispectral satellite images, panchromatic satellite images, and nature high-resolution remote-sensing images showed that our proposed model outperformed state-of-the-art methods while utilizing fewer parameters, and ablation studies demonstrated the effectiveness of a BiConvLSTM layer for an image SR task.
3D-SSD: Learning hierarchical features from RGB-D images for amodal 3D object detection

This paper aims at developing a faster and more accurate solution to the amodal 3D object detection problem for indoor scenarios. The solution is achieved through a novel neural network structure which takes a pair of RGB-D images as input and delivers oriented 3D bounding boxes as the output. Such network, named 3D-SSD, has two components: hierarchical feature fusion and multi-layer prediction. The hierarchical feature fusion combines multi-scale appearance and geometric features learned from RGB-D images, which is later utilized in the multi-layer prediction for object detection. Both the accuracy and the efficiency can be improved by exploiting 2.5D representations in a synergistic way. To specifically address the shape variance of different objects, a set of 3D anchor boxes with varying physical sizes are attached to every location on the prediction layers. While testing, the category scores for 3D anchor boxes are generated with adjusted positions, sizes and orientations, leading to the final detections using non-maximum suppression. Comprehensive experiments have been performed on publicly accessible dataset of SUN RGB-D and NYUV2. The results show the proposed algorithm is the first 3D detector that runs in near real-time on the challenging datasets with competitive performance to the state-of-the-art methods. The 3D-SSD gets 37.1% mAP on the SUN RGB-D dataset at around 5.6 fps, which outperforms the state-of-the-art Deep Sliding Shape by 10.2% mAP and around 109 × faster. For an efficient model setting with a rate of 9.3 fps, 3D-SSD still gets an accuracy of 37% on mAP. Further, experiments also suggest the proposed approach achieves comparable accuracy and is about 477 × faster than the state-of-art method on the NYUv2 dataset even with a smaller input image size.
Spaghetti Labeling: Directed Acyclic Graphs for Block-Based Connected Components Labeling

Connected Components Labeling is an essential step of many Image Processing and Computer Vision tasks. Since the first proposal of a labeling algorithm, which dates back to the sixties, many approaches have optimized the computational load needed to label an image. In particular, the use of decision forests and state prediction have recently appeared as valuable strategies to improve performance. However, due to the overhead of the manual construction of prediction states and the size of the resulting machine code, the application of these strategies has been restricted to small masks, thus ignoring the benefit of using a block-based approach. In this paper, we combine a block-based mask with state prediction and code compression: the resulting algorithm is modeled as a Directed Rooted Acyclic Graph with multiple entry points, which is automatically generated without manual intervention. When tested on synthetic and real datasets, in comparison with optimized implementations of state-of-the-art algorithms, the proposed approach shows superior performance, surpassing the results obtained by all compared approaches in all settings.
A Frank-Wolfe Framework for Efficient and Effective Adversarial Attacks

Depending on how much information an adversary can access to, adversarial attacks can be classified as white-box attack and black-box attack. For white-box attack, optimization-based attack algorithms such as projected gradient descent (PGD) can achieve relatively high attack success rates within moderate iterates. However, they tend to generate adversarial examples near or upon the boundary of the perturbation set, resulting in large distortion. Furthermore, their corresponding black-box attack algorithms also suffer from high query complexities, thereby limiting their practical usefulness. In this paper, we focus on the problem of developing efficient and effective optimization-based adversarial attack algorithms. In particular, we propose a novel adversarial attack framework for both white-box and black-box settings based on a variant of Frank-Wolfe algorithm. We show in theory that the proposed attack algorithms are efficient with an O(1/√T) convergence rate. The empirical results of attacking the ImageNet and MNIST datasets also verify the efficiency and effectiveness of the proposed algorithms. More specifically, our proposed algorithms attain the best attack performances in both white-box and black-box attacks among all baselines, and are more time and query efficient than the state-of-the-art.
MemCap: Memorizing Style Knowledge for Image Captioning

Generating stylized captions for images is a challenging task since it requires not only describing the content of the image accurately but also expressing the desired linguistic style appropriately. In this paper, we propose MemCap, a novel stylized image captioning method that explicitly encodes the knowledge about linguistic styles with memory mechanism. Rather than relying heavily on a language model to capture style factors in existing methods, our method resorts to memorizing stylized elements learned from training corpus. Particularly, we design a memory module that comprises a set of embedding vectors for encoding style-related phrases in training corpus. To acquire the style-related phrases, we develop a sentence decomposing algorithm that splits a stylized sentence into a style-related part that reflects the linguistic style and a content-related part that contains the visual content. When generating captions, our MemCap first extracts content-relevant style knowledge from the memory module via an attention mechanism and then incorporates the extracted knowledge into a language model. Extensive experiments on two stylized image captioning datasets (SentiCap and FlickrStyle10K) demonstrate the effectiveness of our method.
Getting Closer to AI Complete Question Answering: A Set of Prerequisite Real Tasks

The recent explosion in question answering research produced a wealth of both factoid reading comprehension (RC) and commonsense reasoning datasets. Combining them presents a different kind of task: deciding not simply whether information is present in the text, but also whether a confident guess could be made for the missing information. We present QuAIL, the first RC dataset to combine text-based, world knowledge and unanswerable questions, and to provide question type annotation that would enable diagnostics of the reasoning strategies by a given QA system. QuAIL contains 15K multi-choice questions for 800 texts in 4 domains. Crucially, it offers both general and text-specific questions, unlikely to be found in pretraining data. We show that QuAIL poses substantial challenges to the current state-of-the-art systems, with a 30% drop in accuracy compared to the most similar existing dataset.
CD-UAP: Class Discriminative Universal Adversarial Perturbation

A single universal adversarial perturbation (UAP) can be added to all natural images to change most of their predicted class labels. It is of high practical relevance for an attacker to have flexible control over the targeted classes to be attacked, however, the existing UAP method attacks samples from all classes. In this work, we propose a new universal attack method to generate a single perturbation that fools a target network to misclassify only a chosen group of classes, while having limited influence on the remaining classes. Since the proposed attack generates a universal adversarial perturbation that is discriminative to targeted and non-targeted classes, we term it class discriminative universal adversarial perturbation (CD-UAP). We propose one simple yet effective algorithm framework, under which we design and compare various loss function configurations tailored for the class discriminative universal attack. The proposed approach has been evaluated with extensive experiments on various benchmark datasets. Additionally, our proposed approach achieves state-of-the-art performance for the original task of UAP attacking all classes, which demonstrates the effectiveness of our approach.
Relation-Aware Pedestrian Attribute Recognition with Graph Convolutional Networks

In this paper, we propose a new end-to-end network, named Joint Learning of Attribute and Contextual relations (JLAC), to solve the task of pedestrian attribute recognition. It includes two novel modules: Attribute Relation Module (ARM) and Contextual Relation Module (CRM). For ARM, we construct an attribute graph with attribute-specific features which are learned by the constrained losses, and further use Graph Convolutional Network (GCN) to explore the correlations among multiple attributes. For CRM, we first propose a graph projection scheme to project the 2-D feature map into a set of nodes from different image regions, and then employ GCN to explore the contextual relations among those regions. Since the relation information in the above two modules is correlated and complementary, we incorporate them into a unified framework to learn both together. Experiments on three benchmarks, including PA-100K, RAP, PETA attribute datasets, demonstrate the effectiveness of the proposed JLAC.
Ensemble of extreme learning machines for multivariate calibration of near-infrared spectroscopy

Inspired by the attractive features of extreme learning machine (ELM), a simple ensemble ELM algorithm, named EELM, is proposed for multivariate calibration of near-infrared spectroscopy. Such an algorithm takes full advantage of random initialization of the weights of the hidden layer in ELM for obtaining the diversity between member models. Also, by combining a large number of member models, the stability of the final prediction can be greatly improved and the ensemble model outperforms its best member model. Compared with partial least-squares (PLS), the superiority of EELM is attributed to its inherent characteristics of high learning speed, simple structure and excellent predictive performance. Three NIR spectral datasets concerning solid samples are used to verify the proposed algorithm in terms of both the accuracy and robustness. The results confirmed the superiority of EELM to classic PLS. Also, even if the experiment is done on NIR datasets, it provides a good reference for other spectral calibration.
HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems

The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophisticated solving techniques. In principle, this development would make the comparison between systems easier (because the domains are not tailored to a single system anymore) and – much more important – also the integration into other systems, because the modeling process is less tedious (due to the lack of advice) and there is no (or less) commitment to a certain planning system the model is created for. However, these advantages are destroyed by the lack of a common input language and feature set supported by the different systems. In this paper, we propose an extension to PDDL, the description language used in non-hierarchical planning, to the needs of hierarchical planning systems.
An Empirical Study on Heterogeneous Defect Prediction Approaches

Software defect prediction has always been a hot research topic in the field of software engineering owing to its capability of allocating limited resources reasonably. Compared with cross-project defect prediction (CPDP), heterogeneous defect prediction (HDP) further relaxes the limitation of defect data used for prediction, permitting different metric sets to be contained in the source and target projects. However, there is still a lack of a holistic understanding of existing HDP studies due to different evaluation strategies and experimental settings. In this paper, we provide an empirical study on HDP approaches. We review the research status systematically and compare the HDP approaches proposed from 2014 to June 2018. Furthermore, we also investigate the feasibility of HDP approaches in CPDP. Through extensive experiments on 30 projects from five datasets, we have the following findings: (1) metric transformation-based HDP approaches usually result in better prediction effects, while metric selection-based approaches have better interpretability. Overall, the HDP approach proposed by Li <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> (CTKCCA) currently has the best performance. (2) Handling class imbalance problems can boost the prediction effects, but the improvements are usually limited. In addition, utilizing mixed project data cannot improve the performance of HDP approaches consistently since the label information in the target project is not used effectively. (3) HDP approaches are feasible for cross-project defect prediction in which the source and target projects have the same metric set.
Tiny YOLO Optimization Oriented Bus Passenger Object Detection

The real-time collection of bus passenger object detection is an essential part of developing a smart bus system. The difficulty of object detection mainly lies in the objective factors, such as: clothing, hair style and accessories, light, etc. Traditional object detection methods with the artificial feature extraction suffers from insufficient strength in expression, generalization, and recognition rate. The object detection method based on deep learning mainly uses the convolutional neural network in deep learning to learn features from a large set of data. The learned features can describe the rich information inherent in the data, and improve the expression ability of the features as well as the recognition accuracy. Due to too many parameters of the Convolutional neural network (CNN) model, the amount of calculation is too large to be operated on the vehicle terminal. To reduce calculation burden and improve the operation speed, we employs the depthwise separable convolution method to optimize the convolutional layer of tiny YOLO network model. It decomposes a complete convolution operation into depthwise convolution and pointwise convolution, thus reducing the parameter amount of the CNN and improving the operation speed. The experiment results reveal that the speed of bus passenger object detection detected by our improved model is 4 times faster than the previous one but with the nearly same detection accuracy.
Unsupervised Learning of Depth, Optical Flow and Pose With Occlusion From 3D Geometry

In autonomous driving, monocular sequences contain lots of information.Monocular depth estimation, camera ego-motion estimation and optical flow estimation in consecutive frames are high-profile concerns recently.By analyzing tasks above, pixels in the middle frame are modeled into three parts: the rigid region, the non-rigid region, and the occluded region.In joint unsupervised training of depth and pose, we can segment the occluded region explicitly.The occlusion information is used in unsupervised learning of depth, pose and optical flow, as the image reconstructed by depth-pose and optical flow will be invalid in occluded regions.A less-than-mean mask is designed to further exclude the mismatched pixels interfered with by motion or illumination change in the training of depth and pose networks.This method is also used to exclude some trivial mismatched pixels in the training of the optical flow network.Maximum normalization is proposed for depth smoothness term to restrain depth degradation in textureless regions.In the occluded region, as depth and camera motion can provide more reliable motion estimation, they can be used to instruct unsupervised learning of optical flow.Our experiments in KITTI dataset demonstrate that the model based on three regions, full and explicit segmentation of the occlusion region, the rigid region, and the non-rigid region with corresponding unsupervised losses can improve performance on three tasks significantly.The source code is available at: https://github.com/guangmingw/DOPlearning.
Nonlocal sets of orthogonal product states in an arbitrary multipartite quantum system

Recently, much attention have been paid to the constructions of nonlocal multipartite orthogonal product states. Among the existing results, some are relatively complex in structure while others have many constraint conditions. In this paper, we first give a simple method to construct a nonlocal set of orthogonal product states in ${\ensuremath{\bigotimes}}_{j=1}^{n}{\mathbb{C}}^{d}$, where $d,\phantom{\rule{0.16em}{0ex}}n$ are two positive integers, $d\ensuremath{\ge}2$ and $n\ensuremath{\ge}3$. Then we give a proof for local indistinguishability of the set constructed by our method. According to the characteristics of this construction method, we get a new construction of nonlocal set with fewer states in the same quantum system. Furthermore, we generalize these two results to a more general ${\ensuremath{\bigotimes}}_{j=1}^{n}{\mathbb{C}}^{{d}_{j}}$ quantum system, where $n,\phantom{\rule{0.16em}{0ex}}{d}_{j}$ are two positive integers, $n\ensuremath{\ge}3$ and ${d}_{j}\ensuremath{\ge}2$. Compared with the existing results, the nonlocal set of multipartite orthogonal product states constructed by our method has fewer elements and is simpler. Most of all, our multipartite constructions are more general than the ones reported earlier.
Improving Speech Recognition Using Consistent Predictions on Synthesized Speech

Speech synthesis has advanced to the point of being close to indistinguishable from human speech. However, efforts to train speech recognition systems on synthesized utterances have not been able to show that synthesized data can be effectively used to augment or replace human speech. In this work, we demonstrate that promoting consistent predictions in response to real and synthesized speech enables significantly improved speech recognition performance. We also find that training on 460 hours of LibriSpeech augmented with 500 hours of transcripts (without audio) performance is within 0.2% WER of a system trained on 960 hours of transcribed audio. This suggests that with this approach, when there is sufficient text available, reliance on transcribed audio can be cut nearly in half.
Pengembangan Media Video Pembelajaran Ilmu Pengetahuan Sosial pada Siswa Sekolah Dasar

Development of instructional media for learning valid and effective video learning media as a learning resource for social studies learning in grade IV elementary school. The development of this instructional video media uses the ASSURE model which has 6 stages: (1) analysis of students, (2) determining learning objectives, (3) choosing methods, media and materials, (4) using media and materials, (5) encouraging participation students, (6) evaluation and improvement. The subject of the development of this instructional video media is Grade IV students of SDN Pakis V. The development of this video media is declared valid to be used in social studies learning in class IV. This is obtained from the results of the validation of media experts, material experts, individual students, small groups, large groups / classical. After testing the experts and testing the students then conducted trials aimed at learning effectiveness using this instructional video media. Test results obtained in the use of instructional video media show that students have succeeded in getting grades above the specified KKM. Thus it can be denied that this instructional video learning media is effective for use in the learning process. Keywords: media development, video learning, social studies.