nils-herrmann/clean_scirepeval huggingface dataset:
Reasoning With Neural Tensor Networks for Knowledge Base Completion

Knowledge bases are an important resource for question answering and other tasks but often suffer from incompleteness and lack of ability to reason over their discrete entities and relationships. In this paper we introduce an expressive neural tensor network suitable for reasoning over relationships between two entities. Previous work represented entities as either discrete atomic units or with a single entity vector representation. We show that performance can be improved when entities are represented as an average of their constituting word vectors. This allows sharing of statistical strength between, for instance, facts involving the “Sumatran tiger” and “Bengal tiger.” Lastly, we demonstrate that all models improve when these word vectors are initialized with vectors learned from unsupervised large corpora. We assess the model by considering the problem of predicting additional true relations between entities given a subset of the knowledge base. Our model outperforms previous models and can classify unseen relationships in WordNet and FreeBase with an accuracy of 86.2% and 90.0%, respectively.
Unsupervised outlier detection in streaming data using weighted clustering

Outlier detection is a very important task in many fields like network intrusion detection, credit card fraud detection, stock market analysis, detecting outlying cases in medical data etc. Outlier detection in streaming data is very challenging because streaming data cannot be scanned multiple times and also new concepts may keep evolving in coming data over time. Irrelevant attributes can be termed as noisy attributes and such attributes further magnify the challenge of working with data streams. In this paper, we propose an unsupervised outlier detection scheme for streaming data. This scheme is based on clustering as clustering is an unsupervised data mining task and it does not require labeled data. In proposed scheme both density based and partitioning clustering method are combined to take advantage of both density based and distance based outlier detection. Proposed scheme also assigns weights to attributes depending upon their respective relevance in mining task and weights are adaptive in nature. Weighted attributes are helpful to reduce or remove the effect of noisy attributes. Keeping in view the challenges of streaming data, the proposed scheme is incremental and adaptive to concept evolution. Experimental results on synthetic and real world data sets show that our proposed approach outperforms other existing approach (CORM) in terms of outlier detection rate, false alarm rate, and increasing percentages of outliers.
Audit Log Management in MongoDB

In the past few years, web-based applications and their data management needs have changed dramatically. Relational databases are often being replaced by other viable alternatives, such as NoSQL databases, for reasons of scalability and heterogeneity. MongoDB, a NoSQL database, is an agile database built for scalability, performance and high availability. It can be deployed in single server environment and also on complex multi-site architectures. MongoDB provides high performance for read and write operations by leveraging in-memory computing. Although researchers have motivated the need for MongoDB, not much appears in the area of log management. Efficient log management techniques are needed for various reasons including security, accountability, and improving the performance of the system. Towards this end, we analyze the different logging methods offered by MongoDB and compare them to the NIST standard. Our analysis indicates that profiling and mongosniff are useful for log management and we present a simple model that combines the two techniques.
Panoptic Segmentation with a Joint Semantic and Instance Segmentation Network

We present a single network method for panoptic segmentation. This method combines the predictions from a jointly trained semantic and instance segmentation network using heuristics. Joint training is the first step towards an end-to-end panoptic segmentation network and is faster and more memory efficient than training and predicting with two networks, as done in previous work. The architecture consists of a ResNet-50 feature extractor shared by the semantic segmentation and instance segmentation branch. For instance segmentation, a Mask R-CNN type of architecture is used, while the semantic segmentation branch is augmented with a Pyramid Pooling Module. Results for this method are submitted to the COCO and Mapillary Joint Recognition Challenge 2018. Our approach achieves a PQ score of 17.6 on the Mapillary Vistas validation set and 27.2 on the COCO test-dev set.
Parallel online exact sum for Java8

Java8 introduced the notion of streams that is a new data structure and supports multi-core processors. When the sum method is called for a stream of floating-point numbers, the summation is calculated at high-speed by applying MapReduce, which distributes computations to cores. However, since floating-point calculation causes an error, simple adaptation of this method can not determine the result uniquely. Then, in this study, we develop a summation program that can be applied to a stream with MapReduce. Our method can calculate at high-speed with keeping correctly rounded.
A qualitative study of Ragnarök Online private servers: in-game sociological issues

In the last decade, online games have garnered much attention as more and more players gather on game servers. In parallel, communities of illegal private server players and administrators have spread and might host hundreds of thousands of players. To study the Korean online game Ragnarök Online, we conducted interviews to collect qualitative data on two private servers as well as on the official French server for the game. This paper discusses some of the reasons why Ragnarök Online private servers might attract players and how examining private servers' characteristics could help improve official game servers.
A High Speed Architecture for Galois/Counter Mode of Operation (GCM)

In this paper we present a fully pipelined high speed hardware architecture for Galois/Counter Mode of Operation (GCM) by analyzing the data dependencies in the GCM algorithm at the architecture level. We show that GCM encryption circuit and GCM authentication circuit have similar critical path delays resulting in an efficient pipeline structure. The proposed GCM architecture yields a throughput of 34 Gbps running at 271 MHz using a 0.18 μm CMOS standard cell library.
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis

When it comes to software analysis, several approaches exist from heuristic techniques to formal methods, which are helpful at solving different kinds ofproblems. Unfortunately very few initiative seek to aggregate this techniques in the same platform. BINSEC intend to fulfill this lack of binary analysis platform by allowing to perform modular analysis. This work focusses on BINSEC/SE, the new dynamic symbolic execution engine (DSE) implemented in BINSEC. We will highlight the novelties of the engine, especially in terms of interactions between concrete and symbolic execution or optimization of formula generation. Finally, two reverse engineering applications are shown in order to emphasize the tool effectiveness.
Separate neural systems value immediate and delayed monetary rewards.

When humans are offered the choice between rewards available at different points in time, the relative values of the options are discounted according to their expected delays until delivery. Using functional magnetic resonance imaging, we examined the neural correlates of time discounting while subjects made a series of choices between monetary reward options that varied by delay to delivery. We demonstrate that two separate systems are involved in such decisions. Parts of the limbic system associated with the midbrain dopamine system, including paralimbic cortex, are preferentially activated by decisions involving immediately available rewards. In contrast, regions of the lateral prefrontal cortex and posterior parietal cortex are engaged uniformly by intertemporal choices irrespective of delay. Furthermore, the relative engagement of the two systems is directly associated with subjects' choices, with greater relative fronto-parietal activity when subjects choose longer term options.
Application-aware prioritization mechanisms for on-chip networks

Network-on-Chips (NoCs) are likely to become a critical shared resource in future many-core processors. The challenge is to develop policies and mechanisms that enable multiple applications to efficiently and fairly share the network, to improve system performance. Existing local packet scheduling policies in the routers fail to fully achieve this goal, because they treat every packet equally, regardless of which application issued the packet.
 This paper proposes prioritization policies and architectural extensions to NoC routers that improve the overall application-level throughput, while ensuring fairness in the network. Our prioritization policies are application-aware, distinguishing applications based on the stall-time criticality of their packets. The idea is to divide processor execution time into phases, rank applications within a phase based on stall-time criticality, and have all routers in the network prioritize packets based on their applications' ranks. Our scheme also includes techniques that ensure starvation freedom and enable the enforcement of system-level application priorities.
 We evaluate the proposed prioritization policies on a 64-core CMP with an 8x8 mesh NoC, using a suite of 35 diverse applications. For a representative set of case studies, our proposed policy increases average system throughput by 25.6% over age-based arbitration and 18.4% over round-robin arbitration. Averaged over 96 randomly-generated multiprogrammed workload mixes, the proposed policy improves system throughput by 9.1% over the best existing prioritization policy, while also reducing application-level unfairness.
Rapid growing fibroadenoma in an adolescent.

We report a case of rapidly growing fibroadenoma.



A 13-year-old girl consulted the outpatient clinic regarding a left breast mass. The mass was diagnosed as fibroadenoma by clinical examinations, and the patient was carefully monitored. The mass enlarged rapidly with each menses and showed a 50% increase in volume four months later. Lumpectomy was performed. The tumor was histologically diagnosed as fibroadenoma organized type and many glandular epithelial cells had positive immunohistochemical staining for anti-estrogen receptor antibody in the nuclei.



The estrogen sensitivity of the tumor could account for the rapid growth.
Tachyon : Memory Throughput I / O for Cluster Computing Frameworks

As ever more big data computations start to be in-memory, I/O throughput dominates the running times of many workloads. For distributed storage, the read throughput can be improved using caching, however, the write throughput is limited by both disk and network bandwidth due to data replication for fault-tolerance. This paper proposes a new file system architecture to enable frameworks to both read and write reliably at memory speed, by avoiding synchronous data replication on writes.
Functional Specialization for Semantic and Phonological Processing in the Left Inferior Prefrontal Cortex

Neuroimaging and neuropsychological studies have implicated left inferior prefrontal cortex (LIPC) in both semantic and phonological processing. In this study, functional magnetic resonance imaging was used to examine whether separate LIPC regions participate in each of these types of processing. Performance of a semantic decision task resulted in extensive LIPC activation compared to a perceptual control task. Phonological processing of words and pseudowords in a syllable-counting task resulted in activation of the dorsal aspect of the left inferior frontal gyrus near the inferior frontal sulcus (BA 44/45) compared to a perceptual control task, with greater activation for nonwords compared to words. In a direct comparison of semantic and phonological tasks, semantic processing preferentially activated the ventral aspect of the left inferior frontal gyrus (BA 47/45). A review of the literature demonstrated a similar distinction between left prefrontal regions involved in semantic processing and phonological/lexical processing. The results suggest that a distinct region in the left inferior frontal cortex is involved in semantic processing, whereas other regions may subserve phonological processes engaged during both semantic and phonological tasks.
Robust Scale Estimation in Real-Time Monocular SFM for Autonomous Driving

Scale drift is a crucial challenge for monocular autonomous driving to emulate the performance of stereo. This paper presents a real-time monocular SFM system that corrects for scale drift using a novel cue combination framework for ground plane estimation, yielding accuracy comparable to stereo over long driving sequences. Our ground plane estimation uses multiple cues like sparse features, dense inter-frame stereo and (when applicable) object detection. A data-driven mechanism is proposed to learn models from training data that relate observation covariances for each cue to error behavior of its underlying variables. During testing, this allows per-frame adaptation of observation covariances based on relative confidences inferred from visual data. Our framework significantly boosts not only the accuracy of monocular self-localization, but also that of applications like object localization that rely on the ground plane. Experiments on the KITTI dataset demonstrate the accuracy of our ground plane estimation, monocular SFM and object localization relative to ground truth, with detailed comparisons to prior art.
Blogging as social activity, or, would you let 900 million people read your diary?

"Blogging" is a Web-based form of communication that is rapidly becoming mainstream. In this paper, we report the results of an ethnographic study of blogging, focusing on blogs written by individuals or small groups, with limited audiences. We discuss motivations for blogging, the quality of social interactivity that characterized the blogs we studied, and relationships to the blogger's audience. We consider the way bloggers related to the known audience of their personal social networks as well as the wider "blogosphere" of unknown readers. We then make design recommendations for blogging software based on these findings.
Psychophysiology of False Memories in a Deese-Roediger-McDermott Paradigm with Visual Scenes

Remembering something that has not in fact been experienced is commonly referred to as false memory. The Deese-Roediger-McDermott (DRM) paradigm is a well-elaborated approach to this phenomenon. This study attempts to investigate the peripheral physiology of false memories induced in a visual DRM paradigm. The main research question is whether false recognition is different from true recognition in terms of accompanying physiological responses.Sixty subjects participated in the experiment, which included a study phase with visual scenes each showing a group of interrelated items in social contexts. Subjects were divided into an experimental group undergoing a classical DRM design and a control group without DRM manipulation. The control group was implemented in order to statistically control for possible biases produced by memorability differences between stimulus types. After a short retention interval, a pictorial recognition phase was conducted in the manner of a Concealed Information Test. Simultaneous recordings of electrodermal activity, respiration line length, phasic heart rate, and finger pulse waveform length were used. Results yielded a significant Group by Item Type interaction, showing that true recognition is accompanied by greater electrodermal activity than false recognition.Results are discussed in the light of Sokolov's Orienting Reflex, the Preliminary Process Theory and the Concealed Information Test. Implications and restrictions of the introduced design features are critically discussed. This study demonstrates the applicability of measures of peripheral physiology to the field of false memory research.
Why Neurons Have Thousands of Synapses, a Theory of Sequence Memory in Neocortex

Pyramidal neurons represent the majority of excitatory neurons in the neocortex. Each pyramidal neuron receives input from thousands of excitatory synapses that are segregated onto dendritic branches. The dendrites themselves are segregated into apical, basal, and proximal integration zones, which have different properties. It is a mystery how pyramidal neurons integrate the input from thousands of synapses, what role the different dendrites play in this integration, and what kind of network behavior this enables in cortical tissue. It has been previously proposed that non-linear properties of dendrites enable cortical neurons to recognize multiple independent patterns. In this paper we extend this idea in multiple ways. First we show that a neuron with several thousand synapses segregated on active dendrites can recognize hundreds of independent patterns of cellular activity even in the presence of large amounts of noise and pattern variation. We then propose a neuron model where patterns detected on proximal dendrites lead to action potentials, defining the classic receptive field of the neuron, and patterns detected on basal and apical dendrites act as predictions by slightly depolarizing the neuron without generating an action potential. By this mechanism, a neuron can predict its activation in hundreds of independent contexts. We then present a network model based on neurons with these properties that learns time-based sequences. The network relies on fast local inhibition to preferentially activate neurons that are slightly depolarized. Through simulation we show that the network scales well and operates robustly over a wide range of parameters as long as the network uses a sparse distributed code of cellular activations. We contrast the properties of the new network model with several other neural network models to illustrate the relative capabilities of each. We conclude that pyramidal neurons with thousands of synapses, active dendrites, and multiple integration zones create a robust and powerful sequence memory. Given the prevalence and similarity of excitatory neurons throughout the neocortex and the importance of sequence memory in inference and behavior, we propose that this form of sequence memory may be a universal property of neocortical tissue.
Fast and Accurate Template Matching Using Pixel Rearrangement on the GPU

A GPU (Graphics Processing Unit) is a specialized processor for graphics processing. GPUs have the ability to perform high-speed parallel processing using its many processing cores. To utilize the powerful computing ability, GPUs are widely used for general purpose processing. The main contribution of this paper is to show a new template matching algorithm using pixel rearrangement. Template Matching is a technique for finding small parts of an image which match a template image. The feature of our proposed algorithm is that using pixel rearrangement, multiple low-resolution images are generated and template matching for the low-resolution images is performed to reduce the computing time. Also, we implemented our algorithm on a GPU system. The experimental results show that, for an input image with size of 4096 $\times$ 4096 and a template image with size of 256 $\times$ 256, our implementation can achieve a speedup factor of approximately 78 times over the conventional sequential implementation.
Profile hidden Markov models

The recent literature on profile hidden Markov model (profile HMM) methods and software is reviewed. Profile HMMs turn a multiple sequence alignment into a position-specific scoring system suitable for searching databases for remotely homologous sequences. Profile HMM analyses complement standard pairwise comparison methods for large-scale sequence analysis. Several software implementations and two large libraries of profile HMMs of common protein domains are available. HMM methods performed comparably to threading methods in the CASP2 structure prediction exercise.
Learning a discriminative dictionary for sparse coding via label consistent K-SVD

A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also associate label information with each dictionary item (columns of the dictionary matrix) to enforce discriminability in sparse codes during the dictionary learning process. More specifically, we introduce a new label consistent constraint called ‘discriminative sparse-code error’ and combine it with the reconstruction error and the classification error to form a unified objective function. The optimal solution is efficiently obtained using the K-SVD algorithm. Our algorithm learns a single over-complete dictionary and an optimal linear classifier jointly. It yields dictionaries so that feature points with the same class labels have similar sparse codes. Experimental results demonstrate that our algorithm outperforms many recently proposed sparse coding techniques for face and object category recognition under the same learning conditions.
Online Topic-aware Influence Maximization Queries

Influence maximization is the key algorithmic problem behind viral marketing: it requires to identify a set of influential users in a social network, who, when convinced to adopt a product, shall influence other users in the network, leading to a large number of adoptions. Although real world users evidently have di↵erent degrees of interest and authoritativeness on di↵erent topics, the bulk of the literature on influence maximization is topic-blind, in the sense that it treats all items as they were the same. In this paper we study Topic-aware Influence Maximization (TIM) queries: given a directed social graph, where the arcs are associated with a topic-dependent user-to-user social influence strength, and given a budget k, the problem requires to find a set of k users (named seed set) that we shall target in a viral marketing campaign for a given new item (described as a distribution over topics) in order to maximize its adoption. Our goal is to answer such queries in milliseconds, thus enabling online social influence analytics, what-if simulation, and marketing decision making. The main challenge here is the enormous number of potential queries: any possible distribution over the topic space (i.e., any possible item) induces a di↵erent probabilistic graph, and thus a di↵erent instance of the standard influence maximization problem, for which e ciency and scalability are still unsolved problems. Given these computational challenges, we propose to build an index over pre-computed solutions for a limited number of possible queries. Our proposal, INFLEX, employs a treebased index for similarity search with Bregman divergences, to e ciently retrieve a good-enough set of neighbor points for the query item. Then it performs rank aggregation on their seed sets to produce the final answer to the query. Experimental results on real data show that INFLEX can provide in few milliseconds a solution very similar (Kendall⌧ distance < 0.1) to the one produced by the best known o✏ine computation (which usually takes several days).  2014, Athens, Greece: ISBN 978-3-89318065-3, on OpenProceedings.org. Distribution of this paper is permitted under the terms of the Creative Commons license CC-by-nc-nd 4.0