nils-herrmann/clean_scirepeval huggingface dataset:
Real-time clothoid approximation by Rational Bezier curves

This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant computational cost reduction. In addition to this, the proposed technique is tested on a real mobile robot for trajectory generation and kinematic control. To the authors' knowledge, the present approach is the first technique which allows real-time Clothoidal path computation.
Music therapy and music medicine for children and adolescents.

This article summarizes the research on music therapy and music medicine for children and adolescents with diagnoses commonly treated by psychiatrists. Music therapy and music medicine are defined, effects of music on the brain are described, and music therapy research in psychiatric treatment is discussed. Music therapy research with specific child/adolescent populations is summarized, including disorders usually diagnosed in childhood, substance abuse, mood/anxiety disorders, and eating disorders. Clinical implications are listed, including suggestions for health care professionals seeking to use music medicine techniques. Strengths and weaknesses of music therapy treatment are discussed, as well as areas for future research.
The development of pre-service teachers ' TPACK in the use of digital tools

The ministry of education is launching an overall project to implement the use of ICT in the Israeli education system. To prepare pre-service teachers with whom we work for this kind of implementation, we designed a model, which prepares them to use digital tools effectively while integrating particular pedagogy for teaching a specific mathematics or science content. The goal of the present research is to study the development of these pre-service teachers' TPACK (technological, pedagogical and content knowledge), attitudes toward computers and their ICT proficiency. For this purpose, we used questionnaires developed by the MOFET institute and by previous studies. The research results show significant improvement in the TPACK level and ICT proficiency, but no significant effect of the preparation on most of the components of the teachers' attitudes toward computers, being positively high before and after the preparation.
Color and texture descriptors

This paper presents an overview of color and texture descriptors that have been approved for the Final Committee Draft of the MPEG-7 standard. The color and texture descriptors that are described in this paper have undergone extensive evaluation and development during the past two years. Evaluation criteria include effectiveness of the descriptors in similarity retrieval, as well as extraction, storage, and representation complexities. The color descriptors in the standard include a histogram descriptor that is coded using the Haar transform, a color structure histogram, a dominant color descriptor, and a color layout descriptor. The three texture descriptors include one that characterizes homogeneous texture regions and another that represents the local edge distribution. A compact descriptor that facilitates texture browsing is also defined. Each of the descriptors is explained in detail by their semantics, extraction and usage. Effectiveness is documented by experimental results.
The 4-Source Photometric Stereo Technique for Three-Dimensional Surfaces in the Presence of Highlights and Shadows

We present an algorithm for separating the local gradient information and Lambertian color by using 4-source color photometric stereo in the presence of highlights and shadows. We assume that the surface reflectance can be approximated by the sum of a Lambertian and a specular component. The conventional photometric method is generalized for color images. Shadows and highlights in the input images are detected using either spectral or directional cues and excluded from the recovery process, thus giving more reliable estimates of local surface parameters.
A fast and effective image retrieval scheme using color-, texture-, and shape-based histograms

The rapid growth of digital image collections has prompted the need for development of software tools that facilitate efficient searching and retrieval of images from large image databases. Towards this goal, we propose a content-based image retrieval scheme for retrieval of images via their color, texture, and shape features. Using three specialized histograms (i.e. color, wavelet, and edge histograms), we show that a more accurate representation of the underlying distribution of the image features improves the retrieval quality. Furthermore, in an attempt to better represent the user’s information needs, our system provides an interactive search mechanism through the user interface. Users searching through the database can select the visual features and adjust the associated weights according to the aspects they wish to emphasize. The proposed histogram-based scheme has been thoroughly evaluated using two general-purpose image datasets consisting of 1000 and 3000 images, respectively. Experimental results show that this scheme not only improves the effectiveness of the CBIR system, but also improves the efficiency of the overall process.
Detail-Revealing Deep Video Super-Resolution

Previous CNN-based video super-resolution approaches need to align multiple frames to the reference. In this paper, we show that proper frame alignment and motion compensation is crucial for achieving high quality results. We accordingly propose a “sub-pixel motion compensation” (SPMC) layer in a CNN framework. Analysis and experiments show the suitability of this layer in video SR. The final end-to-end, scalable CNN framework effectively incorporates the SPMC layer and fuses multiple frames to reveal image details. Our implementation can generate visually and quantitatively high-quality results, superior to current state-of-the-arts, without the need of parameter tuning.
Integrating Learning and Reasoning with Deep Logic Models

Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns. Probabilistic logic reasoning, on the other hand, is capable to take consistent and robust decisions in complex environments. The integration of deep learning and logic reasoning is still an open-research problem and it is considered to be the key for the development of real intelligent agents. This paper presents Deep Logic Models, which are deep graphical models integrating deep learning and logic reasoning both for learning and inference. Deep Logic Models create an endto-end differentiable architecture, where deep learners are embedded into a network implementing a continuous relaxation of the logic knowledge. The learning process allows to jointly learn the weights of the deep learners and the meta-parameters controlling the high-level reasoning. The experimental results show that the proposed methodology overtakes the limitations of the other approaches that have been proposed to bridge deep learning and reasoning.
Sequence to Sequence Transduction with Hard Monotonic Attention

We present a supervised sequence to sequence transduction model with a hard attention mechanism which combines the more traditional statistical alignment methods with the power of recurrent neural networks. We evaluate the model on the task of morphological inflection generation and show that it provides state of the art results in various setups compared to the previous neural and non-neural approaches. Eventually we present an analysis of the learned representations for both hard and soft attention models, shedding light on the features such models extract in order to solve the task.
Hierarchical clustering schemes.

Techniques for partitioning objects into optimally homogeneous groups on the basis of empirical measures of similarity among those objects have received increasing attention in several different fields. This paper develops a useful correspondence between any hierarchical system of such clusters, and a particular type of distance measure. The correspondence gives rise to two methods of clustering that are computationally rapid and invariant under monotonic transformations of the data. In an explicitly defined sense, one method forms clusters that are optimally "connected," while the other forms clusters that are optimally "compact."
Word Embeddings, Analogies, and Machine Learning: Beyond king - man + woman = queen

Solving word analogies became one of the most popular benchmarks for word embeddings on the assumption that linear relations between word pairs (such as king:man :: woman:queen) are indicative of the quality of the embedding. We question this assumption by showing that the information not detected by linear offset may still be recoverable by a more sophisticated search method, and thus is actually encoded in the embedding. The general problem with linear offset is its sensitivity to the idiosyncrasies of individual words. We show that simple averaging over multiple word pairs improves over the state-of-the-art. A further improvement in accuracy (up to 30% for some embeddings and relations) is achieved by combining cosine similarity with an estimation of the extent to which a candidate answer belongs to the correct word class. In addition to this practical contribution, this work highlights the problem of the interaction between word embeddings and analogy retrieval algorithms, and its implications for the evaluation of word embeddings and the use of analogies in extrinsic tasks.
Academic procrastination and statistics anxiety

Statistics anxiety, which is experienced by as many as 80% of graduate students, has been found to debilitate performance in statistics and research methodology courses. As such, it is likely that statistics anxiety is, in part, responsible for many students delaying enrollment in these courses for as long as possible. Moreover, it is possible that, once enrolled in these courses, students with high levels of statistics anxiety tend to procrastinate on assignments. Thus, the purpose of this study was: (a) to examine the prevalence of procrastination among graduate students, and (b) to investigate the relationship between academic procrastination and six dimensions of statistics anxiety. Participants were 135 graduate students enrolled in three sections of a required introductory-level educational research course at a university in the southeastern part of the USA. Findings revealed that a high percentage of students reported problems with procrastination on writing term papers, studying for examinations, and completing weekly reading assignments. A canonical correlation analysis (Rc1 .51) revealed that academic procrastination resulting from both fear of failure and task aversiveness was related significantly to worth of statistics, interpretation anxiety, test and class anxiety, computational self-concept, fear of asking for help, and fear of the statistics instructor. Implications for statistics anxiety reduction as a procrastination intervention are discussed.
Developing research skills in medical students: AMEE Guide No. 69.

This Guide has been written to provide guidance for individuals involved in curriculum design who wish to develop research skills and foster the attributes in medical undergraduates that help develop research. The Guide will provoke debate on an important subject, and although written specifically with undergraduate medical education in mind, we hope that it will be of interest to all those involved with other health professionals' education. Initially, the Guide describes why research skills and its related attributes are important to those pursuing a medical career. It also explores the reasons why research skills and an ethos of research should be instilled into professionals of the future. The Guide also tries to define what these skills and attributes should be for medical students and lays out the case for providing opportunities to develop research expertise in the undergraduate curriculum. Potential methods to encourage the development of research-related attributes are explored as are some suggestions as to how research skills could be taught and assessed within already busy curricula. This publication also discusses the real and potential barriers to developing research skills in undergraduate students, and suggests strategies to overcome or circumvent these. Whilst we anticipate that this Guide will appeal to all levels of expertise in terms of student research, we hope that, through the use of case studies, we will provide practical advice to those currently developing this area within their curriculum.
Natural Language Processing for Industry

Recently, natural language processing applications have become very popular in the industry. Examples of such applications include “semantic” enterprise search engines, document categorizers, speech recognizers and – last but not least – conversational agents, also known as virtual assistants or “chatbots”. The latter in particular are very sought-after in the customer care domain, where the aim is to complement the live agent experience with an artificial intelligence able to help users fulfil a task. In this paper, we discuss the challenges and limitations of industrial chatbot applications, with a particular focus on the “human-in-the-loop” aspect, whereby a cooperation between human and machine takes place in mutual interest. Furthermore, we analyse how the same aspect intervenes in other industrial natural language processing applications.
Structure and dynamics of molecular networks: A novel paradigm of drug discovery. A comprehensive review

Despite considerable progress in genome- and proteome-based high-throughput screening methods and in rational drug design, the increase in approved drugs in the past decade did not match the increase of drug development costs. Network description and analysis not only give a systems-level understanding of drug action and disease complexity, but can also help to improve the efficiency of drug design. We give a comprehensive assessment of the analytical tools of network topology and dynamics. The state-of-the-art use of chemical similarity, protein structure, protein-protein interaction, signaling, genetic interaction and metabolic networks in the discovery of drug targets is summarized. We propose that network targeting follows two basic strategies. The "central hit strategy" selectively targets central nodes/edges of the flexible networks of infectious agents or cancer cells to kill them. The "network influence strategy" works against other diseases, where an efficient reconfiguration of rigid networks needs to be achieved by targeting the neighbors of central nodes/edges. It is shown how network techniques can help in the identification of single-target, edgetic, multi-target and allo-network drug target candidates. We review the recent boom in network methods helping hit identification, lead selection optimizing drug efficacy, as well as minimizing side-effects and drug toxicity. Successful network-based drug development strategies are shown through the examples of infections, cancer, metabolic diseases, neurodegenerative diseases and aging. Summarizing >1200 references we suggest an optimized protocol of network-aided drug development, and provide a list of systems-level hallmarks of drug quality. Finally, we highlight network-related drug development trends helping to achieve these hallmarks by a cohesive, global approach.
A Tutorial on Hidden Markov Models and Selected Applications

Although initially introduced and studied in the late 1960s and early 1970s, statistical methods of Markov source or hidden Markov modeling have become increasingly popular in the last several years. There are two strong reasons why this has occurred. First the models are very rich in mathematical structure and hence can form the theoretical basis for use in a wide range of applications. Second the models, when applied properly, work very well in practice for several important applications. In this paper we attempt to carefully and methodically review the theoretical aspects of this type of statistical modeling and show how they have been applied to selected problems in machine recognition of speech.
Watching eyes on potential litter can reduce littering: evidence from two field experiments

Littering constitutes a major societal problem, and any simple intervention that reduces its prevalence would be widely beneficial. In previous research, we have found that displaying images of watching eyes in the environment makes people less likely to litter. Here, we investigate whether the watching eyes images can be transferred onto the potential items of litter themselves. In two field experiments on a university campus, we created an opportunity to litter by attaching leaflets that either did or did not feature an image of watching eyes to parked bicycles. In both experiments, the watching eyes leaflets were substantially less likely to be littered than control leaflets (odds ratios 0.22-0.32). We also found that people were less likely to litter when there other people in the immediate vicinity than when there were not (odds ratios 0.04-0.25) and, in one experiment but not the other, that eye leaflets only reduced littering when there no other people in the immediate vicinity. We suggest that designing cues of observation into packaging could be a simple but fruitful strategy for reducing littering.
Tuning of an optimal PID controller with iterative feedback tuning method for DC motor

Tuning of PID controller parameters is one of the usual tasks of the control engineers due to the wide applications of this class of controllers in industry. In this paper the Iterative Feedback Tuning (IFT) method is applied to tune the PID parameters. The main advantage of this method is that there is no need to the model of the system, so that is useful in many processes which there is no obvious model of the system. In many cases this feature can be so useful in tuning the controller parameters. The IFT is applied here to tune the PID parameters. Speed control of DC motor was employed to demonstrate the effectiveness of the method. The results is compared with other tuning methods and represented the good performance of the designed controller. As it is shown, the step response of the system controlled by PID tuned with IFT has more robustness and performs well.
Ship routing and scheduling with flexible cargo sizes

Here, we describe a real planning problem in the tramp shipping industry. A tramp shipping company may have a certain amount of contract cargoes that it is committed to carry, and tries to maximize the profit from optional cargoes. For real long-term contracts, the sizes of the cargoes are flexible. However, in previous research within tramp ship routing, the cargo quantities are regarded as fixed. We present an MP-model of the problem and a set partitioning approach to solve the multi-ship pickup and delivery problem with time windows and flexible cargo sizes. The columns are generated a priori and the most profitable ship schedule for each cargo set–ship combination is included in the set partitioning problem. We have tested the method on several real-life cases, and the results show the potential economical effects for the tramp shipping companies by utilizing flexible cargo sizes when generating the schedules. Journal of the Operational Research Society (2007) 58, 1167–1177. doi:10.1057/palgrave.jors.2602263 Published online 16 August 2006
Using Thought-Provoking Children's Questions to Drive Artificial Intelligence Research

We propose to use thought-provoking children's questions (TPCQs), namely Highlights BrainPlay questions, to drive artificial intelligence research. These questions are designed to stimulate thought and learning in children , and they can be used to do the same thing in AI systems. We introduce the TPCQ task, which consists of taking a TPCQ question as input and producing as output both (1) answers to the question and (2) learned generalizations. We discuss how BrainPlay questions stimulate learning. We analyze 244 BrainPlay questions, and we report statistics on question type, question class, answer cardinality, answer class, types of knowledge needed, and types of reasoning needed. We find that BrainPlay questions span many aspects of intelligence. We envision an AI system based on the society of mind (Minsky 1986; Minsky 2006) consisting of a multilevel architecture with diverse resources that run in parallel to jointly answer and learn from questions. Because the answers to BrainPlay questions and the generalizations learned from them are often highly open-ended, we suggest using human judges for evaluation.
Swarm Intelligence Algorithms for Data Clustering

Clustering aims at representing large datasets by a fewer number of prototypes or clusters. It brings simplicity in modeling data and thus plays a central role in the process of knowledge discovery and data mining. Data mining tasks, in these days, require fast and accurate partitioning of huge datasets, which may come with a variety of attributes or features. This, in turn, imposes severe computational requirements on the relevant clustering techniques. A family of bio-inspired algorithms, well-known as Swarm Intelligence (SI) has recently emerged that meets these requirements and has successfully been applied to a number of real world clustering problems. This chapter explores the role of SI in clustering different kinds of datasets. It finally describes a new SI technique for partitioning any dataset into an optimal number of groups through one run of optimization. Computer simulations undertaken in this research have also been provided to demonstrate the effectiveness of the proposed algorithm.
A survey on sentiment analysis methods and approach

Data Analytics is widely used in many industries and organization to make a better Business decision. By applying analytics to the structured and unstructured data the enterprises brings a great change in their way of planning and decision making. Sentiment analysis (or) opinion mining plays a significant role in our daily decision making process. These decisions may range from purchasing a product such as mobile phone to reviewing the movie to making investments — all the decisions will have a huge impact on the daily life. Sentiment Analysis is dealing with various issues such as Polarity Shift, accuracy related issues, Binary Classification problem and Data sparsity problem. However various methods were introduced for performing sentiment analysis, still that are not efficient in extracting the sentiment features from the given content of text. Naive Bayes, Support Vector Machine, Maximum Entropy are the machine learning algorithms used for sentiment analysis which has only a limited sentiment classification category ranging between positive and negative. Especially supervised and unsupervised algorithms have only limited accuracy in handling polarity shift and binary classification problem. Even though the advancement in sentiment Analysis technique there are various issues still to be noticed and make the analysis not accurately and efficiently. So this paper presents the survey on various sentiment Analysis methodologies and approaches in detailed. This will be helpful to earn clear knowledge about sentiment analysis methodologies. At last the comparison is made between various paper's approach and issues addressed along with the metrics used.