nils-herrmann/clean_scirepeval huggingface dataset:
Two cortical systems for memory-guided behaviour

Although the perirhinal cortex (PRC), parahippocampal cortex (PHC) and retrosplenial cortex (RSC) have an essential role in memory, the precise functions of these areas are poorly understood. Here, we review the anatomical and functional characteristics of these areas based on studies in humans, monkeys and rats. Our Review suggests that the PRC and PHC–RSC are core components of two separate large-scale cortical networks that are dissociable by neuroanatomy, susceptibility to disease and function. These networks not only support different types of memory but also appear to support different aspects of cognition.
Reinforcement-learning optimal control for type-1 diabetes

This paper proposes a reinforcement-learning based algorithm for optimal control of blood glucose in patients with type-1 diabetes. Specifically, the algorithm aims to suggest an optimal insulin injection policy. Its performance was assessed using simulations on a combination of the minimum model and part of the Hovorka model. The results show that the proposed methodology successfully regulates and significantly reduces the fluctuation of the blood glucose in both fasting and post-meal scenarios. A comparison between the proposed algorithm and an existing reinforcement learning algorithm also shows the superiority of our method and provide insights on how insulin doses should be chosen.
Magnetic resonance imaging in pediatric appendicitis: a systematic review

Magnetic resonance imaging for the evaluation of appendicitis in children has rapidly increased recently. This change has been primarily driven by the desire to avoid CT radiation dose. This meta-analysis reviews the diagnostic performance of MRI for pediatric appendicitis and discusses current knowledge of cost-effectiveness. We used a conservative Haldane correction statistical method and found pooled diagnostic parameters including a sensitivity of 96.5% (95% confidence interval [CI]: 94.3–97.8%), specificity of 96.1% (95% CI: 93.5–97.7%), positive predictive value of 92.0% (95% CI: 89.3–94.0%) and negative predictive value of 98.3% (95% CI: 97.3–99.0%), based on 11 studies. Assessment of patient outcomes associated with MRI use at two institutions indicates that time to antibiotics was 4.7 h and 8.2 h, time to appendectomy was 9.1 h and 13.9 h, and negative appendectomy rate was 3.1% and 1.4%, respectively. Alternative diagnoses were present in ~20% of cases, most commonly adnexal cysts and enteritis/colitis. Regarding technique, half-acquisition single-shot fast spin-echo (SSFSE) pulse sequences are crucial. While gadolinium-enhanced T1-weighted pulse sequences might be helpful, any benefit beyond non-contrast MRI has not been confirmed. Balanced steady-state free precession (SSFP) sequences are generally noncontributory. Protocols do not need to exceed five sequences; four-sequence protocols are commonly utilized. Sedation generally is not indicated; patients younger than 5 years might be attempted based on the child’s ability to cooperate. A comprehensive pediatric cost-effectiveness analysis that includes both direct and indirect costs is needed.
Practice and Forgetting Effects on Vocabulary Memory: An Activation-Based Model of the Spacing Effect

An experiment was performed to investigate the effects of practice and spacing on retention of Japanese-English vocabulary paired associates. The relative benefit of spacing increased with increased practice and with longer retention intervals. Data were fitted with an activation-based memory model, which proposes that each time an item is practiced it receives an increment of strength but that these increments decay as a power function of time. The rate of decay for each presentation depended on the activation at the time of the presentation. This mechanism limits long-term benefits from further practice at higher levels of activation and produces the spacing effect and its observed interactions with practice and retention interval. The model was compared with another model of the spacing effect (Raaijmakers, 2003) and was fit to some results from the literature on spacing and memory.
Real-time Empirical Mode Decomposition for EEG signal enhancement

Electroencephalography (EEG) recordings are used for brain research. However, in most cases, the recordings not only contain brain waves, but also artifacts of physiological or technical origins. A recent approach used for signal enhancement is Empirical Mode Decomposition (EMD), an adaptive data-driven technique which decomposes non-stationary data into so-called Intrinsic Mode Functions (IMFs). Once the IMFs are obtained, they can be used for denoising and detrending purposes. This paper presents a real-time implementation of an EMD-based signal enhancement scheme. The proposed implementation is used for removing noise, for suppressing muscle artifacts, and for detrending EEG signals in an automatic manner and in real-time. The proposed algorithm is demonstrated by application to a simulated and a real EEG data set from an epilepsy patient. Moreover, by visual inspection and in a quantitative manner, it is shown that after the EMD in real-time, the EEG signals are enhanced.
Multiresolution Mean Shift Clustering Algorithm for Shape Interpolation

In this paper, we solve the problem of 3D shape interpolation with significant pose variation. For an ideal 3D shape interpolation, especially the articulated model, the shape should follow the movement of the underlying articulated structure and be transformed in a way that is as rigid as possible. Given input shapes with compatible connectivity, we propose a novel multiresolution mean shift (MMS) clustering algorithm to automatically extract their near-rigid components. Then, by building the hierarchical relationship among extracted components, we compute a common articulated structure for these input shapes. With the aid of this articulated structure, we solve the shape interpolation by combining 1) a global pose interpolation of near-rigid components from the source shape to the target shape with 2) a local gradient field interpolation for each pair of components, followed by solving a Poisson equation in order to reconstruct an interpolated shape. As a result, an aesthetically pleasing shape interpolation can be generated, with even the poses of shapes varying significantly. In contrast to a recent state-of-the-art work (Kilian et al., 2007), the proposed approach can achieve comparable or even better results and have better computational efficiency as well.
Efficient k -Anonymization Using Clustering Techniques

k-anonymization techniques are a key component of any comprehensive solution to data privacy and have been the focus of intense research in the last few years. An important requirement for such techniques is to ensure anonymization of data while at the same time minimizing the information loss resulting from data modifications such as generalization and suppression. Current solutions, however, suffer from one or more of the following limitations: reliance on pre-defined generalization hierarchies; generation of anonymized data with high information loss and with high classification errors; and the inference channel arising from lack of diversity in the sensitive information. In this paper we propose an approach that addresses these limitations. Our approach uses the idea of clustering to minimize information loss and thus ensure good data quality. The key observation here is that data records that are naturally close with respect to each other should be part of the same equivalence class. Current clustering techniques, however, are not directly applicable in this context because they do not consider the requirement that each cluster should contain at least k records. We thus formulate a specific clustering problem, referred to as k-member clustering problem. We prove that this problem is NP-hard and present a greedy algorithm, the complexity of which is in O(n). As part of our approach we develop a suitable metric to estimate the information loss introduced by generalizations, which works for both numeric and categorical data. We also present extensions to our proposed algorithm that minimize classification errors in the anonymized data and eliminate the inference channel arising from lack of diversity in the sensitive attributes. We experimentally compare our algorithm with two recently proposed algorithms. The experiments show that our algorithm outperforms the other two algorithms with respect to information loss, classification errors, and diversity.
Predicting Player Churn in Multiplayer Games using Goal-Weighted Empowerment

The extent to which players feel compelled to play a game is a primary factor in determining that game’s success. Using ideas from self-determination theory, we propose that the drive to play games is related to player’s ability to exercise their mastery drive. In self-determination theory, increasing one’s control is intrinsically rewarding, however it is difficult to instantiate this theory to make concrete predictions of when a player will quit a game early in favor of another activity. The problem of predicting within-game churn events involves modeling and predicting a player’s motivational state to remain in a game. We combine new motivation theory ideas with machine learning methods to develop a computational model that postulates that player’s satisfaction is directly related to their perceived locus of control, extrinsic vs. intrinsic, and hypothesize a set of measurable signals that mediate a player’s locus of control. An agent will continue goal pursuit within the game based on its “empowerment”, which is essentially its ability to predict the future based on its own actions. This indicator of locus of control accounts for both the feasibility of the goal and whether expected progress toward a selected goal is being achieved. A player’s behavior can be used to estimate their empowerment by correlating their continuation of goal pursuit with measures of their expectations of progress and goal-achievability. We apply these concepts and build a model to predict player when players will quit a game early for the multiplayer game, Dota2.
A Comparative Study of Psychosocial Interventions for Internet Gaming Disorder Among Adolescents Aged 13–17 Years

The present study is a quasi-experimental, prospective study of interventions for internet gaming disorder (IGD). One hundred four parents and their adolescent children were enrolled and allocated to one of the four treatment groups; 7-day Siriraj Therapeutic Residential Camp (S-TRC) alone, 8-week Parent Management Training for Game Addiction (PMT-G) alone, combined S-TRC and PMT-G, and basic psychoeducation (control). The severity of IGD was measured by the Game Addiction Screening Test (GAST). The mean difference among groups in GAST scores was statistically significant, with P values of < 0.001, 0.002, and 0.005 at 1, 3, and 6 months post-intervention, respectively. All groups showed improvement over the control group. The percentage of adolescents who remained in the addicted or probably addicted groups was less than 50% in the S-TRC, PMT-G, and combined groups. In conclusion, both S-TRC and PMT-G were effective psychosocial interventions for IGD and were superior to basic psychoeducation alone.
Multi-view 3D reconstruction in underwater environments: Evaluation and benchmark

Mapping of underwater environments is a critical task for a range of activities from monitoring coral reef habitats to surveying submerged archaeological sites. In recent years, optical reconstruction methods developed for terrestrial (in air) applications have increasingly been applied to the underwater environment by the marine science community. However, assumptions such as the brightness constancy constraint (BCC) and traditional camera pinhole models, which hold in air, do not apply in the underwater environment. There is a lack of literature about how the violation of these assumptions affects the accuracy of the reconstruction. The main contributions of this paper is to develop a quantitative evaluation of computer vision-based 3D reconstruction methods applied to the underwater domain. Comparisons are presented between low- and high-cost camera systems to quantify the tradeoff between equipment cost and performance.
On channel estimation and optimal training design for amplify and forward relay networks

In this paper, we provide a complete study on the training based channel estimation issues for relay networks that employ the amplify-and-forward (AF) transmission scheme. We first point out that separately estimating the channel from source to relay and relay to destination suffers from many drawbacks. Then we provide a new estimation scheme that directly estimates the overall channels from the source to the destination. The proposed channel estimation well serves the AF based space time coding (STC) that was recently developed. There exists many differences between the proposed channel estimation and that in the traditional single input single out (SISO) and multiple input single output (MISO) systems. For example, a relay must linearly precode its received training sequence by a sophisticatedly designed matrix in order to minimize the channel estimation error. Besides, each relay node is individually constrained by a different power requirement because of the non-cooperation among all relay nodes. We study both the linear least-square (LS) estimator and the minimum mean-square-error (MMSE) estimator. The corresponding optimal training sequences, as well as the optimal preceding matrices are derived from an efficient convex optimization process.
Formation of e-satisfaction and repurchase intention: Moderating roles of computer self-efficacy and computer anxiety

The exploration of online customer satisfaction (called e-satisfaction hereafter) and repurchase becomes increasingly important in e-commerce. Yet, the process of e-satisfaction and repurchase formation and the context under which this process may vary have not been investigated rigorously. In order to fill this knowledge gap, this paper attempts to develop a conceptual model to decipher how e-satisfaction is formed. Furthermore, it investigates how computer-related individual differences such as computer self-efficacy and computer anxiety moderate this formation. The analysis results from a survey of 274 online buyers confirm that our antecedents play key roles in forming e-satisfaction and repurchase and the proposed moderators are important.
Neural Probabilistic Model for Non-projective MST Parsing

In this paper, we propose a probabilistic parsing model that defines a proper conditional probability distribution over nonprojective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTMCNNs, which automatically benefits from both wordand character-level representations, by using a combination of bidirectional LSTMs and CNNs. On top of the neural network, we introduce a probabilistic structured layer, defining a conditional log-linear model over nonprojective trees. By exploiting Kirchhoff’s Matrix-Tree Theorem (Tutte, 1984), the partition functions and marginals can be computed efficiently, leading to a straightforward end-to-end model training procedure via back-propagation. We evaluate our model on 17 different datasets, across 14 different languages. Our parser achieves state-of-the-art parsing performance on nine datasets.
Pay Attention to the Ending: Strong Neural Baselines for the ROC Story Cloze Task

We consider the ROC story cloze task (Mostafazadeh et al., 2016) and present several findings. We develop a model that uses hierarchical recurrent networks with attention to encode the sentences in the story and score candidate endings. By discarding the large training set and only training on the validation set, we achieve an accuracy of 74.7%. Even when we discard the story plots (sentences before the ending) and only train to choose the better of two endings, we can still reach 72.5%. We then analyze this “ending-only” task setting. We estimate human accuracy to be 78% and find several types of clues that lead to this high accuracy, including those related to sentiment, negation, and general ending likelihood regardless of the story context.
A Compact Highly Reconfigurable CMOS MMIC Directional Coupler

This paper presents a tunable CMOS directional coupler that utilizes lumped-element L-C sections. The lumped-element approach used to build the directional coupler makes it possible to integrate the coupler onto a single monolithic microwave integrated circuit (MMIC), as it occupies a small area compared to printed designs. The directional coupler uses varactors and tunable active inductors (TAIs) to synthesize the series and shunt reactances, respectively, which allows extensive electronic control over the coupling coefficient, while insuring a low return loss and a very high isolation. Furthermore, using varactors and TAIs allows the directional coupler to be reconfigured for operation over a wide range of frequencies. Moreover, the symmetric configuration of the coupler allows it to switch from forward to backward operation by simply exchanging the bias voltages applied across the series varactors. The MMIC coupler was fabricated in a standard 0.13-mum CMOS process and operates from a 1.5-V supply. The circuit occupies 730 mum times 600 mum, and is capable of achieving tunable coupling coefficients from 1.4 to 7.1 dB, while maintaining an isolation higher than 41 dB. The MMIC coupler is also capable of operating at any center frequency over the 2.1-3.1-GHz frequency range with higher than 40-dB isolation. The coupler achieves a -4.1-dBm 1-dB compression point while operating from a 1.5-V supply.
SumeCzech: Large Czech News-Based Summarization Dataset

Document summarization is a well-studied NLP task. With the emergence of artificial neural network models, the summarization performance is increasing, as are the requirements on training data. However, only a few datasets are available for Czech, none of them particularly large. Additionally, summarization has been evaluated predominantly on English, with the commonly used ROUGE metric being English-specific. In this paper, we try to address both issues. We present SumeCzech, a Czech news-based summarization dataset. It contains more than a million documents, each consisting of a headline, a several sentences long abstract and a full text. The dataset can be downloaded using the provided scripts available at http://hdl.handle.net/11234/1-2615. We evaluate several summarization baselines on the dataset, including a strong abstractive approach based on Transformer neural network architecture. The evaluation is performed using a language-agnostic variant of ROUGE.
Low-Power and Area-Efficient Carry Select Adder

Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. From the structure of the CSLA, it is clear that there is scope for reducing the area and power consumption in the CSLA. This work uses a simple and efficient gate-level modification to significantly reduce the area and power of the CSLA. Based on this modification 8-, 16-, 32-, and 64-b square-root CSLA (SQRT CSLA) architecture have been developed and compared with the regular SQRT CSLA architecture. The proposed design has reduced area and power as compared with the regular SQRT CSLA with only a slight increase in the delay. This work evaluates the performance of the proposed designs in terms of delay, area, power, and their products by hand with logical effort and through custom design and layout in 0.18-μm CMOS process technology. The results analysis shows that the proposed CSLA structure is better than the regular SQRT CSLA.
Visual cues can modulate integration and segregation of objects in auditory scene analysis

The task of assigning concurrent sounds to different auditory objects is known to depend on temporal and spectral cues. When tones of high and low frequencies are presented in alternation, they can be perceived as a single, integrated melody, or as two parallel, segregated melodic lines, according to the presentation rate and frequency distance between the sounds. At an intermediate distance, in the 'ambiguous' range, both percepts are possible. We conducted an electrophysiological experiment to determine whether an ambiguous sound organization could be modulated toward an integrated or segregated percept by the synchronous presentation of visual cues. Two sets of sounds (one high frequency and one low frequency) were interleaved. To promote integration or segregation, visual stimuli were synchronized to either the within-set frequency pattern or to the across-set intensity pattern. Elicitation of the mismatch negativity (MMN) component of event-related brain potentials was used to index the segregated organization, when no task was performed with the sounds. MMN was elicited only when the visual pattern promoted the segregation of the sounds. The results demonstrate cross-modal effects on auditory object perception in that sound ambiguity was resolved by synchronous presentation of visual stimuli, which promoted either an integrated or segregated perception of the sounds.
Categorical Data Clustering using Frequency and Tf-Idf based Cosine Similarity

Clustering is the process of grouping a set of physical objects into classes of similar object. Objects in real world consist of both numerical and categorical data. Categorical data are not analyzed as numerical data due to the lack of inherit ordering. This paper describes Frequency and Tf-Idf Based Categorical Data Clustering (FTCDC) technique based on cosine similarity measure. The FTCDC system consists of four modules, such as data pre-processing, similarity matrix generation, cluster formation and validation. The System architecture of FTCDC is explained and its performance is examined using a simple example scenario. The performance on real world data is measured using accuracy and error rate. The performance of the system much relay on the similarity threshold selected for the clustering process.
Collaborative Filtering with Implicit Feedbacks by Discounting Positive Feedbacks

Recommender Systems are indispensable to provide personalized services on the Web. Recommending items which match a user's preference has been researched for a long time, and there exist a lot of useful approaches. Especially, Collaborative Filtering, which gives recommendation based on users' feedbacks to items, is considered useful. Feedbacks are categorized into explicit feedbacks and implicit feedbacks. In this paper, Collaborative Filtering with implicit feedbacks is addressed. Explicit feedbacks are feedbacks provided by users intentionally and represent users' preferences for items explicitly. For example, in Netflix, users can rate movies on a scale of 1-5, and, based on these ratings, users can receive movie recommendation. On the other hand, implicit feedbacks are collected by the system automatically. In Amazon.com, products that users buy and click are used for recommendation. While Collaborative Filtering with explicit feedbacks has been a central topic for a long time, implicit feedbacks have become a more and more important research topic recently because these are easier to obtain and more abundant than explicit feedbacks. However, implicit feedbacks are often noisy. They often contain feedbacks which do not represent users' real preferences for items. Our approach addresses to this noise problem. We propose three discounting methods for observed values in implicit feedbacks. The key idea is that there is hidden uncertainty for each observed feedback, and effects by observed feedbacks of much uncertainty are discounted. The three discounting methods do not need additional information besides ordinary user-item feedbacks pairs and timestamps. Experiments with huge real-world datasets confirm that all of the three methods contribute to improving the performance. Moreover, our discounting methods can easily be combined with existing methods and improve the recommendation accuracy of existing models.