Reviewerly/exHarmony huggingface dataset:
Survey on Neural Network Architectures with Deep Learning

In the present research era, machine learning is an important and unavoidable zone where it provides better solutions to various domains. In particular deep learning is one of the cost efficient, effective supervised learning model, which can be applied to various complicated issues. Since deep learning has various illustrative features and it doesn’t depend on any limited learning methods which helps to obtain better solutions. As deep learning has significant performance and advancements it is widely used in various applications like image classification, face recognition, visual recognition, language processing, speech recognition, object detection and various science, business analysis, etc., This survey work mainly provides an insight about deep learning through an intensive analysis of deep learning architectures and its characteristics along with its limitations. Also, this research work analyses recent trends in deep learning through various literatures to explore the present evolution in deep learning models.
Does electronic customer relationship management (E-CRM) affect service quality at private hospitals in Jordan?

The study's goal is to see how electronic customer relationship management affects the quality of service at private hospitals in Jordan. The dimensions of customer relationship management (CRM) represented by website design, website search, privacy, security, and service delivery on time, while the dimensions of quality of service include reliability, responsiveness, assurance, and empathy. It focused on private hospitals in Jordan. Data were primarily gathered through self-reported questionnaires created by Google Forms distributed to a purposive sample of inpatients via email. The statistical program AMOSv24 was used to test the study hypotheses. The results demonstrated that electronic customer relationship management had a positive impact on service quality. Considering the results, the researchers recommend improving the degree of its practice of managing electronic customer relations by reconsidering its websites in terms of focusing on the website design and its ease of use by patients and the possibility of searching the website.
StyleGAN-NADA

Can a generative model be trained to produce images from a specific domain, guided only by a text prompt, without seeing any image? In other words: can an image generator be trained "blindly"? Leveraging the semantic power of large scale Contrastive-Language-Image-Pre-training (CLIP) models, we present a text-driven method that allows shifting a generative model to new domains, without having to collect even a single image. We show that through natural language prompts and a few minutes of training, our method can adapt a generator across a multitude of domains characterized by diverse styles and shapes. Notably, many of these modifications would be difficult or infeasible to reach with existing methods. We conduct an extensive set of experiments across a wide range of domains. These demonstrate the effectiveness of our approach, and show that our models preserve the latent-space structure that makes generative models appealing for downstream tasks. Code and videos available at: stylegan-nada.github.io/
Story Ending Generation with Incremental Encoding and Commonsense Knowledge

Generating a reasonable ending for a given story context, i.e., story ending generation, is a strong indication of story comprehension. This task requires not only to understand the context clues which play an important role in planning the plot, but also to handle implicit knowledge to make a reasonable, coherent story. In this paper, we devise a novel model for story ending generation. The model adopts an incremental encoding scheme to represent context clues which are spanning in the story context. In addition, commonsense knowledge is applied through multi-source attention to facilitate story comprehension, and thus to help generate coherent and reasonable endings. Through building context clues and using implicit knowledge, the model is able to produce reasonable story endings. Automatic and manual evaluation shows that our model can generate more reasonable story endings than state-of-the-art baselines1.
Reverse quantum annealing approach to portfolio optimization problems

We investigate a hybrid quantum-classical solution method to the mean-variance portfolio optimization problems. Starting from real financial data statistics and following the principles of the Modern Portfolio Theory, we generate parametrized samples of portfolio optimization problems that can be related to quadratic binary optimization forms programmable in the analog D-Wave Quantum Annealer 2000QTM. The instances are also solvable by an industry-established genetic algorithm approach, which we use as a classical benchmark. We investigate several options to run the quantum computation optimally, ultimately discovering that the best results in terms of expected time-to-solution as a function of number of variables for the hardest instances set are obtained by seeding the quantum annealer with a solution candidate found by a greedy local search and then performing a reverse annealing protocol. The optimized reverse annealing protocol is found to be more than 100 times faster than the corresponding forward quantum annealing on average.
Perceptions, Expectations, and Challenges in Defect Prediction

Defect prediction has been an active research area for over four decades. Despite numerous studies on defect prediction, the potential value of defect prediction in practice remains unclear. To address this issue, we performed a mixed qualitative and quantitative study to investigate what practitioners think, behave and expect in contrast to research findings when it comes to defect prediction. We collected hypotheses from open-ended interviews and a literature review of defect prediction papers that were published at ICSE, ESEC/FSE, ASE, TSE and TOSEM in the last 6 years (2012-2017). We then conducted a validation survey where the hypotheses became statements or options of our survey questions. We received 395 responses from practitioners from over 33 countries across five continents. Some of our key findings include: 1) Over 90 percent of respondents are willing to adopt defect prediction techniques. 2) There exists a disconnect between practitioners' perceptions and well supported research evidence regarding defect density distribution and the relationship between file size and defectiveness. 3) 7.2 percent of the respondents reveal an inconsistency between their behavior and perception regarding defect prediction. 4) Defect prediction at the feature level is the most preferred level of granularity by practitioners. 5) During bug fixing, more than 40 percent of the respondents acknowledged that they would make a “work-around” fix rather than correct the actual error-causing code. Through a qualitative analysis of free-form text responses, we identified reasons why practitioners are reluctant to adopt defect prediction tools. We also noted features that practitioners expect defect prediction tools to deliver. Based on our findings, we highlight future research directions and provide recommendations for practitioners.
Graph Convolutional Network Hashing

Recently, graph-based hashing that learns similarity-preserving binary codes via an affinity graph has been extensively studied for large-scale image retrieval. However, most graph-based hashing methods resort to intractable binary quadratic programs, making them unscalable to massive data. In this paper, we propose a novel graph convolutional network-based hashing framework, dubbed GCNH, which directly carries out spectral convolution operations on both an image set and an affinity graph built over the set, naturally yielding similarity-preserving binary embedding. GCNH fundamentally differs from conventional graph hashing methods which adopt an affinity graph as the only learning guidance in an objective function to pursue the binary embedding. As the core ingredient of GCNH, we introduce an intuitive asymmetric graph convolutional (AGC) layer to simultaneously convolve the anchor graph, input data, and convolutional filters. By virtue of the AGC layer, GCNH well addresses the issues of scalability and out-of-sample extension when leveraging affinity graphs for hashing. As a use case of our GCNH, we particularly study the semisupervised hashing scenario in this paper. Comprehensive image retrieval evaluations on the CIFAR-10, NUS-WIDE, and ImageNet datasets demonstrate the consistent advantages of GCNH over the state-of-the-art methods given limited labeled data.
An Efficient Adaptive Transfer Neural Network for Social-aware Recommendation

Many previous studies attempt to utilize information from other domains to achieve better performance of recommendation. Recently, social information has been shown effective in improving recommendation results with transfer learning frameworks, and the transfer part helps to learn users' preferences from both item domain and social domain. However, two vital issues have not been well-considered in existing methods: 1) Usually, a static transfer scheme is adopted to share a user's common preference between item and social domains, which is not robust in real life where the degrees of sharing and information richness are varied for different users. Hence a non-personalized transfer scheme may be insufficient and unsuccessful. 2) Most previous neural recommendation methods rely on negative sampling in training to increase computational efficiency, which makes them highly sensitive to sampling strategies and hence difficult to achieve optimal results in practical applications.
General methods for digital quantum simulation of gauge theories

A general scheme is presented for simulating gauge theories, with matter fields, on a digital quantum computer. A Trotterized time-evolution operator that respects gauge symmetry is constructed, and a procedure for obtaining time-separated, gauge-invariant operators is detailed. We demonstrate the procedure on small lattices, including the simulation of a 2+1D non-Abelian gauge theory.
Long short-term memory recurrent neural network for modeling temporal patterns in long-term power forecasting for solar PV facilities: Case study of South Korea

The sites selected for solar PV facilities significantly affect the amount of electric power that can be generated over the long term. Therefore, predicting the power output of a specific PV plant is important when evaluating potential PV sites. However, whether prediction models built with data from existing PV plants can be applied to other plants for long-term power forecasting remains poorly understood. In this case, topographical and meteorological conditions, which differ among sites and change over time, make it challenging to accurately estimate the potential for energy generation at a new site. This study proposes a monthly PV power forecasting model to predict the amount of PV solar power that could be generated at a new site. The forecasting model is trained with time series datasets collected over 63 months from 164 PV sites with data such as the power plant capacity and electricity trading data, weather conditions, and estimated solar irradiation. Specifically, a recurrent neural network (RNN) model with long short-term memory was built to recognize the temporal patterns in the time series data and tested to evaluate the forecasting performance for PV facilities not used in the training process. The results show that the proposed model achieves the normalized root-mean-square-error of 7.416% and the mean absolute-percentage-error (MAPE) of 10.805% for the testing data (i.e., new plants). Furthermore, when the previous 10 months’ data were used, the temporal patterns were well captured for forecasting, with a MAPE of 11.535%. Thus, the proposed RNN approach successfully captures the temporal patterns in monthly data and can estimate the potential for power generation at any new site for which weather information and terrain data are available. Consequently, this work will allow planning officials to search for and evaluate suitable locations for PV plants in a wide area.
PIQA: Reasoning about Physical Commonsense in Natural Language

To apply eyeshadow without a brush, should I use a cotton swab or a toothpick? Questions requiring this kind of physical commonsense pose a challenge to today's natural language understanding systems. While recent pretrained models (such as BERT) have made progress on question answering over more abstract domains – such as news articles and encyclopedia entries, where text is plentiful – in more physical domains, text is inherently limited due to reporting bias. Can AI systems learn to reliably answer physical commonsense questions without experiencing the physical world?In this paper, we introduce the task of physical commonsense reasoning and a corresponding benchmark dataset Physical Interaction: Question Answering or PIQA. Though humans find the dataset easy (95% accuracy), large pretrained models struggle (∼75%). We provide analysis about the dimensions of knowledge that existing models lack, which offers significant opportunities for future research.
End-to-End Neural Speaker Diarization with Self-Attention

Speaker diarization has been mainly developed based on the clustering of speaker embeddings. However, the clustering-based approach has two major problems; i.e., (i) it is not optimized to minimize diarization errors directly, and (ii) it cannot handle speaker overlaps correctly. To solve these problems, the End-to-End Neural Diarization (EEND), in which a bidirectional long short-term memory (BLSTM) network directly outputs speaker diarization results given a multi-talker recording, was recently proposed. In this study, we enhance EEND by introducing self-attention blocks instead of BLSTM blocks. In contrast to BLSTM, which is conditioned only on its previous and next hidden states, self-attention is directly conditioned on all the other frames, making it much suitable for dealing with the speaker diarization problem. We evaluated our proposed method on simulated mixtures, real telephone calls, and real dialogue recordings. The experimental results revealed that the self-attention was the key to achieving good performance and that our proposed method performed significantly better than the conventional BLSTM-based method. Our method was even better than that of the state-of-the-art x-vector clustering-based method. Finally, by visualizing the latent representation, we show that the self-attention can capture global speaker characteristics in addition to local speech activity dynamics. Our source code is available online at https://github.com/hitachi-speech/EEND.
Evaluating the Impact of GINI Index and Information Gain on Classification using Decision Tree Classifier Algorithm*

Decision tree is a supervised machine learning algorithm suitable for solving classification and regression problems.Decision trees are recursively built by applying split conditions at each node that divides the training records into subsets with output variable of same class.The process starts from the root node of the decision tree and progresses by applying split conditions at each non-leaf node resulting into homogenous subsets.However, achieving pure homogenous subsets is not possible.Therefore, the goal at each node is to identify an attribute and a split condition on that attribute that minimizes the mixing of class labels, thus resulting into nearly pure subsets.Several splitting indices were proposed to evaluate the goodness of the split, common ones being GINI index and Information gain.The aim of this study is to conduct an empirical comparison of GINI index and information gain.Classification models are built using decision tree classifier algorithm by applying GINI index and Information gain individually.The classification accuracy of the models is estimated using different metrics such as Confusion matrix, Overall accuracy, Per-class accuracy, Recall and Precision.The results of the study show that, regardless of whether the dataset is balanced or imbalanced, the classification models built by applying the two different splitting indices GINI index and information gain give same accuracy.In other words, choice of splitting indices has no impact on performance of the decision tree classifier algorithm.
Machine learning model for Bitcoin exchange rate prediction using economic and technology determinants

In recent years, Bitcoin exchange rate prediction has attracted the interest of researchers and investors. Some studies have used traditional statistical and econometric methods to understand the economic and technology determinants of Bitcoin, few have considered the development of predictive models using these determinants. In this study, we developed a two-stage approach for exploring whether the information hidden in economic and technology determinants can accurately predict the Bitcoin exchange rate. In the first stage, two nonlinear feature selection methods comprising an artificial neural network and random forest are used to reduce the subset of potential predictors by measuring the importance of economic and technology factors. In the second stage, the potential predictors are integrated into long short-term memory (LSTM) to predict the Bitcoin exchange rate regardless of the previous exchange rate. Our results showed that by using the economic and technology determinants, LSTM could achieve better predictive performance than the autoregressive integrated moving average, support vector regression, adaptive network fuzzy inference system, and LSTM methods, which all use the previous exchange rate. Thus, information obtained from economic and technology determinants is more important for predicting the Bitcoin exchange rate than the previous exchange rate.
Motivations for Social Distancing and App Use as Complementary Measures to Combat the COVID-19 Pandemic: Quantitative Survey Study

Background The current COVID-19 pandemic is showing negative effects on human health as well as on social and economic life. It is a critical and challenging task to revive public life while minimizing the risk of infection. Reducing interactions between people by social distancing is an effective and prevalent measure to reduce the risk of infection and spread of the virus within a community. Current developments in several countries show that this measure can be technologically accompanied by mobile apps; meanwhile, privacy concerns are being intensively discussed. Objective The aim of this study was to examine central cognitive variables that may constitute people’s motivations for social distancing, using an app, and providing health-related data requested by two apps that differ in their direct utility for the individual user. The results may increase our understanding of people’s concerns and convictions, which can then be specifically addressed by public-oriented communication strategies and appropriate political decisions. Methods This study refers to the protection motivation theory, which is adaptable to both health-related and technology-related motivations. The concept of social trust was added. The quantitative survey included answers from 406 German-speaking participants who provided assessments of data security issues, trust components, and the processes of threat and coping appraisal related to the prevention of SARS-CoV-2 infection by social distancing. With respect to apps, one central focus was on the difference between a contact tracing app and a data donation app. Results Multiple regression analyses showed that the present model could explain 55% of the interindividual variance in the participants’ motivation for social distancing, 46% for using a contact tracing app, 42% for providing their own infection status to a contact tracing app, and 34% for using a data donation app. Several cognitive components of threat and coping appraisal were related to motivation measurements. Trust in other people’s social distancing behavior and general trust in official app providers also played important roles; however, the participants’ age and gender did not. Motivations for using and accepting a contact tracing app were higher than those for using and accepting a data donation app. Conclusions This study revealed some important cognitive factors that constitute people’s motivation for social distancing and using apps to combat the COVID-19 pandemic. Concrete implications for future research, public-oriented communication strategies, and appropriate political decisions were identified and are discussed.
Direct Acyclic Graph-Based Ledger for Internet of Things: Performance and Security Analysis

Direct Acyclic Graph (DAG)-based ledger and the corresponding consensus algorithm has been identified as a promising technology for Internet of Things (IoT). Compared with Proof-of-Work (PoW) and Proof-of-Stake (PoS) that have been widely used in blockchain, the consensus mechanism designed on DAG structure (simply called as DAG consensus) can overcome some shortcomings such as high resource consumption, high transaction fee, low transaction throughput and long confirmation delay. However, the theoretic analysis on the DAG consensus is an untapped venue to be explored. To this end, based on one of the most typical DAG consensuses, Tangle, we investigate the impact of network load on the performance and security of the DAG-based ledger. Considering unsteady network load, we first propose a Markov chain model to capture the behavior of DAG consensus process under dynamic load conditions. The key performance metrics, i.e., cumulative weight and confirmation delay are analysed based on the proposed model. Then, we leverage a stochastic model to analyse the probability of a successful double-spending attack in different network load regimes. The results can provide an insightful understanding of DAG consensus process, e.g., how the network load affects the confirmation delay and the probability of a successful attack. Meanwhile, we also demonstrate the trade-off between security level and confirmation delay, which can act as a guidance for practical deployment of DAG-based ledgers.
UIEC^2-Net: CNN-based underwater image enhancement using two color space

Underwater image enhancement has attracted much attention due to the rise of marine resource development in recent years. Benefit from the powerful representation capabilities of Convolution Neural Networks(CNNs), multiple underwater image enhancement algorithms based on CNNs have been proposed in the past few years. However, almost all of these algorithms employ RGB color space setting, which is insensitive to image properties such as luminance and saturation. To address this problem, we proposed Underwater Image Enhancement Convolution Neural Network using 2 Color Space (UICE^2-Net) that efficiently and effectively integrate both RGB Color Space and HSV Color Space in one single CNN. To our best knowledge, this method is the first one to use HSV color space for underwater image enhancement based on deep learning. UIEC^2-Net is an end-to-end trainable network, consisting of three blocks as follow: a RGB pixel-level block implements fundamental operations such as denoising and removing color cast, a HSV global-adjust block for globally adjusting underwater image luminance, color and saturation by adopting a novel neural curve layer, and an attention map block for combining the advantages of RGB and HSV block output images by distributing weight to each pixel. Experimental results on synthetic and real-world underwater images show that the proposed method has good performance in both subjective comparisons and objective metrics. The code is available at https://github.com/BIGWangYuDong/UWEnhancement.