nils-herrmann/clean_scirepeval huggingface dataset:
Internet Addiction and Relationships with Insomnia, Anxiety, Depression, Stress and Self-Esteem in University Students: A Cross-Sectional Designed Study

Internet addiction (IA) could be a major concern in university medical students aiming to develop into health professionals. The implications of this addiction as well as its association with sleep, mood disorders and self-esteem can hinder their studies, impact their long-term career goals and have wide and detrimental consequences for society as a whole. The objectives of this study were to: 1) Assess potential IA in university medical students, as well as factors associated with it; 2) Assess the relationships between potential IA, insomnia, depression, anxiety, stress and self-esteem.



Our study was a cross-sectional questionnaire-based survey conducted among 600 students of three faculties: medicine, dentistry and pharmacy at Saint-Joseph University. Four validated and reliable questionnaires were used: the Young Internet Addiction Test, the Insomnia Severity Index, the Depression Anxiety Stress Scales (DASS 21), and the Rosenberg Self Esteem Scale (RSES).



The average YIAT score was 30 ± 18.474; Potential IA prevalence rate was 16.8% (95% confidence interval: 13.81-19.79%) and it was significantly different between males and females (p-value = 0.003), with a higher prevalence in males (23.6% versus 13.9%). Significant correlations were found between potential IA and insomnia, stress, anxiety, depression and self-esteem (p-value < 0.001); ISI and DASS sub-scores were higher and self-esteem lower in students with potential IA.



Identifying students with potential IA is important because this addiction often coexists with other psychological problems. Therefore, interventions should include not only IA management but also associated psychosocial stressors such as insomnia, anxiety, depression, stress, and self-esteem.
Different Contexts Lead to Different Word Embeddings

Recent work for learning word representations has applied successfully to many NLP applications, such as sentiment analysis and question answering. However, most of these models assume a single vector per word type without considering polysemy and homonymy. In this paper, we present an extension to the CBOW model which not only improves the quality of embeddings but also makes embeddings suitable for polysemy. It differs from most of the related work in that it learns one semantic center embedding and one context bias instead of training multiple embeddings per word type. Different context leads to different bias which is defined as the weighted average embeddings of local context. Experimental results on similarity task and analogy task show that the word representations learned by the proposed method outperform the competitive baselines.
Harnessing Automated Test Case Generators for GUI Testing in Industry

Modern graphical user interfaces (GUIs) are highly dynamic and support multi-touch interactions and screen gestures besides conventional inputs via mouse and keyboard. Hence, the flexibility of modern GUIs enables countless usage scenarios and combinations including all kind of interactions. From the viewpoint of testing, this flexibility results in a combinatorial explosion of possible interaction sequences. It dramatically raises the required time and effort involved in GUI testing, which brings manual exploration as well as conventional regression testing approaches to its limits. Automated test generation (ATG) has been proposed as a solution to reduce the effort for manually designing test cases and to speed-up test execution cycles. In this paper we describe how we successfully harnessed a state-of-the-art ATG tool (Randoop) developed for code-based API testing to generate GUI test cases. The key is an adapter that transforms API calls to GUI events. The approach is the result of a research transfer project with the goal to apply ATG for testing of human machine interfaces used to control industrial machinery. In this project the ATG tool was used to generate unit test cases for custom GUI controls and system tests for exploring navigation scenarios. It helped to increase the test coverage and was able reveal new defects in the implementation of the GUI controls as well as in the GUI application.
e-Examiner : Towards a Fully-Automatic Knowledge Assessment Tool applicable in Adaptive E-Learning Systems

Information about the learners’ level or state of knowledge is a key aspect for effective provision of personalized learning activities. E-learning systems gain such information by users’ self-assessment, predefined questionnaires and indirectly by inferences on observed user behaviors. However, most present solution approaches either cause a huge effort of manpower or a lack of required reliability. To overcome this, we have developed e-Examiner, a tool for automated knowledge assessment. It is designed to generate questions automatically and to assess student’s natural language answers based on the learning content. In this paper, firstly, we introduce the overall concept and architecture. Secondly, we focus on our solution for automated assessment of answers, which is based on the ROUGE toolset for automatic summary evaluation.
ERP System Adoption - Does the Size Matter?

This paper investigates the relationship of enterprise size to the constraints and objectives of Enterprise Resource Planning (ERP) systems adoption. The survey data based on the responses of 44 companies indicates that significant differences exist between small, medium-sized and large enterprises in ERP system adoption. Specifically, the findings suggest that small companies experience more knowledge constraints than their larger counterparts in ERP adoption. Further, while being the most prevalent objective for ERP adoption in all the company groups, business development through ERP adoption is considered especially important by the medium-sized and large enterprises. Finally, the findings of the study suggest that instead of considering small and medium-sized enterprises as one homogenous group, the differences between these two groups of companies should be acknowledged in the future research.
HUMAN-AUTOMATION INTERACTION : TAXONOMIES AND QUALITATIVE MODELS The Meaning of Human-Automation Interaction

Automation does not mean humans are replaced; quite the opposite. Increasingly, humans are asked to interact with automation in complex and typically large-scale systems, including aircraft and air traffic control, nuclear power, manufacturing plants, military systems, homes, and hospitals. This is not an easy or error-free task for either the system designer or the human operator/automation supervisor, especially as computer technology becomes ever more sophisticated. This review outlines recent research and challenges in the area, including taxonomies and qualitative models of human-automation interaction; descriptions of automation-related accidents and studies of adaptive automation; and social, political, and ethical issues.
Deep learning with shallow architecture for image classification

This paper presents a new scheme for image classification. The proposed scheme depicts a shallow architecture of Convolutional Neural Network (CNN) providing deep learning: For each image, we calculated the connection weights between the input layer and the hidden layer based on MultiResolution Analysis (MRA) at different levels of abstraction. Then, we selected the best features, representing well each class of images, with their corresponding weights using Adaboost algorithm. These weights are used as the connection weights between the hidden layer and the output layer, and will be used in the test phase to classify a given query image. The proposed approach was tested on different datasets and the obtained results prove the efficiency and the speed of the proposed approach.
Data-Driven Modeling for Chinese Ancient Architecture

The existing 3D modeling studies of Chinese ancient architecture are mostly procedure driven and rely on fixed construction rules. Therefore, these methods have limited applications in virtual reality (VR) engineering. We propose a data-driven approach to synthesize 3D models from existing 3D data that provides more flexibility and fills the gap between academic studies and VR engineering. First, 3D architecture models were preprocessed and decomposed into components, and the components were clustered by their geometric features. Second, a Bayesian network was generated by learning from the dataset to represent the internal relationships between the architectural components. Third, the inference results of the trained network were utilized to generate a reasonable relationship matching to support the synthesis of the structural components. The proposed method can be used in 3D content creation for VR development and directly supports VR applications in practice.
Graph databases: A survey

In the era of big data, data analytics, business intelligence database management plays a vital role from technical business management and research point of view. Over many decades, database management has been a topic of active research. There are different type of database management system have been proposed over a period of time but Relational Database Management System (RDBMS) is the one which has been most popularly used in academic research as well as industrial setup[1]. In recent years, graph databases regained interest among the researchers for certain obvious reasons. One of the most important reasons for such an interest in a graph database is because of the inherent property of graphs as a graph structure. Graphs are present everywhere in the data structure, which represents the strong connectivity within the data. Most of the graph database models are defined in which data-structure for schema and instances are modeled as graph or generalization of a graph. In such graph database models, data manipulations are expressed by graph-oriented operations and type constructors . Now days, most of the real world applications can be modeled as a graph and one of the best real world examples is social or biological network. This paper gives an overview of the different type of graph databases, applications, and comparison between their models based on some properties.
Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots

Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. While these methods are very efficient, they have two major drawbacks. First, they are incomplete, i.e. they sometimes fail to find a solution even if one exists, and second, the resulting solutions are often not optimal. In this paper we present a method for finding and optimizing priority schemes for such prioritized and decoupled planning techniques. Existing approaches apply a single priority scheme which makes them overly prone to failure in cases where valid solutions exist. By searching in the space of priorization schemes, our approach overcomes this limitation. It performs a randomized search with hill-climbing to find solutions and to minimize the overall path length. To focus the search, our algorithm is guided by constraints generated from the task specification. To illustrate the appropriateness of this approach, this paper discusses experimental results obtained with real robots and through systematic robot simulation. The experimental results illustrate the superior performance of our approach, both in terms of efficiency of robot motion and in the ability to find valid plans.
Reinforcement Learning for Humanoid Robotics

Reinforcement learning offers one of the most general framework to take traditional robotics towards true autonomy and versatility. However, applying reinforcement learning to high dimensional movement systems like humanoid robots remains an unsolved problem. In this paper, we discuss different approaches of reinforcement learning in terms of their applicability in humanoid robotics. Methods can be coarsely classified into three different categories, i.e., greedy methods, ‘vanilla’ policy gradient methods, and natural gradient methods. We discuss that greedy methods are not likely to scale into the domain humanoid robotics as they are problematic when used with function approximation. ‘Vanilla’ policy gradient methods on the other hand have been successfully applied on real-world robots including at least one humanoid robot . We demonstrate that these methods can be significantly improved using the natural policy gradient instead of the regular policy gradient. A derivation of the natural policy gradient is provided, proving that the average policy gradient of Kakade  is indeed the true natural gradient. A general algorithm for estimating the natural gradient, the Natural Actor-Critic algorithm, is introduced. This algorithm converges to the nearest local minimum of the cost function with respect to the Fisher information metric under suitable conditions. The algorithm outperforms non-natural policy gradients by far in a cart-pole balancing evaluation, and for learning nonlinear dynamic motor primitives for humanoid robot control. It offers a promising route for the development of reinforcement learning for truly high-dimensionally continuous state-action systems.
CAVE-SOM: Immersive visual data mining using 3D Self-Organizing Maps

Data mining techniques are becoming indispensable as the amount and complexity of available data is rapidly growing. Visual data mining techniques attempt to include a human observer in the loop and leverage human perception for knowledge extraction. This is commonly allowed by performing a dimensionality reduction into a visually easy-to-perceive 2D space, which might result in significant loss of important spatial and topological information. To address this issue, this paper presents the design and implementation of a unique 3D visual data mining framework - CAVE-SOM. The CAVE-SOM system couples the Self-Organizing Map (SOM) algorithm with the immersive Cave Automated Virtual Environment (CAVE). The main advantages of the CAVE-SOM system are: i) utilizing a 3D SOM to perform dimensionality reduction of large multi-dimensional datasets, ii) immersive visualization of the trained 3D SOM, iii) ability to explore and interact with the multi-dimensional data in an intuitive and natural way. The CAVE-SOM system uses multiple visualization modes to guide the visual data mining process, for instance the data histograms, U-matrix, connections, separations, uniqueness and the input space view. The implemented CAVE-SOM framework was validated on several benchmark problems and then successfully applied to analysis of wind-power generation data. The knowledge extracted using the CAVE-SOM system can be used for further informed decision making and machine learning.
SentiWordNet for Indian Languages

The discipline where sentiment/ opinion/ emotion has been identified and classified in human written text is well known as sentiment analysis. A typical computational approach to sentiment analysis starts with prior polarity lexicons where entries are tagged with their prior out of context polarity as human beings perceive using their cognitive knowledge. Till date, all research efforts found in sentiment lexicon literature deal mostly with English texts. In this article, we propose multiple computational techniques like, WordNet based, dictionary based, corpus based or generative approaches for generating SentiWordNet(s) for Indian languages. Currently, SentiWordNet(s) are being developed for three Indian languages: Bengali, Hindi and Telugu. An online intuitive game has been developed to create and validate the developed SentiWordNet(s) by involving Internet population. A number of automatic, semi-automatic and manual validations and evaluation methodologies have been adopted to measure the coverage and credibility of the developed SentiWordNet(s).
Using OS Design Patterns to Provide Reliability and Security as-a-Service for VM-based Clouds

This paper extends the concepts behind cloud services to offer hypervisor-based reliability and security monitors for cloud virtual machines. Cloud VMs can be heterogeneous and as such guest OS parameters needed for monitoring can vary across different VMs and must be obtained in some way. Past work involves running code inside the VM, which is unacceptable for a cloud environment. We solve this problem by recognizing that there are common OS design patterns that can be used to infer monitoring parameters from the guest OS. We extract information about the cloud user's guest OS with the user's existing VM image and knowledge of OS design patterns as the only inputs to analysis. To demonstrate the range of monitoring functionality possible with this technique, we implemented four sample monitors: a guest OS process tracer, an OS hang detector, a return-to-user attack detector, and a process-based keylogger detector.
Neuroevolution: from architectures to learning

Artificial neural networks (ANNs) are applied to many real-world problems, ranging from pattern classification to robot control. In order to design a neural network for a particular task, the choice of an architecture (including the choice of a neuron model), and the choice of a learning algorithm have to be addressed. Evolutionary search methods can provide an automatic solution to these problems. New insights in both neuroscience and evolutionary biology have led to the development of increasingly powerful neuroevolution techniques over the last decade. This paper gives an overview of the most prominent methods for evolving ANNs with a special focus on recent advances in the synthesis of learning architectures.
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation.
Striatal Plasticity and Basal Ganglia Circuit Function

The dorsal striatum, which consists of the caudate and putamen, is the gateway to the basal ganglia. It receives convergent excitatory afferents from cortex and thalamus and forms the origin of the direct and indirect pathways, which are distinct basal ganglia circuits involved in motor control. It is also a major site of activity-dependent synaptic plasticity. Striatal plasticity alters the transfer of information throughout basal ganglia circuits and may represent a key neural substrate for adaptive motor control and procedural memory. Here, we review current understanding of synaptic plasticity in the striatum and its role in the physiology and pathophysiology of basal ganglia function.
Gazetteer-Independent Toponym Resolution Using Geographic Word Profiles

Toponym resolution, or grounding names of places to their actual locations, is an important problem in analysis of both historical corpora and present-day news and web content. Recent approaches have shifted from rule-based spatial minimization methods to machine learned classifiers that use features of the text surrounding a toponym. Such methods have been shown to be highly effective, but they crucially rely on gazetteers and are unable to handle unknown place names or locations. We address this limitation by modeling the geographic distributions of words over the earth’s surface: we calculate the geographic profile of each word based on local spatial statistics over a set of geo-referenced language models. These geo-profiles can be further refined by combining in-domain data with background statistics from Wikipedia. Our resolver computes the overlap of all geo-profiles in a given text span; without using a gazetteer, it performs on par with existing classifiers. When combined with a gazetteer, it achieves state-of-the-art performance for two standard toponym resolution corpora (TR-CoNLL and Civil War). Furthermore, it dramatically improves recall when toponyms are identified by named entity recognizers, which often (correctly) find non-standard variants of toponyms.
A Hybrid Malicious Code Detection Method based on Deep Learning

In this paper, we propose a hybrid malicious code detection scheme based on AutoEncoder and DBN (Deep Belief Networks). Firstly, we use the AutoEncoder deep learning method to reduce the dimensionality of data. This could convert complicated high-dimensional data into low dimensional codes with the nonlinear mapping, thereby reducing the dimensionality of data, extracting the main features of the data; then using DBN learning method to detect malicious code. DBN is composed of multilayer Restricted Boltzmann Machines (RBM, Restricted Boltzmann Machine) and a layer of BP neural network. Based on unsupervised training of every layer of RBM, we make the output vector of the last layer of RBM as the input vectors of BP neural network, then conduct supervised training to the BP neural network, finally achieve the optimal hybrid model by fine-tuning the entire network. After inputting testing samples into the hybrid model, the experimental results show that the detection accuracy getting by the hybrid detection method proposed in this paper is higher than that of single DBN. The proposed method reduces the time complexity and has better detection performance.
Exploring Recurrent Neural Networks to Detect Named Entities from Biomedical Text

Biomedical named entity recognition (bio-NER) is a crucial and basic step in many biomedical information extraction tasks. However, traditional NER systems are mainly based on complex hand-designed features which are derived from various linguistic analyses and maybe only adapted to specified area. In this paper, we construct Recurrent Neural Network to identify entity names with word embeddings input rather than hand-designed features. Our contributions mainly include three aspects: 1) we adapt a deep learning architecture Recurrent Neural Network (RNN) to entity names recognition; 2) based on the original RNNs such as Elman-type and Jordan-type model, an improved RNN model is proposed; 3) considering that both past and future dependencies are important information, we combine bidirectional recurrent neural networks based on information entropy at the top layer. The experiments conducted on the BioCreative II GM data set demonstrate RNN models outperform CRF and deep neural networks (DNN), furthermore, the improved RNN model performs better than two original RNN models and the combined method is effective.
Predicting Source Code Quality with Static Analysis and Machine Learning

This paper is investigating if it is possible to predict source code quality based on static analysis and machine learning. The proposed approach includes a plugin in Eclipse, uses a combination of peer review/human rating, static code analysis, and classification methods. As training data, public data and student hand-ins in programming are used. Based on this training data, new and uninspected source code can be accurately classified as “well written” or “badly written”. This is a step towards feedback in an interactive environment without peer assessment.