Reviewerly/exHarmony huggingface dataset:
SAFEVM: a safety verifier for Ethereum smart contracts

Ethereum smart contracts are public, immutable and distributed and, as such, they are prone to vulnerabilities sourcing from programming mistakes of developers. This paper presents SAFEVM, a verification tool for Ethereum smart contracts that makes use of state-of-the-art verification engines for C programs. SAFEVM takes as input an Ethereum smart contract (provided either in Solidity source code, or in compiled EVM bytecode), optionally with assert and require verification annotations, and produces in the output a report with the verification results. Besides general safety annotations, SAFEVM handles the verification of array accesses: it automatically generates SV-COMP verification assertions such that C verification engines can prove safety of array accesses. Our experimental evaluation has been undertaken on all contracts pulled from etherscan.io (more than 24,000) by using as back-end verifiers CPAchecker, SeaHorn and VeryMax.
GAN-DP: Generative Adversarial Net Driven Differentially Privacy-Preserving Big Data Publishing

Increasing massive volume of data are generated every single second in this big data era. With big data from multiple sources, adversaries continuously mine private information for potential benefits. Motivated by this, we propose a generative adversarial net (GAN) driven noise generation method under the framework of differential privacy. We add one more perceptron, which is a specifically devised differential privacy identifier. After the generator produces the noise, the discriminator and the proposed identifier game with each other to derive the Nash Equilibrium. Extensive experimental results demonstrate the proposed model meets differential privacy constraints and upgrade data utility simultaneously.
Social recommendation model based on user interaction in complex social networks

The user interaction in online social networks can not only reveal the social relationships among users in e-commerce systems, but also imply the social preferences of a target user for recommendation services. However, the current research has rarely explored the impact of social interaction on recommendation performance, especially now that recommender systems face increasing challenges and suffer from poor efficiency due to social data overload. Therefore, applied research on user interaction has become increasingly necessary in the field of social recommendation. In this paper, we develop a novel social recommendation method based on the user interaction in complex social networks, called the SRUI model, to present a basis for improving the efficiency of the recommender systems. Specifically, a weighted social interaction network is first mapped to represent the interactions among social users according to the gathered information about historical user behavior. Thereafter, the complete path set is mined by the complete path mining (CPM) algorithm to find social similar neighbors with tastes similar to those of the target user. Finally, the social similar tendencies of the users on the complete paths are obtained to predict the final ratings of items through the SRUI model. A series of experimental results based on two real public datasets show that our approach performs better than other state-of-the-art methods in terms of recommendation performance.
GF-CapsNet: Using Gabor Jet and Capsule Networks for Facial Age, Gender, and Expression Recognition

The convolutional neural network (CNN) works very well in many computer vision tasks including the face-related problems. However, in the case of age estimation and facial expression recognition (FER), the accuracy provided by the CNN is still not good enough to be used for the real-world problems. It seems that the CNN does not well find the subtle differences in thickness and amount of wrinkles on the face, which are the essential features for the age estimation and FER. Also, the face images in the real world have many variations due to the face rotation and illumination, where the CNN is not robust in finding the rotated objects when not every possible variation is in the training data. To alleviate these problems, we first propose to use the Gabor filter responses of faces as the input to the CNN, along with the original face image. This method enhances the wrinkles on the face so that the face-related features are found in the earlier stage of convolutional layers, and hence the overall performance is increased. We also adopt the idea of capsule network, which is shown to be robust to the rotation of objects and be able to capture the relationship of facial landmarks. We show that the performance of age estimation and FER are improved by using the capsule network than using the plain CNNs. Moreover, by using the Gabor responses as the input to the capsule network, the overall performances of face-related problems are increased compared to the recent CNN-based methods.
Cross-Modality Retrieval by Joint Correlation Learning

As an indispensable process of cross-media analyzing, comprehending heterogeneous data faces challenges in the fields of visual question answering (VQA), visual captioning, and cross-modality retrieval. Bridging the semantic gap between the two modalities is still difficult. In this article, to address the problem in cross-modality retrieval, we propose a cross-modal learning model with joint correlative calculation learning. First, an auto-encoder is used to embed the visual features by minimizing the error of feature reconstruction and a multi-layer perceptron (MLP) is utilized to model the textual features embedding. Then we design a joint loss function to optimize both the intra- and the inter-correlations among the image-sentence pairs, i.e., the reconstruction loss of visual features, the relevant similarity loss of paired samples, and the triplet relation loss between positive and negative examples. In the proposed method, we optimize the joint loss based on a batch score matrix and utilize all mutual mismatched paired samples to enhance its performance. Our experiments in the retrieval tasks demonstrate the effectiveness of the proposed method. It achieves comparable performance to the state-of-the-art on three benchmarks, i.e., Flickr8k, Flickr30k, and MS-COCO.
Sequential Outlier Detection Based on Incremental Decision Trees

We introduce an online outlier detection algorithm to detect outliers in a sequentially observed data stream. For this purpose, we use a two-stage filtering and hedging approach. In the first stage, we construct a multimodal probability density function to model the normal samples. In the second stage, given a new observation, we label it as an anomaly if the value of aforementioned density function is below a specified threshold at the newly observed point. In order to construct our multimodal density function, we use an incremental decision tree to construct a set of subspaces of the observation space. We train a single component density function of the exponential family using the observations, which fall inside each subspace represented on the tree. These single component density functions are then adaptively combined to produce our multimodal density function, which is shown to achieve the performance of the best convex combination of the density functions defined on the subspaces. As we observe more samples, our tree grows and produces more subspaces. As a result, our modeling power increases in time, while mitigating overfitting issues. In order to choose our threshold level to label the observations, we use an adaptive thresholding scheme. We show that our adaptive threshold level achieves the performance of the optimal prefixed threshold level, which knows the observation labels in hindsight. Our algorithm provides significant performance improvements over the state of the art in our wide set of experiments involving both synthetic as well as real data.
Multi-Strategy Adaptive Cuckoo Search Algorithm

Cuckoo search algorithm (CS) is a powerful biological-inspired search algorithm, which is widely used in continuous space optimization problems.However, a single search strategy in CS makes all cuckoos have similar search behavior, and it is liable to plunges into local optimal.In addition, whether CS can successfully solve a problem largely depends on the value of control parameters.Using the trial and error method to determine the value of parameters will cost a lot of computational expense frequently.In order to solve these problems, a multi-strategy adaptive cuckoo algorithm (MSACS) is proposed in this paper.Firstly, five search strategies are adapted to cooperate with each other, and the use of various previous strategies and control parameters are studied.The probability of each strategy being used and the value of control parameters are changed adaptively.Then, the performance of MSACS is tested and evaluated on 24 common benchmark functions.Finally, several advanced CS algorithms, particle swarm algorithm (PSO) and differential evolution algorithm (DE) variants will be compared with MSACS.The results show that the MSACS is better than the algorithms above.
Root-Transformed Local Linear Regression for Solar Irradiance Probability Density Estimation

Solar energy is one of the most important and widely utilized renewable energy resource. Despite the many attractive features of solar-based renewables, the wide scale integration of solar generation into electric power systems presents significant challenges to network planners and operators, mainly due to the intermittent nature of solar energy. Most published work in this area is, however, focused on short-term forecasting studies used for unit commitment and energy market decisions with very little attention paid to solar irradiance probability density estimation needed for network planning and design studies. In this paper, a reliable nonparametric model of solar irradiance probability density is proposed based on the application of local linear regression in tandem with a root transformation method, introduced here for the first time. The performance of the proposed estimator is assessed via comparisons with the parametric Beta distribution (conventionally employed to model solar irradiance probability density) and two nonparametric kernel density estimation models; using the Kolmogorov-Smirnov (K-S) goodness-of-fit test, coefficient of determination (R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ), and a number of error metrics. Results confirm the suitability and accuracy of the proposed method for solar irradiance probability density estimation.
Robust and Efficient Graph Correspondence Transfer for Person Re-Identification

Spatial misalignment caused by variations in poses and viewpoints is one of the most critical issues that hinder the performance improvement in existing person re-identification (Re-ID) algorithms. Although it is straightforward to explore correspondence learning algorithms for alignment, online learning is intractable for negative pairs due to the intrinsic visual difference between negative pairs and efficiency concern. To address this problem, in this paper, we present a robust and efficient graph correspondence transfer (REGCT) approach for explicit spatial alignment in Re-ID. Specifically, we propose the off-line correspondence learning and on-line correspondence transfer framework. During training, patch-wise correspondences between positive training pairs are established via graph matching. By exploiting both spatial and visual contexts of human appearance in graph matching, meaningful semantic correspondences can be obtained. During testing, the off-line learned patch-wise correspondence templates are transferred to test pairs with similar pose-pair configurations for local feature distance calculation. To enhance the robustness of correspondence transfer, we design a novel pose context descriptor to accurately model human body configurations, and present an approach to measure the similarity between a pair of pose context descriptors. Meanwhile, to improve testing efficiency, we propose a correspondence template ensemble method using the voting mechanism, which significantly reduces the amount of patch-wise matchings involved in distance calculation. With the aforementioned strategies, the REGCT model can effectively and efficiently handle the spatial misalignment problem in Re-ID. Extensive experiments on five challenging benchmarks, including VIPeR, Road, PRID450S, 3DPES, and CUHK01, evidence the superior performance of REGCT over other state-of-the-art approaches.
M2A: A Framework for Visualizing Information from Mobile Web to Mobile Augmented Reality

Mobile Augmented Reality (MAR) drastically changes our approach to computing and user interaction. Web browsing, in particular, is impractical on AR devices as current web design principles do not account for three-dimensional display and navigation of virtual content. In this paper, we propose Mobile to AR (M2A), the first framework for designing web pages for AR devices. M2A exploits the visual context to display more content while enabling users to locate relevant data intuitively with minimal modifications to the website. To evaluate the principles behind the framework, we implement a demonstration application in AR and conduct two user-focused experiments. Our experimental study reveals that participants with M2A are 5 times faster to find information on a web page compared to a smartphone, and 2 times faster than a traditional AR web browser. Furthermore, users consider navigation on M2A websites to be significantly more intuitive and easy to use compared to their desktop and mobile counterparts.
GG Interaction: a gaze–grasp pose interaction for 3D virtual object selection

During the last two decades, development of 3D object selection techniques has been widely studied because it is critical for providing an interactive virtual environment to users. Previous techniques encounter difficulties with selecting small or distant objects, as well as naturalness and physical fatigue. Although eye-hand based interaction techniques have been promoted as the ideal solution to these problems, research on eye-hand based spatial interaction techniques in 3D virtual spaces has progressed very slowly. We propose a natural and efficient spatial interaction technique for object selection, which is motivated by understanding the human grasp. The proposed technique, gaze–grasp pose interaction (GG Interaction), has many advantages, such as quick and easy selection of small or distant objects, less physical fatigue, and elimination of eye-hand visibility mismatch. Additionally, even if an object is partially overlapped by other objects, GG Interaction enables a user to select the target object easily. We compare GG Interaction with a standard ray-casting technique through a formal user study (participants $$=$$ 20) across two scenarios. The results of the study confirm that GG Interaction provides natural, quick and easy selection for users.
Dynamic Temporal Pyramid Network: A Closer Look at Multi-scale Modeling for Activity Detection

Recognizing instances at varying scales simultaneously is a fundamental challenge in visual detection problems. While spatial multi-scale modeling has been well studied in object detection, how to effectively apply a multi-scale architecture to temporal models for activity detection is still under-explored. In this paper, we identify three unique challenges that need to be specifically handled for temporal activity detection. To address all these issues, we propose Dynamic Temporal Pyramid Network (DTPN), a new activity detection framework with a multi-scale pyramidal architecture featuring three novel designs: (1) We sample frame sequence dynamically with different frame per seconds (FPS) to construct a natural pyramidal representation for arbitrary-length input videos. (2) We design a two-branch multi-scale temporal feature hierarchy to deal with the inherent temporal scale variation of activity instances. (3) We further exploit the temporal context of activities by appropriately fusing multi-scale feature maps, and demonstrate that both local and global temporal contexts are important. By combining all these components into a uniform network, we end up with a single-shot activity detector involving single-pass inferencing and end-to-end training. Extensive experiments show that the proposed DTPN achieves state-of-the-art performance on the challenging ActvityNet dataset.
DeepBase

Although deep learning models perform remarkably well across a range of tasks such as language translation and object recognition, it remains unclear what high-level logic, if any, they follow. Understanding this logic may lead to more transparency, better model design, and faster experimentation. Recent machine learning research has leveraged statistical methods to identify hidden units that behave (e.g., activate) similarly to human understandable logic, but those analyses require considerable manual effort. Our insight is that many of those studies follow a common analysis pattern, and therefore there is opportunity to provide a declarative abstraction to easily express, execute and optimize them. This paper describes DeepBase, a system to inspect neural network behaviors through a unified interface. We model logic with user-provided hypothesis functions that annotate the data with high-level labels (e.g., part-of-speech tags, image captions). DeepBase lets users quickly identify individual or groups of units that have strong statistical dependencies with desired hypotheses. We discuss how DeepBase can express existing analyses, propose a set of simple and effective optimizations to speed up a standard Python implementation by up to 72x, and reproduce recent studies from the NLP literature.
Subset Models for Justification Logic

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new justification logic that is sound and complete with respect to our semantics. Moreover, we present another variant of our semantics that corresponds to traditional justification logic. These types of models offer us a versatile tool to work with justifications, e.g. by extending them with a probability measure to capture uncertain justifications. Following this strategy we will show that they subsume Artemov's approach to aggregating probabilistic evidence.
Time-semantic-aware Poisson tensor factorization approach for scalable hotel recommendation

With the rapid development of tourism, personalized hotel recommendation has drawn growing attention from researchers, as online hotel booking becomes a challenging task when users confronted with a large volume of hotel information. However, most of conventional rating-based hotel recommendation approaches do not explicitly take into account the temporal behavior and review texts of users, which are essential to recommend hotels that match users' preferences. In this paper, we propose a time-semantic-aware Poisson tensor factorization approach to learn comprehensively the temporal dynamics, multi-aspect ratings and review texts for hotel recommendation. This approach captures periodic effects of user activity with a time-aware factorization model. By exploiting the shared latent structure between users' multi-aspect ratings and review texts, the approach has been shown to be able to predict more precisely the user's preferences on hotels and easily be generalized to cold-start users for scalable hotel recommendation. To evaluate the performance of proposed method, experiments are conducted on two datasets collected from TripAdvisor. Experimental results of top-k hotel recommendation task reveal that the proposed model outperforms the state-of-the-art recommendation methods with a significant margin.
AcouDigits: Enabling Users to Input Digits in the Air

Recently, wearable devices have become increasingly popular in our lives because of their neat features and stylish appearance. However, due to the tiny size, it is inconvenient for users to interact with a device using conventional methods, especially for text entry. Although some methods have been proposed to handle this problem, they have different limitations and are not applicable to many existing mobile devices. As a result, we take the first step to propose a digits-entry system, i.e., AcouDigits, in which digits can be entered in the air using a finger without taking help from any additional hardware. We implement AcouDigits on two commercial devices and conduct experiments to evaluate its performance in recognizing ten basic digits. Experimental results show that AcouDigits can achieve average accuracies of 91.7% and 87.4% in recognizing basic digits and 26 English alphabets, respectively.
The undergraduate learner translator corpus: a new resource for translation studies and computational linguistics

Around the world, a growing interest has been seen in learner translator corpora, which are invaluable resources for teaching and research. This paper introduces a new resource to support researchers from different interdisciplinary areas such as computational linguistics, descriptive translation studies, computer-aided translation technology, Arabic machine translation applications, cognitive science, and translation pedagogy. Motivated by the lack of learner translator resources that provide data about learners of translation from and into Arabic, the undergraduate learner translator corpus (ULTC) is an ongoing, error-tagged sentence-aligned parallel corpus of English, Arabic, and French, with Arabic as its main language. The present corpus, consisting of parallel texts of female learners of translation from English or French into Arabic, is the first of its kind in terms of the languages represented, tasks covered, and number of students involved. It is also unique in terms of combining many complementary corpora of cross-lingual data, each of which has its own web-based query interface and corpus analysis tools. This paper describes the ULTC compilation process, preliminary findings, and planned future expansion and research.
On the Use of Information Retrieval to Automate the Detection of Third-Party Java Library Migration at the Method Level

The migration process between different third-party libraries is hard, complex and error-prone. Typically, during a library migration, developers need to find methods in the new library that are most adequate in replacing the old methods of the retired library. This process is subjective and time-consuming as developers need to fully understand the documentation of both libraries' Application Programming Interfaces, and find the right matching between their methods, if it exists. In this context, several studies rely on mining existing library migrations to provide developers with by-example approaches for similar scenarios. In this paper, we introduce a novel mining approach that extracts existing instances of library method replacements that are manually performed by developers for a given library migration to automatically generate migration patterns in the method level. Thereafter, our approach combines the mined method-change patterns with method-related lexical similarity to accurately detect mappings between replacing/replaced methods. We conduct a large scale empirical study to evaluate our approach on a benchmark of 57,447 open-source Java projects leading to 9 popular library migrations. Our qualitative results indicate that our approach significantly increases the accuracy of mining method-level mappings by an average accuracy of 12%, as well as increasing the number of discovered method mappings, in comparison with existing state-of-the-art studies. Finally, we provide the community with an open source mining tool along with a dataset of all mined migrations at the method level.