nils-herrmann/clean_scirepeval huggingface dataset:
Feature Extraction With Multiscale Covariance Maps for Hyperspectral Image Classification

The classification of hyperspectral images (HSIs) using convolutional neural networks (CNNs) has recently drawn significant attention. However, it is important to address the potential overfitting problems that CNN-based methods suffer when dealing with HSIs. Unlike common natural images, HSIs are essentially three-order tensors which contain two spatial dimensions and one spectral dimension. As a result, exploiting both spatial and spectral information is very important for HSI classification. This paper proposes a new hand-crafted feature extraction method, based on multiscale covariance maps (MCMs), that is specifically aimed at improving the classification of HSIs using CNNs. The proposed method has the following distinctive advantages. First, with the use of covariance maps, the spatial and spectral information of the HSI can be jointly exploited. Each entry in the covariance map stands for the covariance between two different spectral bands within a local spatial window, which can absorb and integrate the two kinds of information (spatial and spectral) in a natural way. Second, by means of our multiscale strategy, each sample can be enhanced with spatial information from different scales, increasing the information conveyed by training samples significantly. To verify the effectiveness of our proposed method, we conduct comprehensive experiments on three widely used hyperspectral data sets, using a classical 2-D CNN (2DCNN) model. Our experimental results demonstrate that the proposed method can indeed increase the robustness of the CNN model. Moreover, the proposed MCMs+2DCNN method exhibits better classification performance than other CNN-based classification strategies and several standard techniques for spectral-spatial classification of HSIs.
MATLAB functions to analyze directional (azimuthal) data - II: Correlation

Data that represent azimuthal directions cannot be analyzed in the same manner as ordinary linear variables that measure, for example, size or quality. This is especially true for correlations between variables. Although many statistical techniques have been developed for dealing with directional data, software is scarce for the unique calculations. This paper describes a MATLAB script, located on the IAMG server, that calculates measures of association (correlations) between two circular variables, or between a circular and a linear variable. The calculations include tests of significance of the associations. These tests use large-sample approximations or resampling methods.
A randomized controlled trial of mindfulness meditation versus relaxation training: effects on distress, positive states of mind, rumination, and distraction.

Although mindfulness meditation interventions have recently shown benefits for reducing stress in various populations, little is known about their relative efficacy compared with relaxation interventions.



This randomized controlled trial examines the effects of a 1-month mindfulness meditation versus somatic relaxation training as compared to a control group in 83 students (M age = 25; 16 men and 67 women) reporting distress.



Psychological distress, positive states of mind, distractive and ruminative thoughts and behaviors, and spiritual experience were measured, while controlling for social desirability.



Hierarchical linear modeling reveals that both meditation and relaxation groups experienced significant decreases in distress as well as increases in positive mood states over time, compared with the control group (p < .05 in all cases). There were no significant differences between meditation and relaxation on distress and positive mood states over time. Effect sizes for distress were large for both meditation and relaxation (Cohen's d = 1.36 and .91, respectively), whereas the meditation group showed a larger effect size for positive states of mind than relaxation (Cohen's d =.71 and .25, respectively). The meditation group also demonstrated significant pre-post decreases in both distractive and ruminative thoughts/behaviors compared with the control group (p < .04 in all cases; Cohen's d = .57 for rumination and .25 for distraction for the meditation group), with mediation models suggesting that mindfulness meditation's effects on reducing distress were partially mediated by reducing rumination. No significant effects were found for spiritual experience.



The data suggest that compared with a no-treatment control, brief training in mindfulness meditation or somatic relaxation reduces distress and improves positive mood states. However, mindfulness meditation may be specific in its ability to reduce distractive and ruminative thoughts and behaviors, and this ability may provide a unique mechanism by which mindfulness meditation reduces distress.
An Algorithm for Finding Best Matches in Logarithmic Expected Time

An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kN log N. The expected number of records examined in each search is independent of the file size. The expected computation to perform each search is proportional to log N. Empirical evidence suggests that, except for very small files, this algorithm is considerably faster than other methods.
Weighted cluster ensembles: Methods and analysis

Cluster ensembles offer a solution to challenges inherent to clustering arising from its ill-posed nature. Cluster ensembles can provide robust and stable solutions by leveraging the consensus across multiple clustering results, while averaging out emergent spurious structures that arise due to the various biases to which each participating algorithm is tuned. In this article, we address the problem of combining multiple weighted clusters that belong to different subspaces of the input space. We leverage the diversity of the input clusterings in order to generate a consensus partition that is superior to the participating ones. Since we are dealing with weighted clusters, our consensus functions make use of the weight vectors associated with the clusters. We demonstrate the effectiveness of our techniques by running experiments with several real datasets, including high-dimensional text data. Furthermore, we investigate in depth the issue of diversity and accuracy for our ensemble methods. Our analysis and experimental results show that the proposed techniques are capable of producing a partition that is as good as or better than the best individual clustering.
Automatic generation of oracles for exceptional behaviors

Test suites should test exceptional behavior to detect faults in error-handling code. However, manually-written test suites tend to neglect exceptional behavior. Automatically-generated test suites, on the other hand, lack test oracles that verify whether runtime exceptions are the expected behavior of the code under test. 
 This paper proposes a technique that automatically creates test oracles for exceptional behaviors from Javadoc comments. The technique uses a combination of natural language processing and run-time instrumentation. Our implementation, Toradocu, can be combined with a test input generation tool. Our experimental evaluation shows that Toradocu improves the fault-finding effectiveness of EvoSuite and Randoop test suites by 8% and 16% respectively, and reduces EvoSuite’s false positives by 33%.
AndroTaint: An efficient android malware detection framework using dynamic taint analysis

Android operating system is widespread in today's smart-phone market due to its open source model, its easy functionality and huge number of Apps and App-Stores (the official and others). The coverage of some 90% of the market, it is also the place-holder for user's personal as well as sensitive information (IMEI, IMSI, etc.). There is a tendency of Apps user to trust on Android OS for securing his/her data but it has been proved that Android OS is more vulnerable to exploitation either for fun or for monetary purpose. Malware detection for Android OS has become an upcoming research problem of interest. Dynamic Taint Analysis is an efficient analysis in existing Android malware detection analysis. The aim of this paper is to work towards Dynamic Taint Analysis of Android malware using automatic tagging and with out modification in Android platform. In order to do this, this paper surveys exhaustively the available literature and works related to dynamic taint analysis. This paper proposes some novel ideas to improve the existing solution with more accuracy. There are two phases of our novel algorithm, the first phase is training phase for feature extraction and the second phase is the analysis phase for automatic tagging and tainting. We have developed a framework named AndroTaint, which is working on Dynamic Taint Analysis. AndroTaint follows a novel supervised and unsupervised Anomaly Detection technique with high precision, recall and harmonic mean. Our Dynamic Taint Analysis algorithm categorizes the App is risky, benign, malicious or aggressive as per their feature and behaviour. We have measured AndroTaint effectiveness on the basis of timeline for building dataset and 10-fold cross validation. AndroTaint covers 90% of malware and benign in analysis phase with less false positive and false negative.
Latent Discriminant Analysis with Representative Feature Discovery

Linear Discriminant Analysis (LDA) is a well-known method for dimension reduction and classification with focus on discriminative feature selection. However, how to discover discriminative as well as representative features in LDA model has not been explored. In this paper, we propose a latent Fisher discriminant model with representative feature discovery in an semi-supervised manner. Specifically, our model leverages advantages of both discriminative and generative models by generalizing LDA with data-driven prior over the latent variables. Thus, our method combines multi-class, latent variables and dimension reduction in an unified Bayesian framework. We test our method on MUSK and Corel datasets and yield competitive results compared to baselines. We also demonstrate its capacity on the challenging TRECVID MED11 dataset for semantic keyframe extraction and conduct a human-factors ranking-based experimental evaluation, which clearly demonstrates our proposed method consistently extracts more semantically meaningful keyframes than chal-
Design guidelines for wireless sensor networks: communication, clustering and aggregation

When sensor nodes are organized in clusters, they could use either single hop or multi-hop mode of communication to send their data to their respective cluster heads. We present a systematic cost-based analysis of both the modes, and provide results that could serve as guidelines to decide which mode should be used for given settings. We determine closed form expressions for the required number of cluster heads and the required battery energy of nodes for both the modes. We also propose a hybrid communication mode which is a combination of single hop and multi-hop modes, and which is more cost-effective than either of the two modes. Our problem formulation also allows for the application to be taken into account in the overall design problem through a data aggregation model.
Photoplethysmography and its detailed pulse waveform analysis for arterial stiffness

Arterial stiffness index is one of the biomechanical indices of vascular healthiness. These indexes are based on detailed pulse waveform analysis which is presented here. After photoplethysmographyic (PPG) pulse wave measurement, we decompose the pulse waveform for the estimation and determination of arterial elasticity. Firstly, it is electro-optically measured PPG signal and by electromechanical film (EMFi) measured signal that are analyzed and investigated by dividing each wave into five logarithmic normal function components. For both the PPG and EMFi waveform we can find very easily a good fit between the original and overlapped and summed wave components. Each wave component is assumed to resemble certain phenomenon in the arteries and certain indexes can be calculated for example based on the mutual timing of the components. Several studies have demonstrated that these kinds of indexes calculated based on actual biomechanical processed can predict future cardiovascular events. Many dynamic factors, e.g., arterial stiffness, depend on fixed structural features of the arterial wall. For more accurate description, arterial stiffness is estimated based on pulse wave decomposition analysis in the radial measured by EMFi and PPG method and tibial arterial walls measured by PPG method parallelly. Elucidation of the precise relationship between endothelial function and arterial stiffness can be done through biomechanics. However, arterial wall elasticity awaits still further biomechanical studies with clinical relations and the influence of arterial flexibility, resistance and ageing inside of the radial pulse waveform.
Neither Quick Nor Proper - Evaluation of QuickProp for Learning Deep Neural Networks

Neural networks and especially convolutional neural networks are of great interest in current computer vision research. However, many techniques, extensions, and modifications have been published in the past, which are not yet used by current approaches. In this paper, we study the application of a method called QuickProp for training of deep neural networks. In particular, we apply QuickProp during learning and testing of fully convolutional networks for the task of semantic segmentation. We compare QuickProp empirically with gradient descent, which is the current standard method. Experiments suggest that QuickProp can not compete with standard gradient descent techniques for complex computer vision tasks like semantic segmentation.
Quantitative trait loci for glucosinolate accumulation in Brassica rapa leaves.

Glucosinolates and their breakdown products have been recognized for their effects on plant defense, human health, flavor and taste of cruciferous vegetables. Despite this importance, little is known about the regulation of the biosynthesis and degradation in Brassica rapa. Here, the identification of quantitative trait loci (QTL) for glucosinolate accumulation in B. rapa leaves in two novel segregating double haploid (DH) populations is reported: DH38, derived from a cross between yellow sarson R500 and pak choi variety HK Naibaicai; and DH30, from a cross between yellow sarson R500 and Kairyou Hakata, a Japanese vegetable turnip variety. An integrated map of 1068 cM with 10 linkage groups, assigned to the international agreed nomenclature, is developed based on the two individual DH maps with the common parent using amplified fragment length polymorphism (AFLP) and single sequence repeat (SSR) markers. Eight different glucosinolate compounds were detected in parents and F(1)s of the DH populations and found to segregate quantitatively in the DH populations. QTL analysis identified 16 loci controlling aliphatic glucosinolate accumulation, three loci controlling total indolic glucosinolate concentration and three loci regulating aromatic glucosinolate concentrations. Both comparative genomic analyses based on Arabidopsis-Brassica rapa synteny and mapping of candidate orthologous genes in B. rapa allowed the selection of genes involved in the glucosinolate biosynthesis pathway that may account for the identified QTL.
Classification with partial labels

In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are represented as a set of possible labels for each training example, one of which is the correct label. We introduce a discriminative learning approach that incorporates partial label information into the conventional margin-based learning framework. The partial label learning problem is formulated as a convex quadratic optimization minimizing the L2-norm regularized empirical risk using hinge loss. We also present an efficient algorithm for classification in the presence of partial labels. Experiments with different data sets show that partial label information improves the performance of classification when there is traditional fully-labeled data, and also yields reasonable performance in the absence of any fully labeled data.
An Early Resource Characterization of Deep Learning on Wearables, Smartphones and Internet-of-Things Devices

Detecting and reacting to user behavior and ambient context are core elements of many emerging mobile sensing and Internet-of-Things (IoT) applications. However, extracting accurate inferences from raw sensor data is challenging within the noisy and complex environments where these systems are deployed. Deep Learning -- is one of the most promising approaches for overcoming this challenge, and achieving more robust and reliable inference. Techniques developed within this rapidly evolving area of machine learning are now state-of-the-art for many inference tasks (such as, audio sensing and computer vision) commonly needed by IoT and wearable applications. But currently deep learning algorithms are seldom used in mobile/IoT class hardware because they often impose debilitating levels of system overhead (e.g., memory, computation and energy). Efforts to address this barrier to deep learning adoption are slowed by our lack of a systematic understanding of how these algorithms behave at inference time on resource constrained hardware. In this paper, we present the first -- albeit preliminary -- measurement study of common deep learning models (such as Convolutional Neural Networks and Deep Neural Networks) on representative mobile and embedded platforms. The aim of this investigation is to begin to build knowledge of the performance characteristics, resource requirements and the execution bottlenecks for deep learning models when being used to recognize categories of behavior and context. The results and insights of this study, lay an empirical foundation for the development of optimization methods and execution environments that enable deep learning to be more readily integrated into next-generation IoT, smartphones and wearable systems.
Cultural psychology: a once and future discipline?

Now, we come to offer you the right catalogues of book to open. cultural psychology a once and future discipline is one of the literary work in this world in suitable to be reading material. That's not only this book gives reference, but also it will show you the amazing benefits of reading a book. Developing your countless minds is needed; moreover you are kind of people with great curiosity. So, the book is very appropriate for you.
Combining Markov Random Fields and Convolutional Neural Networks for Image Synthesis

This paper studies a combination of generative Markov random field (MRF) models and discriminatively trained deep convolutional neural networks (dCNNs) for synthesizing 2D images. The generative MRF acts on higher-levels of a dCNN feature pyramid, controlling the image layout at an abstract level. We apply the method to both photographic and non-photo-realistic (artwork) synthesis tasks. The MRF regularizer prevents over-excitation artifacts and reduces implausible feature mixtures common to previous dCNN inversion approaches, permitting synthesizing photographic content with increased visual plausibility. Unlike standard MRF-based texture synthesis, the combined system can both match and adapt local features with considerable variability, yielding results far out of reach of classic generative MRF methods.
Role of culture in gambling and problem gambling.

There has been a significant gap in the gambling literature regarding the role of culture in gambling and problem gambling (PG). This paper aims to this such gap by presenting a systematic review of the cultural variations in gambling and PG as well as a discussion of the role cultural variables can play in the initiation and maintenance of gambling in order to stimulate further research. The review shows that although studies investigating prevalence rates of gambling and PG among different cultures are not plentiful, evidence does suggest certain cultural groups are more vulnerable to begin gambling and to develop PG. Significant factors including familial/genetic, sociological, and individual factors have been found in the Western gambling literature as playing important roles in the development and maintenance of PG. These factors need to be examined now in other cultural groups so we can better understand the etiological processes involved in PG and design culturally sensitive treatments. In addition, variables, such as cultural values and beliefs, the process of acculturation, and the influence of culturally determined, help-seeking behaviors need to be also examined in relation to the role they could play in the initiation of and maintenance of gambling. Understanding the contribution of cultural variables will allow us to devise better prevention and treatment options for PG. Methodological problems in this area of research are highlighted, and suggestions for future research are included.
Online Social Network Dependency: Theoretical Development and Testing of Competing Models

The proliferation of new social media technologies has changed the behavioral patterns of online users. This study aims at investigating the structure and dimensionality of the Online Social Network Dependency (OSN Dependency). We tested the competing models built upon the cognitive-behavioral model and the biopsychogical framework of addiction. Our findings suggested that OSN Dependency can be explained by a higher-order factor model with seven first-order factors (i.e. mood alternation, social benefit, negative outcomes, compulsivity, excessive time, withdrawal, and interpersonal control) and two correlated second-order factors (i.e. social components and intrapersonal components). The model provides a good-fit to the data, reflecting logical consistency. Implications of the current investigation for practice and research are provided.
Opinion mining from noisy text data

The proliferation of Internet has not only generated huge volumes of unstructured information in the form of web documents, but a large amount of text is also generated in the form of emails, blogs, and feedbacks etc. The data generated from online communication acts as potential gold mines for discovering knowledge. Text analytics has matured and is being successfully employed to mine important information from unstructured text documents. Most of these techniques use Natural Language Processing techniques which assume that the underlying text is clean and correct. Statistical techniques, though not as accurate as linguistic mechanisms, are also employed for the purpose to overcome the dependence on clean text. The chief bottleneck for designing statistical mechanisms is however its dependence on appropriately annotated training data. None of these methodologies are suitable for mining information from online communication text data due to the fact that they are often noisy. These texts are informally written. They suffer from spelling mistakes, grammatical errors, improper punctuation and irrational capitalization. This paper focuses on opinion extraction from noisy text data. It is aimed at extracting and consolidating opinions of customers from blogs and feedbacks, at multiple levels of granularity. Ours is a hybrid approach, in which we initially employ a semi-supervised method to learn domain knowledge from a training repository which contains both noisy and clean text. Thereafter we employ localized linguistic techniques to extract opinion expressions from noisy text. We have developed a system based on this approach, which provides the user with a platform to analyze opinion expressions extracted from a repository.