nils-herrmann/clean_scirepeval huggingface dataset:
PRET DRAM controller: Bank privatization for predictability and temporal isolation

Hard real-time embedded systems employ high-capacity memories such as Dynamic RAMs (DRAMs) to cope with increasing data and code sizes of modern designs. However, memory controller design has so far largely focused on improving average-case performance. As a consequence, the latency of memory accesses is unpredictable, which complicates the worst-case execution time analysis necessary for hard real-time embedded systems.
 Our work introduces a novel DRAM controller design that is predictable and that significantly reduces worst-case access latencies. Instead of viewing the DRAM device as one resource that can only be shared as a whole, our approach views it as multiple resources that can be shared between one or more clients individually. We partition the physical address space following the internal structure of the DRAM device, i.e., its ranks and banks, and interleave ac- cesses to the blocks of this partition. This eliminates contention for shared resources within the device, making accesses temporally predictable and temporally isolated. This paper describes our DRAM controller design and its integration with a precision-timed (PRET) architecture called PTARM. We present analytical bounds on the latency and throughput of the proposed controller, and confirm these via simulation.
Dead-Time Elimination of PWM-Controlled Inverter/Converter Without Separate Power Sources for Current Polarity Detection Circuit

This paper will present a dead-time elimination scheme for a pulsewidth-modulation (PWM)-controlled inverter/converter. The presented dead-time elimination scheme does not require separated power supplies for freewheeling-current detection of high- and low-side power devices. The presented scheme includes the freewheeling-current polarity detection circuit and the PWM control generator without dead time. It will be shown that the presented scheme eliminates the dead time of PWM control for inverter/converter and therefore dramatically improves output voltage loss and current distortion. Experimental results derived from a field-programmable-gate-array-based PWM-controlled inverter are shown to demonstrate the effectiveness.
Abnormal event detection using spatio-temporal feature and nonnegative locality-constrained linear coding

In this paper, an approach using the spatio-temporal feature and nonnegative locality-constrained linear coding (NLLC) is proposed to detect abnormal events in videos. This approach utilizes position-based spatio-temporal descriptors as the low-level representations of a video clip. Each descriptor consists of the position information of a space-time interest point and an appearance feature vector. To obtain the high-level video representations, the nonnegative locality-constrained linear coding is adopted to encode each spatio-temporal descriptor. Then, the max pooling integrates all NLLC codes of a video clip to produce a feature vector. Finally, the support vector machine (SVM) is employed to classify the feature vector as abnormal or normal. Experimental results on two datasets have demonstrated the promising performance of the proposed approach in the detection of both global and local abnormal events.
Multi-Task Label Embedding for Text Classification

Multi-task learning in text classification leverages implicit correlations among related tasks to extract common features and yield performance gains. However, most previous works treat labels of each task as independent and meaningless onehot vectors, which cause a loss of potential information and makes it difficult for these models to jointly learn three or more tasks. In this paper, we propose Multi-Task Label Embedding to convert labels in text classification into semantic vectors, thereby turning the original tasks into vector matching tasks. We implement unsupervised, supervised and semisupervised models of Multi-Task Label Embedding, all utilizing semantic correlations among tasks and making it particularly convenient to scale and transfer as more tasks are involved. Extensive experiments on five benchmark datasets for text classification show that our models can effectively improve performances of related tasks with semantic representations of labels and additional information from each other.
Segmentation quality evaluation based on multi-scale convolutional neural networks

Segmentation quality evaluation is an important task in image segmentation. The existing evaluation methods formulate segmentation quality as regression model, and recent Convolutional Neural Network (CNN) based evaluation methods show superior performance. However, designing efficient CNN-based segmentation evaluation model is still under exploited. In this paper, we propose two types of CNN structures such as double-net and multi-scale network for segmentation quality evaluation. We observe that learning the local and global information and considering multi-scale image are useful for segmentation quality evaluation. To train and verify the proposed networks, we construct a novel objective segmentation quality evaluation dataset with large amount of data by combining several proposal generation methods. The experimental results demonstrate that the proposed method obtains larger Linear Correlation Coefficient (LCC) value than several state-of-art segmentation quality evaluation methods.
Argument Mining: A Machine Learning Perspective

Argument mining has recently become a hot topic, attracting the interests of several and diverse research communities, ranging from artificial intelligence, to computational linguistics, natural language processing, social and philosophical sciences. In this paper, we attempt to describe the problems and challenges of argument mining from a machine learning angle. In particular, we advocate that machine learning techniques so far have been under-exploited, and that a more proper standardization of the problem, also with regards to the underlying argument model, could provide a crucial element to develop better systems.
Simultaneous video defogging and stereo reconstruction

We present a method to jointly estimate scene depth and recover the clear latent image from a foggy video sequence. In our formulation, the depth cues from stereo matching and fog information reinforce each other, and produce superior results than conventional stereo or defogging algorithms. We first improve the photo-consistency term to explicitly model the appearance change due to the scattering effects. The prior matting Laplacian constraint on fog transmission imposes a detail-preserving smoothness constraint on the scene depth. We further enforce the ordering consistency between scene depth and fog transmission at neighboring points. These novel constraints are formulated together in an MRF framework, which is optimized iteratively by introducing auxiliary variables. The experiment results on real videos demonstrate the strength of our method.
Social translucence: an approach to designing systems that support social processes

We are interested in desiging systems that support communication and collaboration among large groups of people over computing networks. We begin by asking what properties of the physical world support graceful human-human communication in face-to-face situations, and argue that it is possible to design digital systems that support coherent behavior by making participants and their activites visible to one another. We call such systems “socially translucent systems” and suggest that they have three characteristics—visbility, awareness, and accountability—which enable people to draw upon their experience and expertise to structure their interactions with one another. To motivate and focus our ideas we develop a vision of knowledge communities, conversationally based systems that support the creation, management and reuse of knowledge in a social context. We describe our experience in designing and deploying one layer of functionality for knowledge communities, embodied in a working system called “Barbie” and discuss research issues raised by a socially translucent approach to design.
Multi-Cell MIMO Cooperative Networks: A New Look at Interference

This paper presents an overview of the theory and currently known techniques for multi-cell MIMO (multiple input multiple output) cooperation in wireless networks. In dense networks where interference emerges as the key capacity-limiting factor, multi-cell cooperation can dramatically improve the system performance. Remarkably, such techniques literally exploit inter-cell interference by allowing the user data to be jointly processed by several interfering base stations, thus mimicking the benefits of a large virtual MIMO array. Multi-cell MIMO cooperation concepts are examined from different perspectives, including an examination of the fundamental information-theoretic limits, a review of the coding and signal processing algorithmic developments, and, going beyond that, consideration of very practical issues related to scalability and system-level integration. A few promising and quite fundamental research avenues are also suggested.
Broken Promises : An Experiment

We test whether promises per se are effective in enhancing cooperative behavior in a form of trust game. In a new treatment, rather than permitting free-form messages, we instead allow only a bare promise-only message to be sent (or not). We find that bare promises are much less effective in achieving good social outcomes than free-form messages; in fact, bare promise-only messages lead to behavior that is much the same as when no messages are feasible. Our design also permits us to test the predictions of guilt aversion against the predictions of lying aversion. Our experimental results provide evidence that mainly supports the guilt-aversion predictions, but we also find some support for the presence of lying aversion.
Preservation of nostril morphology in nasal base reduction

Asian patients often desire reduction of the base and alar lobules of the Asian mesorrhine nose. Sill excision is commonly used, but may result in an angular or notched nostril rim. We developed an internal method of alar base reduction involving triangle flaps for sill resection. This method avoids alar rim notching and teardrop deformity. Cinching sutures and double-layer closure avoid tension on the wound. We categorized the results in 50 patients (4 men, 46 women) who underwent surgery between November 2012 and August 2015 and who could be followed up for more than 3 months. The mean age of the subjects was 26.3 years and the mean follow-up period was 8.9 months. Forty patients underwent base reduction with the internal method, while ten with alar flare were treated with additional external resection. The mean reduction of the nostril sill width was 4.8 mm for both methods. In the subjects receiving flare resection, the mean reduction of the lateral alar width was 4.4 mm. There was no notching at the suture site. Complications included a short scar running obliquely under the sill in 13 patients and a trap door deformity in one patient. Nasal base reduction is widely performed, but subject to outcomes with abnormal nostril contour. We used triangle flaps to narrow the sill, and cinching sutures to prevent tension on the wound. Our methods prevent nostril notching and/or teardrop deformity. Scarring can occur, but can be reduced using cinching sutures for wound relaxation. This journal requires that authors assign a level of evidence to each article. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors www.springer.com/00266.
Adaptative combination rule and proportional conflict redistribution rule for information fusion

This paper presents two new promising combination rules for the fusion of uncertain and potentially highl y conflicting sources of evidences in the theory of belief func tions established first in Dempster-Shafer Theory (DST) and then recently extended in Dezert-Smarandache Theory (DSmT). Our work is to provide here new issues to palliate the well-known limitations of Dempster’s rule and to work beyond its limits of applicability. Since the famous Zadeh’ s criticism of Dempster’s rule in 1979, many researchers have proposed new interesting alternative rules of combination to palliate the weakness of Dempster’s rule in order to provide acceptable results specially in highly conflicting situati ons. In this work, we present two new combination rules: the class of Adaptive Combination Rules (ACR) and a new efficient Proportional Conflict Redistribution (PCR) rule. Bot h rules allow to deal with highly conflicting sources for stati c and dynamic fusion applications. We present some interesting properties for ACR and PCR rules and discuss some simulation results obtained with both rules for Zadeh’s pro blem and for a target identification problem.
ITS1 versus ITS2 as DNA metabarcodes for fungi.

The nuclear ribosomal Internal Transcribed Spacer ITS region is widely used as a DNA metabarcoding marker to characterize the diversity and composition of fungal communities. In amplicon pyrosequencing studies of fungal diversity, one of the spacers ITS1 or ITS2 of the ITS region is normally used. In this methodological study we evaluate the usability of ITS1 vs. ITS2 as a DNA metabarcoding marker for fungi. We analyse three data sets: two comprising ITS1 and ITS2 sequences of known taxonomic affiliations and a third comprising ITS1 and ITS2 environmental amplicon pyrosequencing data. Clustering analyses of sequences with known taxonomy using the bioinformatics pipeline ClustEx revealed that a 97% similarity cut-off represent a reasonable threshold for estimating the number of known species in the data sets for both ITS1 and ITS2. However, no single threshold value worked well for all fungi at the same time within the curated UNITE database, and we found that the Operational Taxonomic Unit (OTU) concept is not easily translated into the level of species because many species are distributed over several clusters. Clustering analyses of the 134 692 ITS1 and ITS2 pyrosequences using a 97% similarity cut-off revealed a high similarity between the two data sets when it comes to taxonomic coverage. Although some groups are under- or unrepresented in the two data sets due to, e.g. primer mismatches, our results indicate that ITS1 and ITS2 to a large extent yield similar results when used as DNA metabarcodes for fungi.
mCloud: A Context-Aware Offloading Framework for Heterogeneous Mobile Cloud

Mobile cloud computing (MCC) has become a significant paradigm for bringing the benefits of cloud computing to mobile devices’ proximity. Service availability along with performance enhancement and energy efficiency are primary targets in MCC. This paper proposes a code offloading framework, called mCloud, which consists of mobile devices, nearby cloudlets and public cloud services, to improve the performance and availability of the MCC services. The effect of the mobile device context (e.g., network conditions) on offloading decisions is studied by proposing a context-aware offloading decision algorithm aiming to provide code offloading decisions at runtime on selecting wireless medium and appropriate cloud resources for offloading. We also investigate failure detection and recovery policies for our mCloud system. We explain in details the design and implementation of the mCloud prototype framework. We conduct real experiments on the implemented system to evaluate the performance of the algorithm. Results indicate the system and embedded decision algorithm are able to provide decisions on selecting wireless medium and cloud resources based on different context of the mobile devices, and achieve significant reduction on makespan and energy, with the improved service availability when compared with existing offloading schemes.
Towards 3D object recognition via classification of arbitrary object tracks

Object recognition is a critical next step for autonomous robots, but a solution to the problem has remained elusive. Prior 3D-sensor-based work largely classifies individual point cloud segments or uses class-specific trackers. In this paper, we take the approach of classifying the tracks of all visible objects. Our new track classification method, based on a mathematically principled method of combining log odds estimators, is fast enough for real time use, is non-specific to object class, and performs well (98.5% accuracy) on the task of classifying correctly-tracked, well-segmented objects into car, pedestrian, bicyclist, and background classes. We evaluate the classifier's performance using the Stanford Track Collection, a new dataset of about 1.3 million labeled point clouds in about 14,000 tracks recorded from an autonomous vehicle research platform. This dataset, which we make publicly available, contains tracks extracted from about one hour of 360-degree, 10Hz depth information recorded both while driving on busy campus streets and parked at busy intersections.
A Spark-based Workflow for Probabilistic Record Linkage of Healthcare Data

Several areas, such as science, economics, finance, business intelligence, health, and others are exploring big data as a way to produce new information, make better decisions, and move forward their related technologies and systems. Specifically in health, big data represents a challenging problem due to the poor quality of data in some circumstances and the need to retrieve, aggregate, and process a huge amount of data from disparate databases. In this work, we focused on Brazilian Public Health System and on large databases from Ministry of Health and Ministry of Social Development and Hunger Alleviation. We present our Spark-based approach to data processing and probabilistic record linkage of such databases in order to produce very accurate data marts. These data marts are used by statisticians and epidemiologists to assess the effectiveness of conditional cash transfer programs to poor families in respect with the occurrence of some diseases (tuberculosis, leprosy, and AIDS). The case study we made as a proof-of-concept presents a good performance with accurate results. For comparison, we also discuss an OpenMP-based implementation.
Temperature dependent Pspice model of silicon carbide power MOSFET

This paper provides a behavioral model in Pspice for a silicon carbide (SiC) power MOSFET rated at 1200 V / 30 A for a wide temperature range. The Pspice model was built using device parameters extracted through experiment. The static and dynamic behavior of the SiC power MOSFET is simulated and compared to the measured data to show the accuracy of the Pspice model. The temperature dependent behavior was simulated and analyzed. Also, the effect of the parasitics of the circuit on switching behavior was simulated and discussed.
Dual Attention Networks for Multimodal Reasoning and Matching

We propose Dual Attention Networks (DANs) which jointly leverage visual and textual attention mechanisms to capture fine-grained interplay between vision and language. DANs attend to specific regions in images and words in text through multiple steps and gather essential information from both modalities. Based on this framework, we introduce two types of DANs for multimodal reasoning and matching, respectively. The reasoning model allows visual and textual attentions to steer each other during collaborative inference, which is useful for tasks such as Visual Question Answering (VQA). In addition, the matching model exploits the two attention mechanisms to estimate the similarity between images and sentences by focusing on their shared semantics. Our extensive experiments validate the effectiveness of DANs in combining vision and language, achieving the state-of-the-art performance on public benchmarks for VQA and image-text matching.
Learning to efficiently rank on big data

Ranking in response to user queries is a central problem in information retrieval, data mining, and machine learning. In the era of "Big data", traditional effectiveness-centric ranking techniques tend to get more and more costly (requiring additional hardware and energy costs) to sustain reasonable ranking speed on large data. The mentality of combating big data by throwing in more hardware/machines will quickly become highly expensive since data is growing at an extremely fast rate oblivious to any cost concerns from us. "Learning to efficiently rank" offers a cost-effective solution to ranking on large data (e.g., billions of documents). That is, it addresses a critically important question -- whether it is possible to improve ranking effectiveness on large data without incurring (too much) additional cost?
High-performance Semantic Segmentation Using Very Deep Fully Convolutional Networks

We propose a method for high-performance semantic image segmentation (or semantic pixel labelling) based on very deep residual networks, which achieves the state-of-the-art performance. A few design factors are carefully considered to this end. We make the following contributions. (i) First, we evaluate different variations of a fully convolutional residual network so as to find the best configuration, including the number of layers, the resolution of feature maps, and the size of field-of-view. Our experiments show that further enlarging the field-of-view and increasing the resolution of feature maps are typically beneficial, which however inevitably leads to a higher demand for GPU memories. To walk around the limitation, we propose a new method to simulate a high resolution network with a low resolution network, which can be applied during training and/or testing. (ii) Second, we propose an online bootstrapping method for training. We demonstrate that online bootstrapping is critically important for achieving good accuracy. (iii) Third we apply the traditional dropout to some of the residual blocks, which further improves the performance. (iv) Finally, our method achieves the currently best mean intersection-over-union 78.3% on the PASCAL VOC 2012 dataset, as well as on the recent dataset Cityscapes. ∗This research was in part supported by the Data to Decisions Cooperative Research Centre. C. Shen’s participation was in part supported by an ARC Future Fellowship (FT120100969). C. Shen is the corresponding author. 1 ar X iv :1 60 4. 04 33 9v 1 [ cs .C V ] 1 5 A pr 2 01 6
Facial performance enhancement using dynamic shape space analysis

The facial performance of an individual is inherently rich in subtle deformation and timing details. Although these subtleties make the performance realistic and compelling, they often elude both motion capture and hand animation. We present a technique for adding fine-scale details and expressiveness to low-resolution art-directed facial performances, such as those created manually using a rig, via marker-based capture, by fitting a morphable model to a video, or through Kinect reconstruction using recent faceshift technology. We employ a high-resolution facial performance capture system to acquire a representative performance of an individual in which he or she explores the full range of facial expressiveness. From the captured data, our system extracts an expressiveness model that encodes subtle spatial and temporal deformation details specific to that particular individual. Once this model has been built, these details can be transferred to low-resolution art-directed performances. We demonstrate results on various forms of input; after our enhancement, the resulting animations exhibit the same nuances and fine spatial details as the captured performance, with optional temporal enhancement to match the dynamics of the actor. Finally, we show that our technique outperforms the current state-of-the-art in example-based facial animation.