nils-herrmann/clean_scirepeval huggingface dataset:
Discriminative Training of Deep Fully Connected Continuous CRFs With Task-Specific Loss

Recent works on deep conditional random fields (CRFs) have set new records on many vision tasks involving structured predictions. Here, we propose a fully connected deep continuous CRF model with task-specific losses for both discrete and continuous labeling problems. We exemplify the usefulness of the proposed model on multi-class semantic labeling (discrete) and the robust depth estimation (continuous) problems. In our framework, we model both the unary and the pairwise potential functions as deep convolutional neural networks (CNNs), which are jointly learned in an end-to-end fashion. The proposed method possesses the main advantage of continuously valued CRFs, which is a closed-form solution for the maximum a posteriori (MAP) inference. To better take into account the quality of the predicted estimates during the cause of learning, instead of using the commonly employed maximum likelihood CRF parameter learning protocol, we propose task-specific loss functions for learning the CRF parameters. It enables direct optimization of the quality of the MAP estimates during the learning process. Specifically, we optimize the multi-class classification loss for the semantic labeling task and the Tukey’s biweight loss for the robust depth estimation problem. Experimental results on the semantic labeling and robust depth estimation tasks demonstrate that the proposed method compare favorably against both baseline and state-of-the-art methods. In particular, we show that although the proposed deep CRF model is continuously valued, with the equipment of task-specific loss, it achieves impressive results even on discrete labeling tasks.
Structural Insights into the Niemann-Pick C1 (NPC1)-Mediated Cholesterol Transfer and Ebola Infection

Niemann-Pick disease type C (NPC) is associated with mutations in NPC1 and NPC2, whose gene products are key players in the endosomal/lysosomal egress of low-density lipoprotein-derived cholesterol. NPC1 is also the intracellular receptor for Ebola virus (EBOV). Here, we present a 4.4 Å structure of full-length human NPC1 and a low-resolution reconstruction of NPC1 in complex with the cleaved glycoprotein (GPcl) of EBOV, both determined by single-particle electron cryomicroscopy. NPC1 contains 13 transmembrane segments (TMs) and three distinct lumenal domains A (also designated NTD), C, and I. TMs 2-13 exhibit a typical resistance-nodulation-cell division fold, among which TMs 3-7 constitute the sterol-sensing domain conserved in several proteins involved in cholesterol metabolism and signaling. A trimeric EBOV-GPcl binds to one NPC1 monomer through the domain C. Our structural and biochemical characterizations provide an important framework for mechanistic understanding of NPC1-mediated intracellular cholesterol trafficking and Ebola virus infection.
Reporting practices in confirmatory factor analysis: an overview and some recommendations.

Reporting practices in 194 confirmatory factor analysis studies (1,409 factor models) published  to 2006 were reviewed and compared with established reporting guidelines. Three research questions were addressed: (a) how do actual reporting practices compare with published guidelines? (b) how do researchers report model fit in light of divergent perspectives on the use of ancillary fit indices (e.g., L.-T. Hu & P. M. Bentler, 1999; H. W. Marsh, K.-T., Hau, & Z. Wen, 2004)? and (c) are fit measures that support hypothesized models reported more often than fit measures that are less favorable? Results indicate some positive findings with respect to reporting practices including proposing multiple models a priori and near universal reporting of the chi-square significance test. However, many deficiencies were found such as lack of information regarding missing data and assessment of normality. Additionally, the authors found increases in reported values of some incremental fit statistics and no statistically significant evidence that researchers selectively report measures of fit that support their preferred model. Recommendations for reporting are summarized and a checklist is provided to help editors, reviewers, and authors improve reporting practices.
Bioinspired engineering of thermal materials.

In the development of next-generation materials with enhanced thermal properties, biological systems in nature provide many examples that have exceptional structural designs and unparalleled performance in their thermal or nonthermal functions. Bioinspired engineering thus offers great promise in the synthesis and fabrication of thermal materials that are difficult to engineer through conventional approaches. In this review, recent progress in the emerging area of bioinspired advanced materials for thermal science and technology is summarized. State-of-the-art developments of bioinspired thermal-management materials, including materials for efficient thermal insulation and heat transfer, and bioinspired materials for thermal/infrared detection, are highlighted. The dynamic balance of bioinspiration and practical engineering, the correlation of inspiration approaches with the targeted applications, and the coexistence of molecule-based inspiration and structure-based inspiration are discussed in the overview of the development. The long-term outlook and short-term focus of this critical area of advanced materials engineering are also presented.
Gene expression profiling predicts clinical outcome of breast cancer

Breast cancer patients with the same stage of disease can have markedly different treatment responses and overall outcome. The strongest predictors for metastases (for example, lymph node status and histological grade) fail to classify accurately breast tumours according to their clinical behaviour. Chemotherapy or hormonal therapy reduces the risk of distant metastases by approximately one-third; however, 70–80% of patients receiving this treatment would have survived without it. None of the signatures of breast cancer gene expression reported to date allow for patient-tailored therapy strategies. Here we used DNA microarray analysis on primary breast tumours of 117 young patients, and applied supervised classification to identify a gene expression signature strongly predictive of a short interval to distant metastases (‘poor prognosis’ signature) in patients without tumour cells in local lymph nodes at diagnosis (lymph node negative). In addition, we established a signature that identifies tumours of BRCA1 carriers. The poor prognosis signature consists of genes regulating cell cycle, invasion, metastasis and angiogenesis. This gene expression profile will outperform all currently used clinical parameters in predicting disease outcome. Our findings provide a strategy to select patients who would benefit from adjuvant therapy.
Unsupervised concept based entity extraction from scientific titles

is paper studies the extraction and typing of entities from titles of academic literature, in order to gain a deeper understanding of their specic contributions and automate the construction of a problem-solution knowledgebase. To achieve this goal, we propose an unsupervised, domain independent, two phase algorithm to extract entity mentions and type them into appropriate concepts. In the rst phase of our algorithm we propose a generative model which exploits textual and syntactic features to broadly segment titles and type them into concepts. In the second phase, we propose an unsupervised approach based on adaptor grammars to extract ne grained entities of interest without the need for any external resources or human eort, in a purely data driven manner. We analyze literature from diverse scientic domains and show signicant gains over state-of-the-art concept extraction techniques. We also present an analysis and summarization of the knowledge base constructed by our algorithm. CCS CONCEPTS •Computer systems organization→ Embedded systems; Redundancy; Robotics; •Networks→ Network reliability;
Improved Use of Continuous Attributes in C4.5

A reported weakness of C4.5 in domains with continuous attributes is addressed by modifying the formation and evaluation of tests on continuous attributes. An MDL-inspired penalty is applied to such tests, eliminating some of them from consideration and altering the relative desirability of all tests. Empirical trials show that the modi cations lead to smaller decision trees with higher predictive accuracies. Results also con rm that a new version of C4.5 incorporating these changes is superior to recent approaches that use global discretization and that construct small trees with multi-interval splits.
Visual Exploration of Climate Variability Changes Using Wavelet Analysis

Due to its nonlinear nature, the climate system shows quite high natural variability on different time scales, including multiyear oscillations such as the El Nino southern oscillation phenomenon. Beside a shift of the mean states and of extreme values of climate variables, climate change may also change the frequency or the spatial patterns of these natural climate variations. Wavelet analysis is a well established tool to investigate variability in the frequency domain. However, due to the size and complexity of the analysis results, only few time series are commonly analyzed concurrently. In this paper we will explore different techniques to visually assist the user in the analysis of variability and variability changes to allow for a holistic analysis of a global climate model data set consisting of several variables and extending over 250 years. Our new framework and data from the IPCC AR4 simulations with the coupled climate model ECHAM5/MPI-OM are used to explore the temporal evolution of El Nino due to climate change.
Full dimension MIMO for LTE-Advanced and 5G

Elevation beamforming and Full Dimension MIMO (FD-MIMO) has been an active area of research and standardization in 3GPP LTE-Advanced. In an FD-MIMO system, a base station with 2-dimensional (2D) active array supports multi-user joint elevation and azimuth beamforming (a.k.a. 3D beamfoming), which results in much higher cell capacity compared to conventional systems. Recent study has shown that with these new FD-MIMO technologies, we can achieve promising 3-5× gain in both cell capacity as well as cell-edge throughput. In this paper, we will provide a brief summary of recent 3GPP activities, including the recently completed 3D channel model, ongoing study on FD-MIMO scenarios, antenna/RF (radio frequency) transceiver architectures, as well as potential network performance benefits. In addition, we also discuss some methods for reducing CSI (channel state information) feedback overhead and ensuring efficient operation of large size FD-MIMO for both TDD and FDD systems.
Random Testing: Theoretical Results and Practical Implications

A substantial amount of work has shed light on whether random testing is actually a useful testing technique. Despite its simplicity, several successful real-world applications have been reported in the literature. Although it is not going to solve all possible testing problems, random testing appears to be an essential tool in the hands of software testers. In this paper, we review and analyze the debate about random testing. Its benefits and drawbacks are discussed. Novel results addressing general questions about random testing are also presented, such as how long does random testing need, on average, to achieve testing targets (e.g., coverage), how does it scale, and how likely is it to yield similar results if we rerun it on the same testing problem (predictability). Due to its simplicity that makes the mathematical analysis of random testing tractable, we provide precise and rigorous answers to these questions. Results show that there are practical situations in which random testing is a viable option. Our theorems are backed up by simulations and we show how they can be applied to most types of software and testing criteria. In light of these results, we then assess the validity of empirical analyzes reported in the literature and derive guidelines for both practitioners and scientists.
Random k-Labelsets for Multilabel Classification

A simple yet effective multilabel learning method, called label powerset (LP), considers each distinct combination of labels that exist in the training set as a different class value of a single-label classification task. The computational efficiency and predictive performance of LP is challenged by application domains with large number of labels and training examples. In these cases, the number of classes may become very large and at the same time many classes are associated with very few training examples. To deal with these problems, this paper proposes breaking the initial set of labels into a number of small random subsets, called labelsets and employing LP to train a corresponding classifier. The labelsets can be either disjoint or overlapping depending on which of two strategies is used to construct them. The proposed method is called RAkEL (RAndom k labELsets), where k is a parameter that specifies the size of the subsets. Empirical evidence indicates that RAkEL manages to improve substantially over LP, especially in domains with large number of labels and exhibits competitive performance against other high-performing multilabel learning methods.
Folded Half Mode Substrate Integrated Waveguide 3 dB Coupler

In this letter, novel compact 3 dB double-slot and single-slot couplers are proposed and implemented based on folded half mode substrate integrated waveguide (FHMSIW). The size of the FHMSIW coupler is reduced by nearly 50% and 75% compared with half-mode substrate integrated waveguide coupler and substrate integrated waveguide coupler, respectively. Prototype couplers at X-band are fabricated and measured and good performance in bandwidth, insertion loss, and balance are achieved.
Finding Steiner Forests in Planar Graphs

Several routing problems such as VLSI river routing and single-layer routing can be formulated as a problem of finding a Steiner forest in a planar (grid) graph. Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the terminals of a net. This paper gives an efficient algorithm to solve the problem for the case all terminals lie on two face boundaries of G. Also obtained is an algorithm for finding a maximum number of internally vertexdisjoint paths connecting two specified vertices in a planar graph G. Both run in 0( nlog n) time if G has n vertices.
Forecasting Real Estate Prices ∗

This chapter reviews the evidence of predictability in US residential and commercial real estate markets. First, we highlight the main methodologies used in the construction of real estate indices, their underlying assumptions and their impact on the stochastic properties of the resultant series. We then survey the key empirical findings in the academic literature, including short-run persistence and long-run reversals in the log changes of real estate prices. Next, we summarize the ability of local as well as aggregate variables to forecast real estate returns. We illustrate a number of these results by relying on six aggregate indexes of the prices of unsecuritized (residential and commercial) real estate and REITs. The effect of leverage and monetary policy is also discussed.
Problems with the Concept of Video Game “Addiction”: Some Case Study Examples

This paper argues that the recent concerns about video game “addiction” have been based less on scientific facts and more upon media hysteria. By examining the literature, it will be demonstrated that the current criteria used for identifying this concept are both inappropriate and misleading. Furthermore, by presenting four case studies as examples it will be demonstrated how such claims of video game addiction can be inaccurately applied. It is concluded that the most likely reasons that people play video games excessively are due to either ineffective time management skills, or as a symptomatic response to other underlying problems that they are escaping from, rather than any inherent addictive properties of the actual games.
GlobFit: consistently fitting primitives by discovering global relations

Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available.
Implementation of high speed radix-10 parallel multiplier using Verilog

The emerging computational complexities arises the need of fast multiplication unit. The importance of multiplication in various applications necessitates improvement in its design so as to obtain the multiplication result efficiently. Multiplication operation can be improved by reducing the number of partial products to be added and by enhancing the adder unit for obtaining sum. The number of partial products can be reduced by using higher radix multiplication. For better speed applications a radix-10 multiplier is proposed which uses recoded multiplier digits as in conventional parallel multiplier design. The multiplier digits are encoded using Signed Digit (SD) radix-10 method which converts the digit set to {-5 to 5} from {0 to 9} and also generate a sign bit. This recoding leads to minimized calculations as only five multiples are required to be calculated and the negative multiples are obtained using 2's complement approach. The negative multiples are used when sign bit is high. A different approach is availed in the multiples generation of the multiplicand digit and during accumulation of partial product obtained during multiplication procedure. A modified BCD adder is used which eliminates the post correction while calculating the sum of two BCD digits. The modified architecture eliminates the extra recoding logic thereby reducing the area of overall architecture. This paper delivers the design and implementation of 16-Bit multiplication unit. The design entry is done in Verilog Hardware Description Language (HDL) and simulated using ISIM Simulator. It is synthesized and implemented using Xilinx ISE 12.2. Synthesis results have shown that 20.3% reduction in 4-Input LUTs and 20.4% reduction in the number of slices is observed in the modified methodology. Further 11.5% reduction of maximum combinational path delay is also observed in the modified architecture, thereby leading to high speed multiplication for VLSI applications.
EXTERIOR: using a dual-VM based external shell for guest-OS introspection, configuration, and recovery

This paper presents EXTERIOR, a dual-VM architecture based external shell that can be used for trusted, timely out-of-VM management of guest-OS such as introspection, configuration, and recovery. Inspired by recent advances in virtual machine introspection (VMI), EXTERIOR leverages an isolated, secure virtual machine (SVM) to introspect the kernel state of a guest virtual machine (GVM). However, it goes far beyond the read-only capability of the traditional VMI, and can perform automatic, fine-grained guest-OS writable operations. The key idea of EXTERIOR is to use a dual-VM architecture in which a SVM runs a kernel identical to that of the GVM to create the necessary environment for a running process (e.g., rmmod, kill), and dynamically and transparently redirect and update the memory state at the VMM layer from SVM to GVM, thereby achieving the same effect in terms of kernel state updates of running the same trusted in-VM program inside the shell of GVM. A proof-of-concept EXTERIOR has been implemented. The experimental results show that EXTERIOR can be used for a timely administration of guest-OS, including introspection and (re)configuration of the guest-OS state and timely response of kernel malware intrusions, without any user account in the guest-OS.
Mobile business models: organizational and financial design issues that matter

Designing viable mobile services and business models that capture value for all the organizations involved is a challenge. There are many design issues that can be taken into account, and it is often unclear what their ultimate effect is on the performance of a business model. This paper offers a framework for relating critical design issues to success factors and tests the causal relationship between these core concepts in the organizational and financial domain of mobile business models, based on an international survey among 120 practitioners and experts in the mobile Internet services domain, most of them from EU countries. According to our findings, addressing organizational design issues (i.e. partner selection, governance and relation management) leads to an acceptable division of roles among actors, while addressing financial design issues (i.e., pricing, division of investments and costs among partners) results in risk levels that are perceived to be acceptable. The level of profitability that is perceived to be acceptable is influenced indirectly by these design issues, because the relationships are mediated through the risk level that the actors involved perceive to be acceptable and through the way the roles are divided among the actors.
An empirical study of reserve price optimisation in real-time bidding

In this paper, we report the first empirical study and live test of the reserve price optimisation problem in the context of Real-Time Bidding (RTB) display advertising from an operational environment. A reserve price is the minimum that the auctioneer would accept from bidders in auctions, and in a second price auction it could potentially uplift the auctioneer's revenue by charging winners the reserve price instead of the second highest bids. As such it has been used for sponsored search and been well studied in that context. However, comparing with sponsored search and contextual advertising, this problem in the RTB context is less understood yet more critical for publishers because 1) bidders have to submit a bid for each individual impression, which mostly is associated with user data that is subject to change over time. This, coupled with practical constraints such as the budget, campaigns' life time, etc. makes the theoretical result from optimal auction theory not necessarily applicable and a further empirical study is required to confirm its optimality from the real-world system; 2) in RTB an advertiser is facing nearly unlimited supply and the auction is almost done in "last second", which encourages spending less on the high cost ad placements. This could imply the loss of bid volume over time if a correct reserve price is not in place. In this paper we empirically examine several commonly adopted algorithms for setting up a reserve price. We report our results of a large scale online experiment in a production platform. The results suggest the our proposed game theory based OneShot algorithm performed the best and the superiority is significant in most cases.