Reviewerly/exHarmony huggingface dataset:
FlakeFlagger: Predicting Flakiness Without Rerunning Tests

When developers make changes to their code, they typically run regression tests to detect if their recent changes (re) introduce any bugs. However, many tests are flaky, and their outcomes can change non-deterministically, failing without apparent cause. Flaky tests are a significant nuisance in the development process, since they make it more difficult for developers to trust the outcome of their tests, and hence, it is important to know which tests are flaky. The traditional approach to identify flaky tests is to rerun them multiple times: if a test is observed both passing and failing on the same code, it is definitely flaky. We conducted a very large empirical study looking for flaky tests by rerunning the test suites of 24 projects 10,000 times each, and found that even with this many reruns, some previously identified flaky tests were still not detected. We propose FlakeFlagger, a novel approach that collects a set of features describing the behavior of each test, and then predicts tests that are likely to be flaky based on similar behavioral features. We found that FlakeFlagger correctly labeled as flaky at least as many tests as a state-of-the-art flaky test classifier, but that FlakeFlagger reported far fewer false positives. This lower false positive rate translates directly to saved time for researchers and developers who use the classification result to guide more expensive flaky test detection processes. Evaluated on our dataset of 23 projects with flaky tests, FlakeFlagger outperformed the prior approach (by F1 score) on 16 projects and tied on 4 projects. Our results indicate that this approach can be effective for identifying likely flaky tests prior to running time-consuming flaky test detectors.
Calculating amphibole formula from electron microprobe analysis data using a machine learning method based on principal components regression

We present a new method for calculating amphibole formula from routine electron microprobe analysis (EMPA) data by applying a principal components regression (PCR)-based machine learning algorithm on reference amphibole data. The reference amphibole data collected from literature are grouped in two datasets, for Li-free and Li-bearing amphiboles respectively, which include Fe2+, Fe3+, OH contents and the ion site assignments determined by single crystal structure refinement. We established two PCR models, for Li-free and Li-bearing amphiboles respectively, by the 10-fold cross validation of training datasets and evaluated by independent test datasets. The results show that our models can successfully reproduce the reference data for most ions with an error less than ±0.01 atom per formula unit (apfu), for Fe3+ within an error less than ±0.2 apfu and for WOH and WO2− with errors less than ±0.3 apfu. The error in estimated Fe3+/ΣFe ratio shows a rough negative dependence on FeOT content (total iron expressed as FeO), ranging within ±0.3 for amphiboles with FeOT ≥ 5 wt% and within ±0.2 for amphiboles with FeOT ≥ 10 wt%. Our models are applicable to both W(OH, F, Cl)-dominant and WO-dominant amphiboles. It is notable that this method is not suitable for calculating mineral formula of amphiboles that have been affected by deprotonation as a result of secondary oxidation, but it could offer an estimation of initial WOH prior to the post-formation oxidation. A user-friendly Excel worksheet is provided with two independent PCR models for calculating the formula of Li-free amphibole and Li-bearing amphibole, respectively. An automatic nomenclature function is also provided according to the nomenclature criteria of the 2012 International Mineralogical Association (IMA) report.
Self-mitigating Trotter circuits for SU(2) lattice gauge theory on a quantum computer

Quantum computers offer the possibility to implement lattice gauge theory in Minkowski rather than Euclidean spacetime, thus allowing calculations of processes that evolve in real time. In this work, calculations within SU(2) pure gauge theory are able to show the motion of an excitation traveling across a spatial lattice in real time. This is accomplished by using a simple yet powerful method for error mitigation, where the original circuit is used both forward and backward in time. For a two-plaquette lattice, meaningful results are obtained from a circuit containing hundreds of CNOT gates. The same method is used for a five-plaquette lattice, where calculations show that residual systematic effects can be reduced through follow-up mitigation.
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning

Heuristic functions play an important role in drastically improving performance of satisficing planners based on greedy best-first search (GBFS). While automatic generation of heuristic functions (e.g., (Hoffmann and Nebel 2001; Helmert 2006)) enables state-of-the-art satisficing planners to solve very complicated planning problems including benchmarks in the International Planning Competitions, accurate evaluations of nodes still remain as a challenging task. Although GBFS is fundamental and powerful in planning, it has an essential drawback when heuristic functions return inaccurate estimates. Assume that a heuristic function underestimates the difficulties of unpromising nodes. Then, since GBFS must expand nodes with small heuristic values first, it spends most of time in searching only unpromising areas and delays moving to the promising part.Previous work tackles this issue by adding a diversity to search, which is an ability in simultaneously exploring different parts of the search space to bypass large errors in heuristic functions. Several algorithms combined with diversity (e.g., K-best-first search (KBFS) in (Felner, Kraus, and Korf 2003)) are empirically shown to be superior to naive best-first search algorithms. However, they still have limited diversity, since they do not immediately expand nodes mistakenly evaluated as very unpromising ones.This paper presents a new technique called diverse best-first search (DBFS), which incorporates a diversity into search in a different way than previous search-based approaches. We show empirical results clearly showing that DBFS is effective in satisficing planning.
Achieving Secure, Universal, and Fine-Grained Query Results Verification for Secure Search Scheme Over Encrypted Cloud Data

Secure search techniques over encrypted cloud data allow an authorized user to query data files of interest by submitting encrypted query keywords to the cloud server in a privacy-preserving manner. However, in practice, the returned query results may be incorrect or incomplete in the dishonest cloud environment. For example, the cloud server may intentionally omit some qualified results to save computational resources and communication overhead. Thus, a well-functioning secure query system should provide a query results verification mechanism that allows the data user to verify results. In this paper, we design a secure, easily integrated, and fine-grained query results verification mechanism, by which, given an encrypted query results set, the query user not only can verify the correctness of each data file in the set but also can further check how many or which qualified data files are not returned if the set is incomplete before decryption. The verification scheme is loose-coupling to concrete secure search techniques and can be very easily integrated into any secure query scheme. We achieve the goal by constructing secure verification object for encrypted cloud data. Furthermore, a short signature technique with extremely small storage cost is proposed to guarantee the authenticity of verification object and a verification object request technique is presented to allow the query user to securely obtain the desired verification object. Performance evaluation shows that the proposed schemes are practical and efficient.
A new homomorphic and method noise thresholding based despeckling of SAR image using anisotropic diffusion

In synthetic aperture radar (SAR) images, degradation due to multiplicative speckle noise and detail blurring is one of the common problem. This problem is solved by despeckling method. The main objective of image despeckling is to eliminate the speckle noise and preserve the important details of SAR images such as texture, edges, structures and corners. Usually SAR images are high dimensional images and preserving the edge and corner components is one major issue. Anisotropic diffusion also called Perona-Malik diffusion is used to reduce noise without disturbing the significant parts of the image. An homomorphic scheme is proposed using anisotropic diffusion in db2-type wavelet transform. Linear and non-linear filters are used on the approximate part of the image to remove blurring. Method noise thresholding is used to restore the unfiltered part of the despeckled image. The proposed method is applied and tested on correlated speckle noise as well as uncorrelated speckle noise on the real dataset of SAR images. The performance of the proposed method is evaluated by its visual quality and by using other metrics such as PSNR, SSIM, UIQI and RMSE. The performance and computational time are calculated and compared with standard filters and methods. The critical analysis of the result shows that proposed method gives the brilliant outcome in terms of structure, edge preservation and noise suppression. The proposed method has the ability to be used in practical applications.
TimeTrustSVD: A collaborative filtering model integrating time, trust and rating information

Collaborative filtering is widely used in recommender systems, which has better performance when trust relationship is taken into account as well as traditional rating information, as done in TrustSVD. However, the user preferences varies over time. Consequently, it is significant to take temporal information into consideration. This paper incorporates time influence both on users and items and proposed TimeTrustSVD, a collaborative filtering model integrating time information, trust relationships and rating scores. The proposed algorithm includes modified models of user bias and item bias based on a state-of-the-art algorithm TrustSVD, and achieved satisfactory results according to the experimental phenomena on a real-world dataset.
Toward Practical Privacy-Preserving Frequent Itemset Mining on Encrypted Cloud Data

Frequent itemset mining, which is the essential operation in association rule mining, is one of the most widely used data mining techniques on massive datasets nowadays. With the dramatic increase on the scale of datasets collected and stored with cloud services in recent years, it is promising to carry this computation-intensive mining process in the cloud. Amount of work also transferred the approximate mining computation into the exact computation, where such methods not only improve the accuracy also aim to enhance the efficiency. However, while mining data stored on public clouds, it inevitably introduces privacy concerns on sensitive datasets. In this paper, we propose a new framework for enforcing privacy in frequent itemset mining, where data are both collected and mined in an encrypted form in a public cloud service. We specifically design three secure frequent itemset mining protocols on top of this framework. Our first protocol achieves more efficient mining performance while our second protocol provides a stronger privacy guarantee. In order to further optimize the performance of the second protocol, we leverage a minor trade-off of privacy to get our third protocol. Finally, we evaluate the performance of our protocols with extensive experiments, and the results demonstrate that our protocols obviously outperform previous solutions in performance with the same security level.
Denoising Autoencoders for Overgeneralization in Neural Networks

Despite recent developments that allowed neural networks to achieve impressive performance on a variety of applications, these models are intrinsically affected by the problem of overgeneralization, due to their partitioning of the full input space into the fixed set of target classes used during training. Thus it is possible for novel inputs belonging to categories unknown during training or even completely unrecognizable to humans to fool the system into classifying them as one of the known classes, even with a high degree of confidence. This problem can lead to security problems in critical applications, and is closely linked to open set recognition and 1-class recognition. This paper presents a novel way to compute a confidence score using the reconstruction error of denoising autoencoders and shows how it can correctly identify the regions of the input space close to the training distribution. The proposed solution is tested on benchmarks of 'fooling', open set recognition and 1-class recognition constructed from the MNIST and Fashion-MNIST datasets.
Knowledge Graphs for Social Good: An Entity-Centric Search Engine for the Human Trafficking Domain

Web advertising related to Human Trafficking (HT) activity has been on the rise in recent years. Answering entity-centric questions over crawled HT Web corpora to assist investigators in the real world is an important social problem, involving many technical challenges. This paper describes a recent entity-centric knowledge graph effort that resulted in a semantic search engine to assist analysts and investigative experts in the HT domain. The overall approach takes as input a large corpus of advertisements crawled from the Web, structures it into an indexed knowledge graph, and enables investigators to satisfy their information needs by posing investigative search queries to a special-purpose semantic execution engine. We evaluated the search engine on real-world data collected from over 90,000 webpages, a significant fraction of which correlates with HT activity. Performance on four relevant categories of questions on a mean average precision metric were found to be promising, outperforming a learning-to-rank approach on three of the four categories. The prototype uses open-source components and scales to terabyte-scale corpora. Principles of the prototype have also been independently replicated, with similarly successful results.
Detection and Recognition for Life State of Cell Cancer Using Two-Stage Cascade CNNs

Cancer cell detection and its stages recognition of life cycle are an important step to analyze cellular dynamics in the automation of cell based-experiments. In this work, a two-stage hierarchical method is proposed to detect and recognize different life stages of bladder cells by using two cascade Convolutional Neural Networks (CNNs). Initially, a hybrid object proposal algorithm (called EdgeSelective) by combining EdgeBoxes and Selective Search is proposed to generate candidate object proposals instead of a single Selective Search method in Region-CNN (R-CNN), and it can exploit the advantages of different mechanisms for generating proposals so that each cell in the image can be fully contained by at least one proposed region during the detection process. Then, the obtained cells from the previous step are used to train and extract features by employing CNNs for the purpose of cell life stage recognition. Finally, a series of comparison experiments are implemented. The results show that the proposed method can obtain better performance than traditional methods either in the stage of cell detection or cell life stage recognition, and it encourages and suggests the application in the development of new anticancer drug and cytopathology analysis of cancer patients in the near future.
Alternating diffusion maps for multimodal data fusion

The problem of information fusion from multiple data-sets acquired by multimodal sensors has drawn significant research attention over the years. In this paper, we focus on a particular problem setting consisting of a physical phenomenon or a system of interest observed by multiple sensors. We assume that all sensors measure some aspects of the system of interest with additional sensor-specific and irrelevant components. Our goal is to recover the variables relevant to the observed system and to filter out the nuisance effects of the sensor-specific variables. We propose an approach based on manifold learning, which is particularly suitable for problems with multiple modalities, since it aims to capture the intrinsic structure of the data and relies on minimal prior model knowledge. Specifically, we propose a nonlinear filtering scheme, which extracts the hidden sources of variability captured by two or more sensors, that are independent of the sensor-specific components. In addition to presenting a theoretical analysis, we demonstrate our technique on real measured data for the purpose of sleep stage assessment based on multiple, multimodal sensor measurements. We show that without prior knowledge on the different modalities and on the measured system, our method gives rise to a data-driven representation that is well correlated with the underlying sleep process and is robust to noise and sensor-specific effects.
Where would you like to eat? A formative evaluation of mixed-reality solitary meals in virtual environments for older adults with mobility impairments who live alone

This paper reports the results from a formative evaluation of a mixed-reality (MR) eating prototype developed in collaboration with a restaurant for older adults in Holstebro, Denmark. The prototype is used to demonstrate to the older adults the idea of MR eating in two virtual environments. We use qualitative techniques to address the question: What virtual environment do mobility-restricted older Danish adults perceive as engaging and suitable for pleasurable, MR solitary meals? The participants repeatedly used the label "coziness" to describe their desired atmosphere for an eating environment. They critiqued the realism, color scheme and cleanliness of the presented virtual environments. Results from a card-sorting task where participants matched their preferred environments with specific meals, showed that their classifications were based on safety, realism, practicality, social acceptability, time, palatability, and indoor-outdoor considerations.
Kernel principal component analysis combining rotation forest method for linearly inseparable data

Rotation forest (RoF) is an ensemble classifier combining linear analysis theories and decision tree algorithms. In recent existing works, RoF was widely applied to various fields with outstanding performance compared to traditional machine learning techniques, given that a reasonable number of base classifiers is provided. However, the conventional RoF algorithm suffers from classifying linearly inseparable datasets. In this study, a hybrid algorithm integrating kernel principal component analysis (KPCA) and the conventional RoF algorithm is proposed to overcome the classification difficulty for linearly inseparable datasets. The radial basis function (RBF) is selected as the kernel for the KPCA method to establish the nonlinear mapping for linearly inseparable data. Moreover, we evaluate various kernel parameters for better performance. Experimental results show that our algorithm improves the performance of RoF with linearly inseparable datasets, and therefore provides higher classification accuracy rates compared with other ensemble machine learning methods.
Learning skeleton representations for human action recognition

Automatic interpretation of human actions gained strong interest among researchers in patter recognition and computer vision because of its wide range of applications, such as in social and home robotics, elderly people health care, surveillance, among others. In this paper, we propose a method for recognition of human actions by analysis of skeleton poses. The method that we propose is based on novel trainable feature extractors, which can learn the representation of prototype skeleton examples and can be employed to recognize skeleton poses of interest. We combine the proposed feature extractors with an approach for classification of pose sequences based on string kernels. We carried out experiments on three benchmark data sets (MIVIA-S, MSRSDA and MHAD) and the results that we achieved are comparable or higher than the ones obtained by other existing methods. A further important contribution of this work is the MIVIA-S dataset, that we collected and made publicly available.
A Secure Searchable Encryption Framework for Privacy-Critical Cloud Storage Services

Searchable encryption has received a significant attention from the research community with various constructions being proposed, each achieving asymptotically optimal complexity for specific metrics (e.g., search, update). Despite their elegance, the recent attacks and deployment efforts have shown that the optimal asymptotic complexity might not always imply practical performance, especially if the application demands a high privacy. In this article, we introduce a novel Dynamic Searchable Symmetric Encryption (DSSE) framework called Incidence Matrix (IM)-DSSE, which achieves a high level of privacy, efficient search/update, and low client storage with actual deployments on real cloud settings. We harness an incidence matrix along with two hash tables to create an encrypted index, on which both search and update operations can be performed effectively with minimal information leakage. This simple set of data structures surprisingly offers a high level of DSSE security while achieving practical performance. Specifically, IM-DSSE achieves forward-privacy, backward-privacy and size-obliviousness simultaneously. We also create several DSSE variants, each offering different trade-offs that are suitable for different cloud applications and infrastructures. We fully implemented our framework and evaluated its performance on a real cloud system (Amazon EC2). We have released IM-DSSE as an open-source library for wide development and adaptation.
Addressing Interpretability and Cold-Start in Matrix Factorization for Recommender Systems

We consider the problem of generating interpretable recommendations by identifying overlapping co-clusters of clients and products, based only on positive or implicit feedback. Our approach is applicable on very large datasets because it exhibits almost linear complexity in the input examples and the number of co-clusters. We show, both on real industrial data and on publicly available datasets, that the recommendation accuracy of our algorithm is competitive to that of state-of-the-art matrix factorization techniques. In addition, our technique has the advantage of offering recommendations that are textually and visually interpretable. Our formulation can also address cold-start problems by gracefully meshing collaborative and content-based reasoning. Finally, we present efficient Graphical Processing Unit (GPU) implementations and demonstrate a speedup of more than 270 times over our baseline CPU implementation on a cluster of 16 GPUs.