Reviewerly/exHarmony huggingface dataset:
Automatic Modulation Classification Architectures Based on Cyclostationary Features in Impulsive Environments

Cyclostationary analysis has several applications in communications, e.g., spectral sensing, signal parameter estimation, and modulation classification. Most of them consider the additive white Gaussian noise (AWGN) channel model, although wireless communication systems may also be subject to non-Gaussian interference and impulsive noise. In this context, the communication channel can be better modeled by heavy-tailed distributions, such as the non-Gaussian alpha-stable one. Some applications of the cyclostationary approach based on the spatial sign cyclic correlation function (SSCCF), fractional lower-order cyclic autocorrelation function (FLOCAF), and cyclic correntropy function (CCF) demonstrate that these are promising solutions for the analysis of signals in the presence of impulsive non-Gaussian noise. However, the investigation of functions above applied to digital modulation recognition in impulsive environments, and the comparison among them are topics that did not adequately explore yet. This work demonstrates that SSCCF is a particular case of the FLOCAF. Besides, a detailed analysis of the use of the FLOCAF and CCF is presented to obtain cyclostationary descriptors for the recognition of digital modulations BPSK, QPSK, 8-QAM, 16-QAM, and 32-QAM. Automatic modulation classification (AMC) architectures, based on the functions mentioned above, are also proposed. Besides, another contribution showed is that both the FLOCAF and CCF allow the symbol rate parameter estimation. The performances of AMC architectures were evaluated in the scenario with modulated signals contaminated with additive non-Gaussian alpha-stable noise. The results demonstrate that both architectures can classify signals in different contamination scenarios. However, the architecture based on the CCF is more efficient than the FLOCAF-based one.
ShapeShifter

We show that selecting a data width for all values in Deep Neural Networks, quantized or not and even if that width is different per layer, amounts to worst-case design. Much shorter data widths can be used if we target the common case by adjusting the data type width at a much finer granularity. We propose ShapeShifter, where we group weights and activations and encode them using a width specific to each group and where typical group sizes vary from 16 to 256 values. The per group widths are selected statically for the weights and dynamically by hardware for the activations. We present two applications of ShapeShifter. In the first, that is applicable to any system, ShapeShifter reduces off- and on-chip storage and communication. This ShapeShifter-based memory compression is simple and low cost yet reduces off-chip traffic to 33% and 36% for 8-bit and 16-bit models respectively. This makes it possible to sustain higher performance for a given off-chip memory interface while also boosting energy efficiency. In the second application, we show how ShapeShifter can be implemented as a surgical extension over designs that exploit variable precision in time.
Realtime top-k personalized pagerank over large graphs on GPUs

Given a graph G , a source node s ∈ G and a positive integer k , a top- k Personalized PageRank (PPR) query returns the k nodes with the highest PPR values with respect to s , where the PPR of a node v measures its relevance from the perspective of source s. Top- k PPR processing is a fundamental task in many important applications such as web search, social networks, and graph analytics. This paper aims to answer such a query in realtime , i.e., within less than 100ms, on an Internet-scale graph with billions of edges. This is far beyond the current state of the art, due to the immense computational cost of processing a PPR query. We achieve this goal with a novel algorithm kPAR, which utilizes the massive parallel processing power of GPUs. The main challenge in designing a GPU-based PPR algorithm lies in that a GPU is mainly a parallel computation device, whereas PPR processing involves graph traversals and value propagation operations, which are inherently sequential and memory-bound. Existing scalable PPR algorithms are mostly described as single-thread CPU solutions that are resistant to parallelization. Further, they usually involve complex data structures which do not have efficient adaptations on GPUs. kPAR overcomes these problems via both novel algorithmic designs (namely, adaptive forward push and inverted random walks ) and system engineering (e.g., load balancing) to realize the potential of GPUs. Meanwhile, kPAR provides rigorous guarantees on both result quality and worst-case efficiency. Extensive experiments show that kPAR is usually 10x faster than parallel adaptations of existing methods. Notably, on a billion-edge Twitter graph, kPAR answers a top-1000 PPR query in 42.4 milliseconds.
Factors affecting Jordanian electronic banking services

This study aimed to identify the factors influencing on electronic banking services provided by Jordanian banks.Perceived usefulness, ease of use, trust, privacy and security and convenience are the factors investigated in this study.A sample of 300 clients working at King Abdullah University Hospital staff who were active bank accounts in different local banks in Jordan was selected, randomly.To collect the primary data, the study used a questionnaire design based on a 5-point scale.Results of the study found that perceived usefulness, ease of use, trust and privacy directly and positively influenced on e-banking usage.Convenience was found to have no effect on e-banking services.The study recommends that an understanding the factors affecting e-banking is very essential for the practitioners who seek new ways of banking services in the current competitive environment.
Land Cover Mapping using Digital Earth Australia

This study establishes the use of the Earth Observation Data for Ecosystem Monitoring (EODESM) to generate land cover and change classifications based on the United Nations Food and Agriculture Organisation (FAO) Land Cover Classification System (LCCS) and environmental variables (EVs) available within, or accessible from, Geoscience Australia’s (GA) Digital Earth Australia (DEA). Classifications representing the LCCS Level 3 taxonomy (8 categories representing semi-(natural) and/or cultivated/managed vegetation or natural or artificial bare or water bodies) were generated for two time periods and across four test sites located in the Australian states of Queensland and New South Wales. This was achieved by progressively and hierarchically combining existing time-static layers relating to (a) the extent of artificial surfaces (urban, water) and agriculture and (b) annual summaries of EVs relating to the extent of vegetation (fractional cover) and water (hydroperiod, intertidal area, mangroves) generated through DEA. More detailed classifications that integrated information on, for example, forest structure (based on vegetation cover (%) and height (m); time-static for 2009) and hydroperiod (months), were subsequently produced for each time-step. The overall accuracies of the land cover classifications were dependent upon those reported for the individual input layers, with these ranging from 80% (for cultivated, urban and artificial water) to over 95% (for hydroperiod and fractional cover). The changes identified include mangrove dieback in the southeastern Gulf of Carpentaria and reduced dam water levels and an associated expansion of vegetation in Lake Ross, Burdekin. The extent of detected changes corresponded with those observed using time-series of RapidEye data (2014 to 2016; for the Gulf of Carpentaria) and Google Earth imagery (2009–2016 for Lake Ross). This use case demonstrates the capacity and a conceptual framework to implement EODESM within DEA and provides countries using the Open Data Cube (ODC) environment with the opportunity to routinely generate land cover maps from Landsat or Sentinel-1/2 data, at least annually, using a consistent and internationally recognised taxonomy.
Partially Shared Adversarial Learning For Semi-supervised Multi-platform User Identity Linkage

With the increasing popularity and diversity of social media, users tend to join multiple social platforms to enjoy different types of services. User identity linkage, which aims to link identical identities across different social platforms, has attracted increasing research attentions recently. Existing methods usually focus on pairwise identity linkage between two platforms, which cannot piece up the information from multi-sources to depict the intrinsic figures of social users. In this paper, we propose a novel adversarial learning based framework MSUIL with partially shared generators to perform Semi-supervised User Identity Linkage across Multiple social networks. The isomorphism across multiple platforms is captured as the complementary to link identities. The insight is that we aim to learn the desirable projection functions (generators) to not only minimize the distance between the distributions of user identities in arbitrary pairs of platforms, but also incorporate the available annotations as the learning guidance. The projection functions of different platform pairs share partial parameters, which ensures MSUIL can capture the interdependencies among multiple platforms and improves the model efficiency. Empirically, we evaluate our proposal over multiple datasets. The experimental results demonstrate the superiority of the proposed MSUIL model.
Medical image interpolation based on 3D Lanczos filtering

Several medical imaging techniques have been employed to create visual representations of internal anatomic structures, such as organs and tissues, for clinical procedures. Diagnosis and treatment of diseases have benefited from the use of imaging modalities, such as computed tomography, magnetic resonance imaging, ultrasonography, mammography, and photon emission tomography. Interpolation is a method for generating new data points on a regular grid from a set of known data points, as result of some image transformations, such as scaling and rotation. Several filters have been proposed to implement image interpolation. In this paper, we develop and evaluate a resampling method based on the three-dimensional Lanczos kernel. Experiments are conducted on several medical images and videos to demonstrate the effectiveness of the proposed interpolation approach.
RaPP: Novelty Detection with Reconstruction along Projection Pathway

We propose RaPP, a new methodology for novelty detection by utilizing hidden space activation values obtained from a deep autoencoder. Precisely, RaPP compares input and its autoencoder reconstruction not only in the input space but also in the hidden spaces. We show that if we feed a reconstructed input to the same autoencoder again, its activated values in a hidden space are equivalent to the corresponding reconstruction in that hidden space given the original input. In order to aggregate the hidden space activation values, we propose two metrics, which enhance the novelty detection performance. Through extensive experiments using diverse datasets, we validate that RaPP improves novelty detection performances of autoencoder-based approaches. Besides, we show that RaPP outperforms recent novelty detection methods evaluated on popular benchmarks.
Revisiting Image Aesthetic Assessment via Self-Supervised Feature Learning

Visual aesthetic assessment has been an active research field for decades. Although latest methods have achieved promising performance on benchmark datasets, they typically rely on a large number of manual annotations including both aesthetic labels and related image attributes. In this paper, we revisit the problem of image aesthetic assessment from the self-supervised feature learning perspective. Our motivation is that a suitable feature representation for image aesthetic assessment should be able to distinguish different expert-designed image manipulations, which have close relationships with negative aesthetic effects. To this end, we design two novel pretext tasks to identify the types and parameters of editing operations applied to synthetic instances. The features from our pretext tasks are then adapted for a one-layer linear classifier to evaluate the performance in terms of binary aesthetic classification. We conduct extensive quantitative experiments on three benchmark datasets and demonstrate that our approach can faithfully extract aesthetics-aware features and outperform alternative pretext schemes. Moreover, we achieve comparable results to state-of-the-art supervised methods that use 10 million labels from ImageNet.
Time series forecasting on multivariate solar radiation data using deep learning (LSTM)

Energy management is an emerging problem nowadays and utilization of renewable energy sources is an efficient solution. Solar radiation is an important source for electricity generation. For effective utilization, it is important to know precisely the amount from different sources and at different horizons: minutes, hours, and days. Depending on the horizon, two main classes of methods can be used to forecast the solar radiation: statistical time series forecasting methods for short to midterm horizons and numerical weather prediction methods for medium- to long-term horizons. Although statistical time series forecasting methods are utilized in the literature, there are a limited number of studies that utilize deep artificial neural networks. In this study, we focus on statistical time series forecasting methods for short-term horizons (1 h). The aim of this study is to discover the effect of using multivariate data on solar radiation forecasting using a deep learning approach. In this context, we propose a multivariate forecast model that uses a combination of different meteorological variables, such as temperature, humidity, and nebulosity. In the proposed model, recurrent neural network (RNN) variation, namely a long short-term memory (LSTM) unit is used. With an experimental approach, the effect of each meteorological variable is investigated. By hyperparameter tuning, optimal parameters are found in order to construct the best models that fit the global solar radiation data. We compared the results with those of previous studies and we found that the multivariate approach performed better than the previous univariate models did. In further experiments, the effect of combining the most effective parameters was investigated and, as a result, we observed that temperature and nebulosity are the most effective parameters for predicting future solar radiance.
Ensemble classifier based on optimized extreme learning machine for motor imagery classification

Objective. Designing an effective classifier with high classification accuracy and strong generalization capability is essential for brain-computer interface (BCI) research. In this study, an extreme learning machine (ELM) based method is proposed to improve the classification accuracy of motor imagery electroencephalogram (EEG). Approach. The proposed method constructs an ensemble classifier based on optimized ELMs. Particle swarm optimization is used to simultaneously optimize the input weights and hidden biases of ELM to avoid the randomness and instability of classification result when ELM uses randomly generated parameters, and majority voting strategy is used to fuse the classification results of multiple base classifiers to avoid the negative impact of ELM with local optimal parameters on classification result. The proposed method was compared with four competing methods in experiments based on two public EEG datasets and some existing methods reported in the literature using the same datasets as well. Main results. The results indicate that the proposed method achieved significant higher classification accuracies than those of the competing methods on both two-class and four-class motor imagery data. Moreover, compared to the existing methods, it still obtained superior average accuracies of two-class classification and performed better for the subjects with relatively poor accuracies on both two-class and four-class classifications. Significance. The significant accuracy improvement demonstrates the superiority of the proposed method. It can be a promising candidate for accurate classification of motor imagery EEG in BCI systems.
A Graph-based Model for Joint Chinese Word Segmentation and Dependency Parsing

Chinese word segmentation and dependency parsing are two fundamental tasks for Chinese natural language processing. The dependency parsing is defined at the word-level. Therefore word segmentation is the precondition of dependency parsing, which makes dependency parsing suffer from error propagation and unable to directly make use of character-level pre-trained language models (such as BERT). In this paper, we propose a graph-based model to integrate Chinese word segmentation and dependency parsing. Different from previous transition-based joint models, our proposed model is more concise, which results in fewer efforts of feature engineering. Our graph-based joint model achieves better performance than previous joint models and state-of-the-art results in both Chinese word segmentation and dependency parsing. Additionally, when BERT is combined, our model can substantially reduce the performance gap of dependency parsing between joint models and gold-segmented word-based models. Our code is publicly available at https://github.com/fastnlp/JointCwsParser
Improved Classical and Quantum Algorithms for Subset-Sum

We present new classical and quantum algorithms for solving random subset-sum instances. First, we improve over the Becker-Coron-Joux algorithm (EUROCRYPT 2011) from $$ \widetilde{\mathcal {O}} \left( 2^{0.291 n} \right) $$ down to $$ \widetilde{\mathcal {O}} \left( 2^{0.283 n} \right) $$ , using more general representations with values in $$\{-1,0,1,2\}$$ . Next, we improve the state of the art of quantum algorithms for this problem in several directions. By combining the Howgrave-Graham-Joux algorithm (EUROCRYPT 2010) and quantum search, we devise an algorithm with asymptotic running time $$ \widetilde{\mathcal {O}} \left( 2^{0.236 n} \right) $$ , lower than the cost of the quantum walk based on the same classical algorithm proposed by Bernstein, Jeffery, Lange and Meurer (PQCRYPTO 2013). This algorithm has the advantage of using classical memory with quantum random access, while the previously known algorithms used the quantum walk framework, and required quantum memory with quantum random access. We also propose new quantum walks for subset-sum, performing better than the previous best time complexity of $$ \widetilde{\mathcal {O}} \left( 2^{0.226 n} \right) $$ given by Helm and May (TQC 2018). We combine our new techniques to reach a time $$ \widetilde{\mathcal {O}} \left( 2^{0.216 n} \right) $$ . This time is dependent on a heuristic on quantum walk updates, formalized by Helm and May, that is also required by the previous algorithms. We show how to partially overcome this heuristic, and we obtain an algorithm with quantum time $$ \widetilde{\mathcal {O}} \left( 2^{0.218 n} \right) $$ requiring only the standard classical subset-sum heuristics.
The impact of spectroscopic incompleteness in direct calibration of redshift distributions for weak lensing surveys

Obtaining accurate distributions of galaxy redshifts is a critical aspect of weak lensing cosmology experiments. One of the methods used to estimate and validate redshift distributions is apply weights to a spectroscopic sample so that their weighted photometry distribution matches the target sample. In this work we estimate the \textit{selection bias} in redshift that is introduced in this procedure. We do so by simulating the process of assembling a spectroscopic sample (including observer-assigned confidence flags) and highlight the impacts of spectroscopic target selection and redshift failures. We use the first year (Y1) weak lensing analysis in DES as an example data set but the implications generalise to all similar weak lensing surveys. We find that using colour cuts that are not available to the weak lensing galaxies can introduce biases of $\Delta~z\sim0.015$ in the weighted mean redshift of different redshift intervals. To assess the impact of incompleteness in spectroscopic samples, we select only objects with high observer-defined confidence flags and compare the weighted mean redshift with the true mean. We find that the mean redshift of the DES Y1 weak lensing sample is typically biased at the $\Delta~z=0.005-0.05$ level after the weighting is applied. The bias we uncover can have either sign, depending on the samples and redshift interval considered. For the highest redshift bin, the bias is larger than the uncertainties in the other DES Y1 redshift calibration methods, justifying the decision of not using this method for the redshift estimations. We discuss several methods to mitigate this bias.
Privacy-Preserving Deep Learning NLP Models for Cancer Registries

Population cancer registries can benefit from Deep Learning (DL) to automatically extract cancer characteristics from the high volume of unstructured pathology text reports they process annually. The success of DL to tackle this and other real-world problems is proportional to the availability of large labeled datasets for model training. Although collaboration among cancer registries is essential to fully exploit the promise of DL, privacy and confidentiality concerns are main obstacles for data sharing across cancer registries. Moreover, DL for natural language processing (NLP) requires sharing a vocabulary dictionary for the embedding layer which may contain patient identifiers. Thus, even distributing the trained models across cancer registries causes a privacy violation issue. In this paper, we propose DL NLP model distribution via privacy-preserving transfer learning approaches without sharing sensitive data. These approaches are used to distribute a multitask convolutional neural network (MT-CNN) NLP model among cancer registries. The model is trained to extract six key cancer characteristics - tumor site, subsite, laterality, behavior, histology, and grade - from cancer pathology reports. Using 410,064 pathology documents from two cancer registries, we compare our proposed approach to conventional transfer learning without privacy-preserving, single-registry models, and a model trained on centrally hosted data. The results show that transfer learning approaches including data sharing and model distribution outperform significantly the single-registry model. In addition, the best performing privacy-preserving model distribution approach achieves statistically indistinguishable average micro- and macro-F1 scores across all extraction tasks (0.823,0.580) as compared to the centralized model (0.827,0.585).
UniTrans : Unifying Model Transfer and Data Transfer for Cross-Lingual Named Entity Recognition with Unlabeled Data

Prior work in cross-lingual named entity recognition (NER) with no/little labeled data falls into two primary categories: model transfer- and data transfer-based methods. In this paper, we find that both method types can complement each other, in the sense that, the former can exploit context information via language-independent features but sees no task-specific information in the target language; while the latter generally generates pseudo target-language training data via translation but its exploitation of context information is weakened by inaccurate translations. Moreover, prior work rarely leverages unlabeled data in the target language, which can be effortlessly collected and potentially contains valuable information for improved results. To handle both problems, we propose a novel approach termed UniTrans to Unify both model and data Transfer for cross-lingual NER, and furthermore, leverage the available information from unlabeled target-language data via enhanced knowledge distillation. We evaluate our proposed UniTrans over 4 target languages on benchmark datasets. Our experimental results show that it substantially outperforms the existing state-of-the-art methods.