nils-herrmann/clean_scirepeval huggingface dataset:
A combined transmembrane topology and signal peptide prediction method.

An inherent problem in transmembrane protein topology prediction and signal peptide prediction is the high similarity between the hydrophobic regions of a transmembrane helix and that of a signal peptide, leading to cross-reaction between the two types of predictions. To improve predictions further, it is therefore important to make a predictor that aims to discriminate between the two classes. In addition, topology information can be gained when successfully predicting a signal peptide leading a transmembrane protein since it dictates that the N terminus of the mature protein must be on the non-cytoplasmic side of the membrane. Here, we present Phobius, a combined transmembrane protein topology and signal peptide predictor. The predictor is based on a hidden Markov model (HMM) that models the different sequence regions of a signal peptide and the different regions of a transmembrane protein in a series of interconnected states. Training was done on a newly assembled and curated dataset. Compared to TMHMM and SignalP, errors coming from cross-prediction between transmembrane segments and signal peptides were reduced substantially by Phobius. False classifications of signal peptides were reduced from 26.1% to 3.9% and false classifications of transmembrane helices were reduced from 19.0% to 7.7%. Phobius was applied to the proteomes of Homo sapiens and Escherichia coli. Here we also noted a drastic reduction of false classifications compared to TMHMM/SignalP, suggesting that Phobius is well suited for whole-genome annotation of signal peptides and transmembrane regions. The method is available at as well as at
Gaussian processes for multi-sensor environmental monitoring

Efficiently monitoring environmental conditions across large indoor spaces (such as warehouses, factories or data centers) is an important problem with many applications. Deployment of a sensor network across the space can provide very precise readings at discrete locations. However, construction of a continuous model from this discrete sensor data is a challenge. The challenge is made harder by economic and logistical constraints that may limit the number of sensor motes in the network. The required model, therefore, must be able to interpolate sparse data and give accurate predictions at unsensed locations, as well as provide some notion of the uncertainty on those predictions. We propose a Gaussian process based model to answer both of these issues. We use Gaussian processes to model temperature and humidity distributions across an indoor space as functions of a 3-dimensional point. We study the model selection process and show that good results can be obtained, even with sparse sensor data. Deployment of a sensor network across an indoor lab provides real-world data that we use to construct an environmental model of the lab space. We seek to refine the model obtained from the initial deployment by using the uncertainty estimates provided by the Gaussian process methodology to modify sensor distribution such that each sensor is most advantageously placed. We explore multiple sensor placement techniques and experimentally validate a near-optimal criterion.
Active Reinforcement Learning with Monte-Carlo Tree Search

Active Reinforcement Learning (ARL) is a twist on RL where the agent observes reward information only if it pays a cost. This subtle change makes exploration substantially more challenging. Powerful principles in RL like optimism, Thompson sampling, and random exploration do not help with ARL. We relate ARL in tabular environments to BayesAdaptive MDPs. We provide an ARL algorithm using Monte-Carlo Tree Search that is asymptotically Bayes optimal. Experimentally, this algorithm is near-optimal on small Bandit problems and MDPs. On larger MDPs it outperforms a Q-learner augmented with specialised heuristics for ARL. By analysing exploration behaviour in detail, we uncover obstacles to scaling up simulation-based algorithms for ARL.
The nature of procrastination: a meta-analytic and theoretical review of quintessential self-regulatory failure.

Procrastination is a prevalent and pernicious form of self-regulatory failure that is not entirely understood. Hence, the relevant conceptual, theoretical, and empirical work is reviewed, drawing upon correlational, experimental, and qualitative findings. A meta-analysis of procrastination's possible causes and effects, based on 691 correlations, reveals that neuroticism, rebelliousness, and sensation seeking show only a weak connection. Strong and consistent predictors of procrastination were task aversiveness, task delay, self-efficacy, and impulsiveness, as well as conscientiousness and its facets of self-control, distractibility, organization, and achievement motivation. These effects prove consistent with temporal motivation theory, an integrative hybrid of expectancy theory and hyperbolic discounting. Continued research into procrastination should not be delayed, especially because its prevalence appears to be growing.
On the Use of Automated Text Summarization Techniques for Summarizing Source Code

During maintenance developers cannot read the entire code of large systems. They need a way to get a quick understanding of source code entities (such as, classes, methods, packages, etc.), so they can efficiently identify and then focus on the ones related to their task at hand. Sometimes reading just a method header or a class name does not tell enough about its purpose and meaning, while reading the entire implementation takes too long. We study a solution which mitigates the two approaches, i.e., short and accurate textual descriptions that illustrate the software entities without having to read the details of the implementation. We create such descriptions using techniques from automatic text summarization. The paper presents a study that investigates the suitability of various such techniques for generating source code summaries. The results indicate that a combination of text summarization techniques is most appropriate for source code summarization and that developers generally agree with the summaries produced.
Study of the Navigation Method for a Snake Robot Based on the Kinematics Model with MEMS IMU

A snake robot is a type of highly redundant mobile robot that significantly differs from a tracked robot, wheeled robot and legged robot. To address the issue of a snake robot performing self-localization in the application environment without assistant orientation, an autonomous navigation method is proposed based on the snake robot's motion characteristic constraints. The method realized the autonomous navigation of the snake robot with non-nodes and an external assistant using its own Micro-Electromechanical-Systems (MEMS) Inertial-Measurement-Unit (IMU). First, it studies the snake robot's motion characteristics, builds the kinematics model, and then analyses the motion constraint characteristics and motion error propagation properties. Second, it explores the snake robot's navigation layout, proposes a constraint criterion and the fixed relationship, and makes zero-state constraints based on the motion features and control modes of a snake robot. Finally, it realizes autonomous navigation positioning based on the Extended-Kalman-Filter (EKF) position estimation method under the constraints of its motion characteristics. With the self-developed snake robot, the test verifies the proposed method, and the position error is less than 5% of Total-Traveled-Distance (TDD). In a short-distance environment, this method is able to meet the requirements of a snake robot in order to perform autonomous navigation and positioning in traditional applications and can be extended to other familiar multi-link robots.
Hiding file on Android mobile and sending APK file through whats app using steganography and compression techniques

By using different ways users can send and receive information on android mobiles. Security is major issue while sharing these file on android platforms. Steganography also have some limitations in embedding capacity of data. By using appropriate compression algorithm we can reduce the size of data. Also WhatsApp doesn't allow user to share apk file. In this paper we have developed an android app by means of which we can hide data behind image and we can share apk file through WhatsApp. This app is developed by using steganography and LZMA compression technique. Advantage of this app is it provides the double security by using steganography and compression.
Comparison of Recent Machine Learning Techniques for Gender Recognition from Facial Images

Recently, several machine learning methods for gender classification from frontal facial images have been proposed. Their variety suggests that there is not a unique or generic solution to this problem. In addition to the diversity of methods, there is also a diversity of benchmarks used to assess them. This gave us the motivation for our work: to select and compare in a concise but reliable way the main state-of-the-art methods used in automatic gender recognition. As expected, there is no overall winner. The winner, based on the accuracy of the classification, depends on the type of benchmarks used.
A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP)

A parallel algorithm for low-rank tensor decomposition that is especially well-suited for big tensors is proposed. The new algorithm is based on parallel processing of a set of randomly compressed, reduced-size `replicas' of the big tensor. Each replica is independently decomposed, and the results are joined via a master linear equation per tensor mode. The approach enables massive parallelism with guaranteed identifiability properties: if the big tensor has low rank and the system parameters are appropriately chosen, then the rank-one factors of the big tensor will be exactly recovered from the analysis of the reduced-size replicas. The proposed algorithm is proven to yield memory / storage and complexity gains of order up to IJ/F for a big tensor of size I × J × K of rank F with F ≤I ≤J ≤K.
Enforcing k-anonymity in Web Mail Auditing

We study the problem of k-anonymization of mail messages in the realistic scenario of auditing mail traffic in a major commercial Web mail service. Mail auditing is necessary in various Web mail debugging and quality assurance activities, such as anti-spam or the qualitative evaluation of novel mail features. It is conducted by trained professionals, often referred to as "auditors", who are shown messages that could expose personally identifiable information. We address here the challenge of k-anonymizing such messages, focusing on machine generated mail messages that represent more than 90% of today's mail traffic. We introduce a novel message signature Mail-Hash, specifically tailored to identifying structurally-similar messages, which allows us to put such messages in a same equivalence class. We then define a process that generates, for each class, masked mail samples that can be shown to auditors, while guaranteeing the k-anonymity of users. The productivity of auditors is measured by the amount of non-hidden mail content they can see every day, while considering normal working conditions, which set a limit to the number of mail samples they can review. In addition, we consider k-anonymity over time since, by definition of k-anonymity, every new release places additional constraints on the assignment of samples. We describe in details the results we obtained over actual Yahoo mail traffic, and thus demonstrate that our methods are feasible at Web mail scale. Given the constantly growing concern of users over their email being scanned by others, we argue that it is critical to devise such algorithms that guarantee k-anonymity, and implement associated processes in order to restore the trust of mail users.
Refinement of the fundamental niche of black mangrove (Avicennia germinans) seedlings in Louisiana: Applications for restoration

Black mangrove (Avicennia germinans) occurs at the northern boundary of its North American range in the coastal salt marshes and barrier islands of Louisiana. This species provides important habitat and sustainability to Louisiana’s coastal salt marshes via its woody structure and extensive root system. Refinement of the physiological tolerances of A. germinans seedlings to salinity, sand burial and hydrologic regime provides valuable insight into the fundamental niche of A. germinans and thereby the potential for increased restoration success in coastal and back-barrier salt marshes. We subjected two age classes of A. germinans seedlings used in restoration (young seedlings of 6 or 12 months of age, and older seedlings of either 18 or 24 months of age) to abiotic stressors frequently encountered at coastal restoration sites: (1) elevated salinity levels, from 0 to 96 ppt, (2) sediment burial, from 0 to +20 cm, and (3) varying water levels, ranging from 0 cm to −60 cm. A. germinans seedlings displayed a non-linear response to each environmental factor, with greatest biomass occurring between low and moderate levels of stress or disturbance (i.e., between 24 and 48 ppt salinity, 0 to +10 cm burial, and −15 to −30 cm water level). The two age classes displayed similar physiological tolerances; however, older seedlings may confer an advantage due to greater total biomass and reserves, most notably in response to burial. We suggest that this refinement of the fundamental niche be utilized as a guideline for improved restoration success in micro-tidal environments within black mangrove’s range.
Informative path planning for an autonomous underwater vehicle

We present a path planning method for autonomous underwater vehicles in order to maximize mutual information. We adapt a method previously used for surface vehicles, and extend it to deal with the unique characteristics of underwater vehicles. We show how to generate near-optimal paths while ensuring that the vehicle stays out of high-traffic areas during predesignated time intervals. In our objective function we explicitly account for the fact that underwater vehicles typically take measurements while moving, and that they do not have the ability to communicate until they resurface. We present field results from ocean trials on planning paths for a specific AUV, an underwater glider.
The furhat Back-Projected humanoid Head-Lip Reading, gaze and Multi-Party Interaction

In this article, we present Furhat – a back-projected human-like robot head using state-of-the art facial animation. Three experiments are presented where we investigate how the head might facilitate human-robot face-to-face interaction. First, we investigate how the animated lips increase the intelligibility of the spoken output, and compare this to an animated agent presented on a flat screen, as well as to a human face. Second, we investigate the accuracy of the perception of Furhat’s gaze in a setting typical for situated interaction, where Furhat and a human are sitting around a table. The accuracy of the perception of Furhat’s gaze is measured depending on eye design, head movement and viewing angle. Third, we investigate the turntaking accuracy of Furhat in a multi-party interactive setting, as compared to an animated agent on a flat screen. We conclude with some observations from a public setting at a museum, where Furhat interacted with thousands of visitors in a multi-party interaction.
Global refinement of random forest

Random forest is well known as one of the best learning methods. In spite of its great success, it also has certain drawbacks: the heuristic learning rule does not effectively minimize the global training loss; the model size is usually too large for many real applications. To address the issues, we propose two techniques, global refinement and global pruning, to improve a pre-trained random forest. The proposed global refinement jointly relearns the leaf nodes of all trees under a global objective function so that the complementary information between multiple trees is well exploited. In this way, the fitting power of the forest is significantly enhanced. The global pruning is developed to reduce the model size as well as the over-fitting risk. The refined model has better performance and smaller storage cost, as verified in extensive experiments.
A review on stress inducement stimuli for assessing human stress using physiological signals

Assessing human stress in real-time is more difficult and challenging today. The present review deals about the measurement of stress in laboratory environment using different stress inducement stimuli by the help of physiological signals. Previous researchers have been used different stress inducement stimuli such as stroop colour word test (CWT), mental arithmetic test, public speaking task, cold pressor test, computer games and works used to induce the stress. Most of the researchers have been analyzed stress using questionnaire based approach and physiological signals. The several physiological signals like Electrocardiogram (ECG), Electromyogram (EMG), Galvanic Skin Response (GSR), Blood Pressure (BP), Skin Temperature (ST), Blood Volume Pulse (BVP), respiration rate (RIP) and Electroencephalogram (EEG) were briefly investigated to identify the stress. Different statistical methods like Analysis of variance (ANOVA), two-way ANOVA, Multivariate analysis of variance (MANOVA), t-test, paired t-tests and student t-tests have used to describe the correlation between stress inducement stimuli, subjective parameters (age, gender and etc.,) and physiological signals. This present works aims to find the most appropriate stress inducement stimuli, physiological signals and statistical method to efficiently asses the human stress.
Human activity analysis: A review

Human activity recognition is an important area of computer vision research. Its applications include surveillance systems, patient monitoring systems, and a variety of systems that involve interactions between persons and electronic devices such as human-computer interfaces. Most of these applications require an automated recognition of high-level activities, composed of multiple simple (or atomic) actions of persons. This article provides a detailed overview of various state-of-the-art research papers on human activity recognition. We discuss both the methodologies developed for simple human actions and those for high-level activities. An approach-based taxonomy is chosen that compares the advantages and limitations of each approach.
 Recognition methodologies for an analysis of the simple actions of a single person are first presented in the article. Space-time volume approaches and sequential approaches that represent and recognize activities directly from input images are discussed. Next, hierarchical recognition methodologies for high-level activities are presented and compared. Statistical approaches, syntactic approaches, and description-based approaches for hierarchical recognition are discussed in the article. In addition, we further discuss the papers on the recognition of human-object interactions and group activities. Public datasets designed for the evaluation of the recognition methodologies are illustrated in our article as well, comparing the methodologies' performances. This review will provide the impetus for future research in more productive areas.
An Investigation into the Use of Common Libraries in Android Apps

The packaging model of Android apps requires the entire code necessary for the execution of an app to be shipped into one single apk file. Thus, an analysis of Android apps often visits code which is not part of the functionality delivered by the app. Such code is often contributed by the common libraries which are used pervasively by all apps. Unfortunately, Android analyses, e.g., for piggybacking detection and malware detection, can produce inaccurate results if they do not take into account the case of library code, which constitute noise in app features. Despite some efforts on investigating Android libraries, the momentum of Android research has not yet produced a complete set of common libraries to further support in-depth analysis of Android apps. In this paper, we leverage a dataset of about 1.5 million apps from Google Play to harvest potential common libraries, including advertisement libraries. With several steps of refinements, we finally collect by far the largest set of 1,113 libraries supporting common functionality and 240 libraries for advertisement. We use the dataset to investigates several aspects of Android libraries, including their popularity and their proportion in Android app code. Based on these datasets, we have further performed several empirical investigations to confirm the motivations behind our work.
How Envy Influences SNS Intentions to Use

Social networking sites (SNS) have grown to be one of the most prevalent technologies, providing users a variety of benefits. However, SNS also provide user sufficient opportunities to access others’ positive information. This would elicit envy. In the current study, we develop a theoretical framework that elaborates the mechanism through which online envy is generated and influences SNS usage. We specify that online users experience two types of envy and each one could have distinct influences on continuance intention to use of SNS. Our findings provide valuable implications for both academic researchers and IS practitioners.
Connectionism and cognitive architecture: A critical analysis

This paper explores the difference between Connectionist proposals for cognitive a r c h i t e c t u r e a n d t h e s o r t s o f m o d e l s t hat have traditionally been assum e d i n c o g n i t i v e s c i e n c e . W e c l a i m t h a t t h e m a j o r d i s t i n c t i o n i s t h a t , w h i l e b o t h Connectionist and Classical architectures postulate representational mental states, the latter but not the former are committed to a symbol-level of representation, or to a ‘language of thought’: i.e., to representational states that have combinatorial syntactic and semantic structure. Several arguments for combinatorial structure in mental representations are then reviewed. These include arguments based on the ‘systematicity’ of mental representation: i.e., on the fact that cognitive capacities always exhibit certain symmetries, so that the ability to entertain a given thought implies the ability to entertain thoughts with semantically related contents. We claim that such arguments make a powerful case that mind/brain architecture is not Connectionist at the cognitive level. We then consider the possibility that Connectionism may provide an account of the neural (or ‘abstract neurological’) structures in which Classical cognitive architecture is implemented. We survey a n u m b e r o f t h e s t a n d a r d a r g u m e n t s t h a t h a v e b e e n o f f e r e d i n f a v o r o f Connectionism, and conclude that they are coherent only on this interpretation. Connectionist or PDP models are catching on. There are conferences and new books nearly every day, and the popular science press hails this new wave of theorizing as a breakthrough in understanding the mind (a typical example is the article in the May issue of Science 86, called “How we think: A new theory”). There are also, inevitably, descriptions of the emergence of