nils-herrmann/clean_scirepeval huggingface dataset:
Information Theory and Statistical Mechanics

Information theory provides a constructive criterion for setting up probability distributions on the basis of partial knowledge, and leads to a type of statistical inference which is called the maximum.entropy estimate. It is the least biased estimate possible on the given information; i.e., it is maximally noncom-mittal with regard to missing information. If one considers statistical mechanics as a form of statistical inference rather than as a physical theory, it is found that the usual computational rules, starting with the determination of the partition function, are an immediate consequence of the maximum-entropy principle. In the resulting "subjective statistical mechanics," the usual rules are thus justified independently of any physical argument, and in particular independently of experimental verification; whether
Pvclust: an R package for assessing the uncertainty in hierarchical clustering

Pvclust is an add-on package for a statistical software R to assess the uncertainty in hierarchical cluster analysis. Pvclust can be used easily for general statistical problems, such as DNA microarray analysis, to perform the bootstrap analysis of clustering, which has been popular in phylogenetic analysis. Pvclust calculates probability values (p-values) for each cluster using bootstrap resampling techniques. Two types of p-values are available: approximately unbiased (AU) p-value and bootstrap probability (BP) value. Multiscale bootstrap resampling is used for the calculation of AU p-value, which has superiority in bias over BP value calculated by the ordinary bootstrap resampling. In addition the computation time can be enormously decreased with parallel computing option.
From the Internet of Things to the Web of Things: Resource-oriented Architecture and Best Practices

Creating networks of “smart things” found in the physical world (e.g., with RFID, wireless sensor and actuator networks, embedded devices) on a large scale has become the goal of a variety of recent research activities. Rather than exposing real-world data and functionality through vertical system designs, we propose to make them an integral part of the Web. As a result, smart things become easier to build upon. In such an architecture, popular Web technologies (e.g., HTML, JavaScript, Ajax, PHP, Ruby) can be used to build applications involving smart things, and users can leverage well-known Web mechanisms (e.g., browsing, searching, bookmarking, caching, linking) to interact with and share these devices. In this chapter, we describe the Web of Things (WoT) architecture and best practices based on the RESTful principles that have already contributed to the popular success, scalability, and evolvability of the Web. We discuss several prototypes using these principles, which connect environmental sensor nodes, energy monitoring systems, and RFID-tagged objects to the Web. We also show how Web-enabled smart things can be used in lightweight ad-hoc applications, called “physical mashups”, and discuss some of the remaining challenges towards the global World Wide Web of Things. 5.1 From the Internet of Things to the Web of Things As more and more devices are getting connected to the Internet, the next logical step is to use the World Wide Web and its associated technologies as a platform for smart things (i.e., sensor and actuator networks, embedded devices, electronic appliances and digitally enhanced everyday objects). Several years ago, in the 1 The original publication is available at www.springerlink.com published in the book: “Architecting the Internet of Things”, edited by M. Harrison, F. Michahelles and D. Uck-
New reverse-conducting IGBT (1200V) with revolutionary compact package

Fuji Electric developed a 1200V class RC-IGBT based on our latest thin wafer process. The performance of this RC-IGBT shows the same relationship between conduction loss and switching loss as our 6th generation conventional IGBT and FWD. In addition its trade-off can be optimized for hard switching by lifetime killer. Calculations of the hard switching inverter loss and chip junction temperature (Tj) show that the optimized RC-IGBT can handle 35% larger current density per chip area. In order to utilize the high performance characteristics of the RC-IGBT, we assembled them in our newly developed compact package. This module can handle 58% higher current than conventional 100A modules at a 51% smaller footprint.
For the law, neuroscience changes nothing and everything.

The rapidly growing field of cognitive neuroscience holds the promise of explaining the operations of the mind in terms of the physical operations of the brain. Some suggest that our emerging understanding of the physical causes of human (mis)behaviour will have a transformative effect on the law. Others argue that new neuroscience will provide only new details and that existing legal doctrine can accommodate whatever new information neuroscience will provide. We argue that neuroscience will probably have a transformative effect on the law, despite the fact that existing legal doctrine can, in principle, accommodate whatever neuroscience will tell us. New neuroscience will change the law, not by undermining its current assumptions, but by transforming people's moral intuitions about free will and responsibility. This change in moral outlook will result not from the discovery of crucial new facts or clever new arguments, but from a new appreciation of old arguments, bolstered by vivid new illustrations provided by cognitive neuroscience. We foresee, and recommend, a shift away from punishment aimed at retribution in favour of a more progressive, consequentialist approach to the criminal law.
Capacitor Voltage Balancing Schemes in Flying Capacitor Multilevel Inverters

This paper focuses on the development of capacitor voltage balancing methods in a flying capacitor multilevel inverter (FCMLI). Three such strategies have been described and have been applied to a five-level CMLI. The sinusoidal pulse width modulation technique has been used while making the proposals. The first scheme works on the principle of selection of the most favorable switching state depending on the preferential charging and discharging of capacitors. It uses a two-level comparator for each capacitor state detection. In the second scheme, capacitor voltages are controlled in a three-level comparator to achieve better performance. In the third scheme, a sampling frequency-based approach for controlling the capacitor voltages has been proposed to achieve further improved performance. The performance of proposed strategies is confirmed through both simulation and experimental investigations.
Market-Based Multirobot Coordination: A Survey and Analysis

Market-based multirobot coordination approaches have received significant attention and are growing in popularity within the robotics research community. They have been successfully implemented in a variety of domains ranging from mapping and exploration to robot soccer. The research literature on market-based approaches to coordination has now reached a critical mass that warrants a survey and analysis. This paper addresses this need for a survey of the relevant literature by providing an introduction to market-based multirobot coordination, a review and analysis of the state of the art in the field, and a discussion of remaining research challenges
Lest We Remember: Cold Boot Attacks on Encryption Keys

Contrary to widespread assumption, dynamic RAM (DRAM), the main memory in most modern computers, retains its contents for several seconds after power is lost, even at room temperature and even if removed from a motherboard. Although DRAM becomes less reliable when it is not refreshed, it is not immediately erased, and its contents persist sufficiently for malicious (or forensic) acquisition of usable full-system memory images. We show that this phenomenon limits the ability of an operating system to protect cryptographic key material from an attacker with physical access to a machine. It poses a particular threat to laptop users who rely on disk encryption: we demonstrate that it could be used to compromise several popular disk encryption products without the need for any special devices or materials. We experimentally characterize the extent and predictability of memory retention and report that remanence times can be increased dramatically with simple cooling techniques. We offer new algorithms for finding cryptographic keys in memory images and for correcting errors caused by bit decay. Though we discuss several strategies for mitigating these risks, we know of no simple remedy that would eliminate them.
Death Due to Decapitation in Two Motorcyclists: A Description of a Unique Case and a Brief Review of the Literature.

Deaths due to decapitation, especially related to traffic accidents, are rarely found in forensic practice. The present case involves a man and a woman who died from decapitation due to an unusual mechanism while they were riding on a motorbike down a mountain road. The autopsy, which was completed as a physics study, allowed the accident to be reconstructed as follows: A plastic cable that had detached from a timber-transporting machine whipped the road and hit the two motorcyclists. The impact resulted in the complete severing of both riders' heads. Involving different scientists in this accident investigation was crucial to understanding the dynamics of the accident. In fact, in addition to scene inspection and autopsy, a physics study was carried out on the cable and the clamp involved, which led to an explanation for the abrupt movement of the cable and, thus, to a thorough reconstruction of the accident.
Robust minimum variance beamforming

This paper introduces an extension of minimum variance beamforming that explicitly takes into account variation or uncertainty in the array response. Sources of this uncertainty include imprecise knowledge of the angle of arrival and uncertainty in the array manifold. In our method, uncertainty in the array manifold is explicitly modeled via an ellipsoid that gives the possible values of the array for a particular look direction. We choose weights that minimize the total weighted power output of the array, subject to the constraint that the gain should exceed unity for all array responses in this ellipsoid. The robust weight selection process can be cast as a second-order cone program that can be solved efficiently using Lagrange multiplier techniques. If the ellipsoid reduces to a single point, the method coincides with Capon's method. We describe in detail several methods that can be used to derive an appropriate uncertainty ellipsoid for the array response. We form separate uncertainty ellipsoids for each component in the signal path (e.g., antenna, electronics) and then determine an aggregate uncertainty ellipsoid from these. We give new results for modeling the element-wise products of ellipsoids. We demonstrate the robust beamforming and the ellipsoidal modeling methods with several numerical examples.
A Practical Attack to De-anonymize Social Network Users

Social networking sites such as Facebook, LinkedIn, and Xing have been reporting exponential growth rates and have millions of registered users. In this paper, we introduce a novel de-anonymization attack that exploits group membership information that is available on social networking sites. More precisely, we show that information about the group memberships of a user (i.e., the groups of a social network to which a user belongs) is sufficient to uniquely identify this person, or, at least, to significantly reduce the set of possible candidates. That is, rather than tracking a user's browser as with cookies, it is possible to track a person. To determine the group membership of a user, we leverage well-known web browser history stealing attacks. Thus, whenever a social network user visits a malicious website, this website can launch our de-anonymization attack and learn the identity of its visitors. The implications of our attack are manifold, since it requires a low effort and has the potential to affect millions of social networking users. We perform both a theoretical analysis and empirical measurements to demonstrate the feasibility of our attack against Xing, a medium-sized social network with more than eight million members that is mainly used for business relationships. Furthermore, we explored other, larger social networks and performed experiments that suggest that users of Facebook and LinkedIn are equally vulnerable.
The combinatorial assignment problem: approximate competitive equilibrium from equal incomes

Impossibility theorems suggest that the only efficient and strategyproof mechanisms for the problem of combinatorial assignment - e.g., assigning schedules of courses to students - are dictatorships. Dictatorships are mostly rejected as unfair: for any two agents, one chooses all their objects before the other chooses any. Any solution will involve compromise amongst efficiency, incentive and fairness considerations.
 This paper proposes a solution to the combinatorial assignment problem. It is developed in four steps. First, I propose two new criteria of outcome fairness, the maximin share guarantee and envy bounded by a single good, which weaken well-known criteria to accommodate indivisibilities; the criteria formalize why dictatorships are unfair. Second, I prove existence of an approximation to Competitive Equilibrium from Equal Incomes in which (i) incomes are unequal but arbitrarily close together; (ii) the market clears with error, which approaches zero in the limit and is small for realistic problems. Third, I show that this Approximate CEEI satisfies the fairness criteria. Last, I define a mechanism based on Approximate CEEI that is strategyproof for the zero-measure agents economists traditionally regard as price takers. The proposed mechanism is calibrated on real data and is compared to alternatives from theory and practice: all other known mechanisms are either manipulable by zero-measure agents or unfair ex-post, and most are both manipulable and unfair.
Factor graphs and the sum-product algorithm

Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of “local” functions, each of which depends on a subset of the variables. Such a factorization can be visualized with a bipartite graph that we call afactor graph. In this tutorial paper, we present a generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph. Following a single, simple computational rule, the sum-product algorithm computes—either exactly or approximately—various marginal functions derived from the global function. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can be derived as specific instances of the sum-product algorithm, including the forward/backward algorithm, the Viterbi algorithm, the iterative “turbo” decoding algorithm, Pearl’s belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform (FFT) algorithms.
Process and environmental variation impacts on ASIC timing

With each semiconductor process node, the impacts on performance of environmental and semiconductor process variations become a larger portion of the cycle time of the product. Simple guard-banding for these effects leads to increased product development times and uncompetitive products. In addition, traditional static timing methodologies are unable to cope with the large number of permutations of process, voltage, and temperature corners created by these independent sources of variation. In this paper we will discuss the sources of variation; by introducing the concepts of systematic inter-die variation, systematic intra-die variation and intra-die random variation. We will show that by treating these forms of variations differently, we can achieve design closure with less guard-banding than traditional methods.
Return-oriented programming without returns

We show that on both the x86 and ARM architectures it is possible to mount return-oriented programming attacks without using return instructions. Our attacks instead make use of certain instruction sequences that behave like a return, which occur with sufficient frequency in large libraries on (x86) Linux and (ARM) Android to allow creation of Turing-complete gadget sets.
 Because they do not make use of return instructions, our new attacks have negative implications for several recently proposed classes of defense against return-oriented programming: those that detect the too-frequent use of returns in the instruction stream; those that detect violations of the last-in, first-out invariant normally maintained for the return-address stack; and those that modify compilers to produce code that avoids the return instruction.
Are More Data Always Better for Factor Analysis ?

Factors estimated from large macroeconomic panels are being used in an increasing number of applications. However, little is known about how the size and composition of the data affect the factor estimates. In this paper, we question whether it is possible to use more series to extract the factors and that yet the resulting factors are less useful for forecasting, and the answer is yes. Such a problem tends to arise when the idiosyncratic errors are cross-correlated. It can also arise if forecasting power is provided by a factor that is dominant in a small dataset but is a dominated factor in a larger dataset. In a real time forecasting exercise, we find that factors extracted from as few as 40 pre-screened series often yield satisfactory or even better results than using all 147 series. Our simulation analysis is unique in that special attention is paid to cross-correlated idiosyncratic errors, and we also allow the factors to have weak loadings on groups of series. It thus allows us to better understand the properties of the principal components estimator in empirical applications. ∗Graduate School of Business, 719 Uris Hall, Columbia University, New York, NY.  Department of Economics, Johns Hopkins University, 3400 N. Charles St., Baltimore, MD 21218.  Serena.Ng@jhu.edu The authors would like to thank National Science Foundation for financial support. We thank Pritha Mitra for useful research assistance.
Balanced Multithreading: Increasing Throughput via a Low Cost Multithreading Hierarchy

A simultaneous multithreading (SMT) processor can issue instructions from several threads every cycle, allowing it to effectively hide various instruction latencies; this effect increases with the number of simultaneous contexts supported. However, each added context on an SMT processor incurs a cost in complexity, which may lead to an increase in pipeline length or a decrease in the maximum clock rate. This paper presents new designs for multithreaded processors which combine a conservative SMT implementation with a coarse-grained multithreading capability. By presenting more virtual contexts to the operating system and user than are supported in the core pipeline, the new designs can take advantage of the memory parallelism present in workloads with many threads, while avoiding the performance penalties inherent in a many-context SMT processor design. A design with 4 virtual contexts, but which is based on a 2-context SMT processor core, gains an additional 26% throughput when 4 threads are run together.
Characterization of graphene-based nano-antennas in the terahertz band

Graphene-enabled wireless communications constitute a novel paradigm which has been proposed to implement wireless communications at the nanoscale. Indeed, graphene-based nano-antennas just a few micrometers in size have been predicted to radiate electromagnetic waves at the terahertz band. In this work, the performance of a graphene-based nano-patch antenna in transmission and reception is numerically analyzed. The resonance frequency of the nano-antenna is calculated as a function of its length and width, both analytically and by simulation. The influence of a dielectric substrate with a variable size, and the position of the patch with respect to the substrate is also evaluated. Finally, the radiation pattern of a graphene-based nano-patch antenna is compared to that of an equivalent metallic antenna. These results will prove useful for designers of future graphene-based nano-antennas, which will enable wireless communications at the nanoscale.
Regression testing of GUIs

Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective regression testing techniques for GUIs. The needs of GUI regression testing differ from those of traditional software. When the structure of a GUI is modified, test cases from the original GUI are either reusable or unusable on the modified GUI. Since GUI test case generation is expensive, our goal is to make the unusable test cases usable. The idea of reusing these unusable (a.k.a. obsolete) test cases has not been explored before. In this paper, we show that for GUIs, the unusability of a large number of test cases is a serious problem. We present a novel GUI regression testing technique that first automatically determines the usable and unusable test cases from a test suite after a GUI modification. It then determines which of the unusable test cases can be repaired so they can execute on the modified GUI. The last step is to repair the test cases. Our technique is integrated into a GUI testing framework that, given a test case, automatically executes it on the GUI. We implemented our regression testing technique and demonstrate for two case studies that our approach is effective in that many of the test cases can be repaired, and is practical in terms of its time performance.
The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and its Optimality

M. Douglas Mcllroy* and Data Structures Editor stop(top). In such a situation, the element top has to be deleted from the stack and more operations are required to generate the next combination. When k > top > 2, one can show that the probability for a specific value of top that a[top] = stop(top) is a(top + l ) /a( top) , which reduces to (k top + l ) / (n top). Hence, when k is small compared to n, it is very unlikely that the next combination is generated by using the theoretical maxim u m number of operations. I f k is very small compared to n, then P(I) , the probabili ty that a combination is generated by changing only a[1], is approximately 1. In this case, almost all the combinations are generated by the single statement a[1] := a[1] 1. It is doubtful that any combination algorithm would require less work than this to generate a combination.