Reviewerly/exHarmony huggingface dataset:
Joint Coding of Local and Global Deep Features in Videos for Visual Search

Practically, it is more feasible to collect compact visual features rather than the video streams from hundreds of thousands of cameras into the cloud for big data analysis and retrieval. Then the problem becomes which kinds of features should be extracted, compressed and transmitted so as to meet the requirements of various visual tasks. Recently, many studies have indicated that the activations from the convolutional layers in convolutional neural networks (CNNs) can be treated as local deep features describing particular details inside an image region, which are then aggregated (e.g., using Fisher Vectors) as a powerful global descriptor. Combination of local and global features can satisfy those various needs effectively. It has also been validated that, if only local deep features are coded and transmitted to the cloud while the global features are recovered using the decoded local features, the aggregated global features should be lossy and consequently would degrade the overall performance. Therefore, this paper proposes a joint coding framework for local and global deep features (DFJC) extracted from videos. In this framework, we introduce a coding scheme for real-valued local and global deep features with intra-frame lossy coding and inter-frame reference coding. The theoretical analysis is performed to understand how the number of inliers varies with the number of local features. Moreover, the inter-feature correlations are exploited in our framework. That is, local feature coding can be accelerated by making use of the frame types determined with global features, while the lossy global features aggregated with the decoded local features can be used as a reference for global feature coding. Extensive experimental results under three metrics show that our DFJC framework can significantly reduce the bitrate of local and global deep features from videos while maintaining the retrieval performance.
Mining an "anti-knowledge base" from Wikipedia updates with applications to fact checking and beyond

We introduce the problem of anti-knowledge mining. Our goal is to create an "anti-knowledge base" that contains factual mistakes. The resulting data can be used for analysis, training, and benchmarking in the research domain of automated fact checking. Prior data sets feature manually generated fact checks of famous misclaims. Instead, we focus on the long tail of factual mistakes made by Web authors, ranging from erroneous sports results to incorrect capitals. We mine mistakes automatically, by an unsupervised approach, from Wikipedia updates that correct factual mistakes. Identifying such updates (only a small fraction of the total number of updates) is one of the primary challenges. We mine anti-knowledge by a multi-step pipeline. First, we filter out candidate updates via several simple heuristics. Next, we correlate Wikipedia updates with other statements made on the Web. Using claim occurrence frequencies as input to a probabilistic model, we infer the likelihood of corrections via an iterative expectation-maximization approach. Finally, we extract mistakes in the form of subject-predicate-object triples and rank them according to several criteria. Our end result is a data set containing over 110,000 ranked mistakes with a precision of 85% in the top 1% and a precision of over 60% in the top 25%. We demonstrate that baselines achieve significantly lower precision. Also, we exploit our data to verify several hypothesis on why users make mistakes. We finally show that the AKB can be used to find mistakes on the entire Web.
3-D Facial Landmarks Detection for Intelligent Video Systems

Facial landmark detection is a fundamental research topic in computer vision that is widely adopted in many applications. Recently, thanks to the development of convolutional neural networks, this topic has been largely improved. This article proposes facial-landmark detector, which is based on a state-of-the-art architecture for landmark localization called stacked hourglass network, to obtain accurate facial landmark-points. More specifically, this article uses residual networks as the backbone instead of a 7 × 7 convolution layer. Additionally, it modifies the hourglass modules by using the residual-dense blocks in the mainstream for capturing more efficient features and the 1 × 1 convolution layers in the branch streams for reducing the model size and computational time, instead of the original residual blocks. The proposed architecture also enhances the features from modified hourglass modules with finer-resolution features via a lateral connection to generate more accurate results. The proposed network can outperform other state-of-the-art methods on the AFLW2000-3D dataset and the LS3D-W dataset, the largest three-dimensional (3-D face) alignment dataset to date.
Exploring the Role of Deep Learning Technology in the Sustainable Development of the Music Production Industry

This study explores the role of deep learning technology in the sustainable development of the music production industry. This article surveys the opinions of Taiwanese music creation professionals and uses partial least squares (PLS) regression to analyze and elucidate the importance of deep learning technology in the music production industry. We found that deep learning cannot replace human creativity, but greater investment in this technology can improve the quality of music creation. In order to achieve sustainable development in the music production industry, industry participants need to awaken consumers’ awareness of music quality, actively enhance the unique value of their art, and strengthen cooperation between industries to provide a friendly environment for listeners.
Motion planning for an unmanned surface vehicle based on topological position maps

This paper investigates the motion-planning problem for an unmanned surface vehicle (USV), in which the goal is to find the shortest search time, the shortest path in navigational waters, all subject to collision avoidance and USV dynamics constraints. A new motion-planning method is proposed, based on topological position relationships (TPR), to achieve this solution. Firstly, the TPR of the obstacles and the USV are constructed, based on the spatial distribution of the obstacles. This gives an overall topological navigation map, which is different from the usual grid-based map. Secondly, a numerical model of unit decomposition is built to constrain the dynamics of the USV, so that the motion of the USV better fits the exact situation. Motion planning in this study is achieved by combining the topological navigation map and a numerical model of the USV. Finally, Numerical simulations and field tests verify the effectiveness of our formulated model and proposed algorithm.
DSP-Efficient Hardware Acceleration of Convolutional Neural Network Inference on FPGAs

Field-programmable gate array (FPGA)-based accelerators for convolutional neural network (CNN) inference have received significant attention in recent years. The reported designs tend to adopt a similar underlying approach based on multiplier-accumulator (MAC) arrays, which yields strong demand for the available on-chip DSP blocks, while leaving FPGA logic and memory resources underutilized. The practical outcome is that the computational roof of the accelerator is bound by the number of DSP blocks offered by the target FPGA. In addition, integrating the CNN accelerator with other functional units that may also need DSP blocks would degrade the inference performance. Leveraging the robustness of inference accuracy to limited arithmetic precision, we propose a transformation to the convolution computation, which leads to transformation of the accelerator design space and relaxes the pressure on the required DSP resources. Through analytical and empirical evaluations, we demonstrate that our approach enables us to strike a favorable balance between utilization of the FPGA on-chip memory, logic, and DSP resources, due to which, our accelerator considerably outperforms state of the art. We report the effectiveness of our approach on a variety of FPGA devices, including Cyclone-V, Stratix-V, and Arria-10, which are used in large number of applications, ranging from embedded settings to high performance computing. Our proposed technique yields 1.5x throughput improvement and 4x DSP resource reduction compared to the best frequency domain convolution-based accelerator, and 2.5x boost in raw arithmetic performance and 8.4x saving in DSPs compared to a state-of-the-art sparse convolution-based accelerator.
Efficient algorithms for mining clickstream patterns using pseudo-IDLists

Sequential pattern mining is an important task in data mining. Its subproblem, clickstream pattern mining, is starting to attract more research due to the growth of the Internet and the need to analyze online customer behaviors. To date, only few works are dedicately proposed for the problem of mining clickstream patterns. Although one approach is to use the general algorithms for sequential pattern mining, those algorithms' performance may suffer and the resources needed are more than would be necessary with a dedicated method for mining clickstreams. In this paper, we present pseudo-IDList, a novel data structure that is more suitable for clickstream pattern mining. Based on this structure, a vertical format algorithm named CUP (Clickstream pattern mining Using Pseudo-IDList) is proposed. Furthermore, we propose a pruning heuristic named DUB (Dynamic intersection Upper Bound) to improve our proposed algorithm. Four real-life clickstream databases are used for the experiments and the results show that our proposed methods are effective and efficient regarding runtimes and memory consumption.
A CONSTRUCTIVIST MODEL OF BANK BRANCH FRONT-OFFICE EMPLOYEE EVALUATION: AN FCM-SD-BASED APPROACH

The banking sector is one of the primary drivers of economic development. This sector has been affected by various crises throughout its history – most recently, the 2008 financial and economic crisis. In response, banking institutions have had to make diverse changes to their procedures and deal with new concerns related to changes within markets. One of the main recent developments in this sector is the new commercial function assigned to bank branch front-office employees, who have become responsible for selling financial products and services, as well as recruiting and retaining clients. As a result, the sector needs new employee performance evaluation methods in line with banks and staff members’ requirements. This study combined fuzzy cognitive mapping techniques and the system dynamics (SD) approach to develop a well-informed performance analysis system for assessing bank branch front-office employees. The proposed system was validated by the Business Process Management Competence Center director at Millennium BCP – a Portuguese private banking corporation. The main difference between the model constructed in the present research and current evaluation practices is that the criteria were collected directly from multiple specialists working at different commercial banks, who deal daily with this decision problem. The model’s theoretical and practical implications are also discussed.
Non linear system identification using kernel based exponentially extended random vector functional link network

Identification of nonlinear systems finds extensive applications in control design and stability analysis. To identify complex nonlinear systems, the neural network has drawn the attention of many researchers due to its broad application area. In this paper, an improved identification method based on Kernel Exponentially Extended Random Vector Functional Link Network (KERVFLN) has been proposed for nonlinear system identification. Good generalization capability, fast learning speed, simple architecture and the direct connection between input and output nodes along with non linear enhancement nodes with random weights of traditional Random Vector Functional Link Network (RVFLN) are very essential to industrial applications. To avoid the selection of the number of hidden nodes and hidden mapping function, kernel function has been used in this paper to increase the stability. The input is extended using trigonometric expansion which increases the accuracy of the algorithm when ever there is a sudden random change. In case of KERVFLN the number of enhancement nodes and its corresponding activation function need not to be known if its corresponding kernel function is given. To verify the accuracy of the proposed model, some benchmark Monte Carlo simulations and one SISO system are carried out through simulation study and the obtained results are compared with some established techniques such as original RVFLN, Extreme Learning Machine (ELM), and Least Mean Square (LMS). The efficiency of the proposed technique has been tested with the real time data set as well. The prediction accuracy of the proposed method KERVFLN is higher than the normal RVFLN for different nonlinear systems which is clear from the performance evaluation section.
Real-time Smartphone Activity Classification Using Inertial Sensors—Recognition of Scrolling, Typing, and Watching Videos While Sitting or Walking

By developing awareness of smartphone activities that the user is performing on their smartphone, such as scrolling feeds, typing and watching videos, we can develop application features that are beneficial to the users, such as personalization. It is currently not possible to access real-time smartphone activities directly, due to standard smartphone privileges and if internal movement sensors can detect them, there may be implications for access policies. Our research seeks to understand whether the sensor data from existing smartphone inertial measurement unit (IMU) sensors (triaxial accelerometers, gyroscopes and magnetometers) can be used to classify typical human smartphone activities. We designed and conducted a study with human participants which uses an Android app to collect motion data during scrolling, typing and watching videos, while walking or seated and the baseline of smartphone non-use, while sitting and walking. We then trained a machine learning (ML) model to perform real-time activity recognition of those eight states. We investigated various algorithms and parameters for the best accuracy. Our optimal solution achieved an accuracy of 78.6% with the Extremely Randomized Trees algorithm, data sampled at 50 Hz and 5-s windows. We conclude by discussing the viability of using IMU sensors to recognize common smartphone activities.
Analysis of determining centroid clustering x-means algorithm with davies-bouldin index evaluation

Abstract Clustering is a process to group data into several clusters or groups so the data in one cluster has a maximum level of similarity and data between clusters has a minimum similarity. X-means clustering is used to solving one of the main weaknesses of K-means clustering need for prior knowledge about the number of clusters (K). In this method, the actual value of K is estimated in a way that is not monitored and only based on the data set itself. The results of the study using the X-Means algorithm with the Davies-Bouldin Index evaluation to determine the number of Centroid clusters is done by modifying the X-Means method to do some centroid determination to get 11 iterations. The result is produces cluster members that have a good level of similarity with other data. In determining the number of centroids, use the Davies-Bouldin Index method where testing with 2 clusters has a minimum value with a DBI value close to 0.
Multi‐level feature optimization and multimodal contextual fusion for sentiment analysis and emotion classification

Abstract The availability of the humongous amount of multimodal content on the internet, the multimodal sentiment classification, and emotion detection has become the most researched topic. The feature selection, context extraction, and multi‐modal fusion are the most important challenges in multimodal sentiment classification and affective computing. To address these challenges this paper presents multilevel feature optimization and multimodal contextual fusion technique. The evolutionary computing based feature selection models extract a subset of features from multiple modalities. The contextual information between the neighboring utterances is extracted using bidirectional long‐short‐term‐memory at multiple levels. Initially, bimodal fusion is performed by fusing a combination of two unimodal modalities at a time and finally, trimodal fusion is performed by fusing all three modalities. The result of the proposed method is demonstrated using two publically available datasets such as CMU‐MOSI for sentiment classification and IEMOCAP for affective computing. Incorporating a subset of features and contextual information, the proposed model obtains better classification accuracy than the two standard baselines by over 3% and 6% in sentiment and emotion classification, respectively.
Panel Econometric Analysis on Mobile Payment Transactions and Traditional Banks Effort toward Financial Accessibility in Sub-Sahara Africa

The financial landscape of sub-Sahara Africa is undergoing major changes due to the advent of FinTech, which has seen mobile payments boom in the region. This paper examines the salient role of mobile payments in traditional banks’ drive toward financial accessibility in sub-Sahara Africa by using panel econometric approaches that consider the issues of independencies among cross-sectional residuals. Using data from the World Development Index (WDI) 2011–2017 on 11 countries in the region, empirical results from cross-sectional dependence (CD) tests, panel unit root test, panel cointegration test, and the fully modified ordinary least squares (FMOLS) approach indicates that (i) the panel time series data are cross-sectionally independent, (ii) the variables have the same order of integration and are cointegrated, and (iii) growth in mobile payment transactions had a significant positive relationship with formal account ownership, the number of ATMs, and number of new bank branches in the long-run. The paper therefore confirms that the institutional structure of traditional banks that makes them competitive, irrespective of emerging disruptive technologies, has stimulated overall financial accessibility in the region leading to overall sustainable growth in the financial sector. We conclude the paper with feasible policy suggestions.
Domain Stylization: A Fast Covariance Matching Framework Towards Domain Adaptation

Generating computer graphics (CG) rendered synthetic images has been widely used to create simulation environments for robotics/autonomous driving and generate labeled data. Yet, the problem of training models purely with synthetic data remains challenging due to the considerable domain gaps caused by current limitations on rendering. In this paper, we propose a simple yet effective domain adaptation framework towards closing such gap at image level. Unlike many GAN-based approaches, our method aims to match the covariance of the universal feature embeddings across domains, making the adaptation a fast, convenient step and avoiding the need for potentially difficult GAN training. To align domains more precisely, we further propose a conditional covariance matching framework which iteratively estimates semantic segmentation regions and conditionally matches the class-wise feature covariance given the segmentation regions. We demonstrate that both tasks can mutually refine and considerably improve each other, leading to state-of-the-art domain adaptation results. Extensive experiments under multiple synthetic-to-real settings show that our approach exceeds the performance of latest domain adaptation approaches. In addition, we offer a quantitative analysis where our framework shows considerable reduction in Frechet Inception distance between source and target domains, demonstrating the effectiveness of this work in bridging the synthetic-to-real domain gap.
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e315" altimg="si11.svg"><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>–<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e325" altimg="si12.svg"><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:math>state estimation for delayed artificial neural networks under high-…

In this paper, the l2-l∞ state estimation problem is addressed for a class of delayed artificial neural networks under high-rate communication channels with Round-Robin (RR) protocol. To estimate the state of the artificial neural networks, numerous sensors are deployed to measure the artificial neural networks. The sensors communicate with the remote state estimator through a shared high-rate communication channel. In the high-rate communication channel, the RR protocol is utilized to schedule the transmission sequence of the numerous sensors. The aim of this paper is to design an estimator such that, under the high-rate communication channel and the RR protocol, the exponential stability of the estimation error dynamics as well as the l2-l∞ performance constraint are ensured. First, sufficient conditions are given which guarantee the existence of the desired l2-l∞ state estimator. Then, the estimator gains are obtained by solving two sets of matrix inequalities. Finally, numerical examples are provided to verify the effectiveness of the developed l2-l∞ state estimation scheme.
Energy analysis of Internet of things data mining algorithm for smart green communication networks

With the continuous development of Internet technology and electronic information technology, big data technology and cloud computing technology also rise and develop, and have a positive impact on people’s lives. Data mining system can deeply mine the value information contained in big data, so as to assist users to solve practical problems and help users to make correct decisions and judgments. This paper presents an energy analysis of data mining algorithm based on cloud platform for Internet of things (IoT). First of all, an improved Apriori algorithm is proposed, which is based on Boolean matrix and sorting index rules. Then Boolean matrix is obtained after scanning the data set and the Boolean matrix is preprocessed to delete the useless transactions and the item set, which are combined with sorting index to produce other item sets, effectively improving the efficiency of frequent item mining, which effectively reduce the memory usage. Secondly, the density-based spatial clustering of applications with noise (DBSCAN) clustering algorithm needs human intervention in the global parameter selection, and the process of regional query is complex and the query is easy to lose objects. An improved parameter adaptive and regional query density clustering algorithm is proposed, which can effectively delete the redundant data in the high-level complex data space on the premise of retaining the internal nonlinear structure of the IoT data. The efficiency of clustering is also improved accordingly Finally, the simulation based on cloud platform verifies the effectiveness and superiority of the algorithm.