Query: How do fixes become bugs?

Relevant passages:
Bugs as deviant behavior: a general approach to inferring errors in systems code <=SEP=> A major obstacle to finding program errors in a real system is knowing what correctness rules the system must obey. These rules are often undocumented or specified in an ad hoc manner. This paper demonstrates techniques that automatically extract such checking information from the source code itself, rather than the programmer, thereby avoiding the need for a priori knowledge of system rules. The cornerstone of our approach is inferring programmer “beliefs” that we then cross-check for contradictions. Beliefs are facts implied by code: a dereference of a pointer, p, implies a belief that p is non-null, a call to “unlock(l)” implies that l was locked, etc. For beliefs we know the programmer must hold, such as the pointer dereference above, we immediately flag contradictions as errors. For beliefs that the programmer may hold, we can assume these beliefs hold and use a statistical analysis to rank the resulting errors from most to least likely. For example, a call to “spin lock” followed once by a call to “spin unlock” implies that the programmer may have paired these calls by coincidence. If the pairing happens 999 out of 1000 times, though, then it is probably a valid belief and the sole deviation a probable error. The key feature of this approach is that it requires no a priori knowledge of truth: if two beliefs contradict, we know that one is an error without knowing what the correct belief is. Conceptually, our checkers extract beliefs by tailoring rule “templates” to a system – for example, finding all functions that fit the rule template “<a> must be paired with <b>.” We have developed six checkers that follow this conceptual framework. They find hundreds of bugs in real systems such as Linux and OpenBSD. From our experience, they give a dramatic reduction in the manual effort needed to check a large system. Compared to our previous work [9], these template checkers find ten to one hundred times more rule instances and derive properties we found impractical to specify manually.

Scaling regression testing to large software systems <=SEP=> When software is modified, during development and maintenance, it is <i>regression tested</i> to provide confidence that the changes did not introduce unexpected errors and that new features behave as expected. One important problem in regression testing is how to select a subset of test cases, from the test suite used for the original version of the software, when testing a modified version of the software. Regression-test-selection techniques address this problem. Safe regression-test-selection techniques select every test case in the test suite that may behave differently in the original and modified versions of the software. Among existing safe regression testing techniques, efficient techniques are often too imprecise and achieve little savings in testing effort, whereas precise techniques are too expensive when used on large systems. This paper presents a new regression-test-selection technique for Java programs that is safe, precise, and yet scales to large systems. It also presents a tool that implements the technique and studies performed on a set of subjects ranging from 70 to over 500 KLOC. The studies show that our technique can efficiently reduce the regression testing effort and, thus, achieve considerable savings.

Predicting risk of software changes <=SEP=> Reducing the number of software failures is one of the most challenging problems of software production. We assume that software development proceeds as a series of changes and model the probability that a change to software will cause a failure. We use predictors based on the properties of a change itself. Such predictors include size in lines of code added, deleted, and unmodified; diffusion of the change and its component subchanges, as reflected in the number of files, modules, and subsystems touched, or changed; several measures of developer experience; and the type of change and its subchanges (fault fixes or new code). The model is built on historic information and is used to predict the risk of new changes. In this paper we apply the model to 5ESS® software updates and find that change diffusion and developer experience are essential to predicting failures. The predictive model is implemented as a Web-based tool to allow timely prediction of change quality. The ability to predict the quality of change enables us to make appropriate decisions regarding inspection, testing, and delivery. Historic information on software changes is recorded in many commercial software projects, suggesting that our results can be easily and widely applied in practice.

Predicting Fault Incidence Using Software Change History <=SEP=> ÐThis paper is an attempt to understand the processes by which software ages. We define code to be aged or decayed if its structure makes it unnecessarily difficult to understand or change and we measure the extent of decay by counting the number of faults in code in a period of time. Using change management data from a very large, long-lived software system, we explore the extent to which measurements from the change history are successful in predicting the distribution over modules of these incidences of faults. In general, process measures based on the change history are more useful in predicting fault rates than product metrics of the code: For instance, the number of times code has been changed is a better indication of how many faults it will contain than is its length. We also compare the fault rates of code of various ages, finding that if a module is, on the average, a year older than an otherwise similar module, the older module will have roughly a third fewer faults. Our most successful model measures the fault potential of a module as the sum of contributions from all of the times the module has been changed, with large, recent changes receiving the most weight. Index TermsÐFault potential, code decay, change management data, metrics, statistical analysis, generalized linear models.

Chianti: a tool for change impact analysis of java programs <=SEP=> This paper reports on the design and implementation of Chianti, a change impact analysis tool for Java that is implemented in the context of the Eclipse environment. Chianti analyzes two versions of an application and decomposes their difference into a set of atomic changes. Change impact is then reported in terms of affected (regression or unit) tests whose execution behavior may have been modified by the applied changes. For each affected test, Chianti also determines a set of affecting changes that were responsible for the test's modified behavior. This latter step of isolating the changes that induce the failure of one specific test from those changes that only affect other tests can be used as a debugging technique in situations where a test fails unexpectedly after a long editing session. We evaluated Chianti on a year (2002) of CVS data from M. Ernst's Daikon system, and found that, on average, 52% of Daikon's unit tests are affected. Furthermore, each affected unit test, on average, is affected by only 3.95% of the atomic changes. These findings suggest that our change impact analysis is a promising technique for assisting developers with program understanding and debugging.

Accurate dB-Linear Variable Gain Amplifier With Gain Error Compensation <=SEP=> This paper describes use of a novel exponential approximation for designing dB-linear variable gain amplifiers (VGAs). The exponential function is accurately generated using a simple error-compensation technique. The dB-linear gain is controlled linearly by the gate voltage, resulting in a simple and robust VGA. The proposed dB-linear VGA fabricated in a 65-nm CMOS process achieves a total variable gain range of 76 dB and dB-linear range greater than 50 dB with ±0.5-dB gain error. Under a 1.2-V supply voltage, the current consumption of the VGA is 1.8 mA and that of the output buffer is 1.4 mA. The input-referred in-band noise density is 3.5 nV/√{Hz} and the in-band OIP3 is 11.5 dBm. Due to the very simple circuit topology, the total active area of the VGA and the output buffer is extremely small, 0.01 mm2.

Goubau-Line Leaky-Wave Antenna for Wide-Angle Beam Scanning From Backfire to Endfire <=SEP=> A Goubau-line leaky-wave antenna (LWA) with a large scanning angle is presented in this letter. In contrast to the conventional Goubau-line leaky wave with a small scanning angle range, this letter employed a periodically bending Goubau line, which not only brings in a periodic perturbation for leaky-wave radiation, but also enhances the scanning range due to the increased delay for each line element. The simulation and experimental results show that the proposed LWA provides $90\%$ radiation efficiency and 7–10 dBi radiation gain from backfire to endfire through broadside as frequency changes. The proposed antenna features good radiation performance and has a compact and low-profile configuration.

Autonomous NAT Traversal <=SEP=> Traditional NAT traversal methods require the help of a third party for signalling. This paper investigates a new autonomous method for establishing connections to peers behind NAT. The proposed method for autonomous NAT traversal uses fake ICMP messages to initially contact the NATed peer. This paper presents how the method is supposed to work in theory, discusses some possible variations, introduces various concrete implementations of the proposed approach and evaluates empirical results of a measurement study designed to evaluate the efficacy of the idea in practice.

Synthesis Design of a Wideband Bandpass Filter With Inductively Coupled Short-Circuited Multi-Mode Resonator <=SEP=> In this letter, a class of wideband bandpass filters (BPFs) with short-circuited multi-mode resonators (MMRs) is proposed and designed by a synthesis approach. The MMRs are formed by n sections of cascaded transmission lines, which are all set to be one quarter wavelength long with respect to the center frequency of the passband. Short-ended stubs are then added at the two ends of the MMR as inductive coupling elements. For the filter design, a transfer function is derived to characterize the frequency response of the proposed BPF, and it is enforced to apply to the equal-ripple in-band response. As such, the impedance value for each section is determined once the specifications are given. With this method, design curves of different orders and ripple factors are provided to aid the design of a class of wideband BPFs. As a design example, a fifth-order ultra-wide filter is designed, fabricated and measured in the end. The experimental results verify the design approach.

A SELF-RATING DEPRESSION SCALE. <=SEP=> 

Inertial sensor-based knee flexion/extension angle estimation. <=SEP=> A new method for estimating knee joint flexion/extension angles from segment acceleration and angular velocity data is described. The approach uses a combination of Kalman filters and biomechanical constraints based on anatomical knowledge. In contrast to many recently published methods, the proposed approach does not make use of the earth's magnetic field and hence is insensitive to the complex field distortions commonly found in modern buildings. The method was validated experimentally by calculating knee angle from measurements taken from two IMUs placed on adjacent body segments. In contrast to many previous studies which have validated their approach during relatively slow activities or over short durations, the performance of the algorithm was evaluated during both walking and running over 5 minute periods. Seven healthy subjects were tested at various speeds from 1 to 5 mile/h. Errors were estimated by comparing the results against data obtained simultaneously from a 10 camera motion tracking system (Qualysis). The average measurement error ranged from 0.7 degrees for slow walking (1 mph) to 3.4 degrees for running (5 mph). The joint constraint used in the IMU analysis was derived from the Qualysis data. Limitations of the method, its clinical application and its possible extension are discussed.

On Blockchain Applications : Hyperledger Fabric And Ethereum <=SEP=> Blockchain is a tamper-proof digital ledger which can be used to record public or private peer to peer network transactions and it cannot be altered retroactively without the alteration of all subsequent blocks of the network. A blockchain is updated via the consensus protocol that ensures a linear, unambiguous ordering of transactions. Blocks guarantee the integrity and consistency of the blockchain across a network of distributed nodes. Different blockchain applications use various consensus protocols for their working. Byzantine fault tolerance (BFT) is one of them and it is a characteristic of a system that tolerates the class of failures known as the Byzantine Generals Problem. Hyperledger, Stellar, and Ripple are three blockchain application which uses BFT consensus. The best variant of BFT is Practical Byzantine Fault tolerance (PBFT). Hyperledger fabric with deterministic transactions can run on the top of PBFT. This paper focuses on a survey of various consensus mechanisms and makes a comparative study of Hyperledger fabric and Ethereum. Keywords— consensus; hyperledger fabric; ethereum; byzantine fault tolerance;

Suggesting accurate method and class names <=SEP=> Descriptive names are a vital part of readable, and hence maintainable, code. Recent progress on automatically suggesting names for local variables tantalizes with the prospect of replicating that success with method and class names. However, suggesting names for methods and classes is much more difficult. This is because good method and class names need to be functionally descriptive, but suggesting such names requires that the model goes beyond local context. We introduce a neural probabilistic language model for source code that is specifically designed for the method naming problem. Our model learns which names are semantically similar by assigning them to locations, called embeddings, in a high-dimensional continuous space, in such a way that names with similar embeddings tend to be used in similar contexts. These embeddings seem to contain semantic information about tokens, even though they are learned only from statistical co-occurrences of tokens. Furthermore, we introduce a variant of our model that is, to our knowledge, the first that can propose neologisms, names that have not appeared in the training corpus. We obtain state of the art results on the method, class, and even the simpler variable naming tasks. More broadly, the continuous embeddings that are learned by our model have the potential for wide application within software engineering.

ZoomNet: Deep Aggregation Learning for High-Performance Small Pedestrian Detection <=SEP=> It remains very challenging for a single deep model to detect pedestrians of different sizes appears in an image. One typical remedy for the small pedestrian detection is to upsample the input and pass it to the network multiple times. Unfortunately this strategy not only exponentially increases the computational cost but also probably impairs the model effectiveness. In this work, we present a deep architecture, refereed to as ZoomNet, which performs small pedestrian detection by deep aggregation learning without up-sampling the input. ZoomNet learns and aggregates deep feature representations at multiple levels and retains the spatial information of the pedestrian from different scales. ZoomNet also learns to cultivate the feature representations from the classification task to the detection task and obtains further performance improvements. Extensive experimental results demonstrate the state-of-the-art performance of ZoomNet. The source code of this work will be made public available to facilitate further studies on this problem.

Predicting Facial Beauty without Landmarks <=SEP=> A fundamental task in artificial intelligence and computer vision is to build machines that can behave like a human in recognizing a broad range of visual concepts. This paper aims to investigate and develop intelligent systems for learning the concept of female facial beauty and producing human-like predictors. Artists and social scientists have long been fascinated by the notion of facial beauty, but study by computer scientists has only begun in the last few years. Our work is notably different from and goes beyond previous works in several aspects: 1) we focus on fully-automatic learning approaches that do not require costly manual annotation of landmark facial features but simply take the raw pixels as inputs; 2) our study is based on a collection of data that is an order of magnitude larger than that of any previous study; 3) we imposed no restrictions in terms of pose, lighting, background, expression, age, and ethnicity on the face images used for training and testing. These factors significantly increased the difficulty of the learning task. We show that a biologically-inspired model with multiple layers of trainable feature extractors can produce results that are much more human-like than the previously used eigenface approach. Finally, we develop a novel visualization method to interpret the learned model and revealed the existence of several beautiful features that go beyond the current averageness and symmetry hypotheses.

Distributed Hessian-Free Optimization for Deep Neural Network <=SEP=> Training deep neural network is a high dimensional and a highly non-convex optimization problem. In this paper, we revisit Hessian-free optimization method for deep networks with negative curvature direction detection. We also develop its distributed variant and demonstrate superior scaling potential to SGD, which allows more efficiently utilizing larger computing resources thus enabling large models and faster time to obtain desired solution. We show that these techniques accelerate the training process for both the standard MNIST dataset and also the TIMIT speech recognition problem, demonstrating robust performance with upto an order of magnitude larger batch sizes. This increased scaling potential is illustrated with near l inear speed-up on upto 32 CPU nodes for a simple 4-layer network.

Deep Multi-User Reinforcement Learning for Distributed Dynamic Spectrum Access <=SEP=> We consider the problem of dynamic spectrum access for network utility maximization in multichannel wireless networks. The shared bandwidth is divided into  $K$  orthogonal channels. In the beginning of each time slot, each user selects a channel and transmits a packet with a certain transmission probability. After each time slot, each user that has transmitted a packet receives a local observation indicating whether its packet was successfully delivered or not (i.e., ACK signal). The objective is a multi-user strategy for accessing the spectrum that maximizes a certain network utility in a distributed manner without online coordination or message exchanges between users. Obtaining an optimal solution for the spectrum access problem is computationally expensive, in general, due to the large-state space and partial observability of the states. To tackle this problem, we develop a novel distributed dynamic spectrum access algorithm based on deep multi-user reinforcement leaning. Specifically, at each time slot, each user maps its current state to the spectrum access actions based on a trained deep-Q network used to maximize the objective function. Game theoretic analysis of the system dynamics is developed for establishing design principles for the implementation of the algorithm. The experimental results demonstrate the strong performance of the algorithm.

Multiple memory systems as substrates for multiple decision systems <=SEP=> It has recently become widely appreciated that value-based decision making is supported by multiple computational strategies. In particular, animal and human behavior in learning tasks appears to include habitual responses described by prominent model-free reinforcement learning (RL) theories, but also more deliberative or goal-directed actions that can be characterized by a different class of theories, model-based RL. The latter theories evaluate actions by using a representation of the contingencies of the task (as with a learned map of a spatial maze), called an "internal model." Given the evidence of behavioral and neural dissociations between these approaches, they are often characterized as dissociable learning systems, though they likely interact and share common mechanisms. In many respects, this division parallels a longstanding dissociation in cognitive neuroscience between multiple memory systems, describing, at the broadest level, separate systems for declarative and procedural learning. Procedural learning has notable parallels with model-free RL: both involve learning of habits and both are known to depend on parts of the striatum. Declarative memory, by contrast, supports memory for single events or episodes and depends on the hippocampus. The hippocampus is thought to support declarative memory by encoding temporal and spatial relations among stimuli and thus is often referred to as a relational memory system. Such relational encoding is likely to play an important role in learning an internal model, the representation that is central to model-based RL. Thus, insofar as the memory systems represent more general-purpose cognitive mechanisms that might subserve performance on many sorts of tasks including decision making, these parallels raise the question whether the multiple decision systems are served by multiple memory systems, such that one dissociation is grounded in the other. Here we investigated the relationship between model-based RL and relational memory by comparing individual differences across behavioral tasks designed to measure either capacity. Human subjects performed two tasks, a learning and generalization task (acquired equivalence) which involves relational encoding and depends on the hippocampus; and a sequential RL task that could be solved by either a model-based or model-free strategy. We assessed the correlation between subjects' use of flexible, relational memory, as measured by generalization in the acquired equivalence task, and their differential reliance on either RL strategy in the decision task. We observed a significant positive relationship between generalization and model-based, but not model-free, choice strategies. These results are consistent with the hypothesis that model-based RL, like acquired equivalence, relies on a more general-purpose relational memory system.

ADDITIVE LOGISTIC REGRESSION : A STATISTICAL VIEW OF BOOSTING <=SEP=> Boosting is one of the most important recent developments in classification methodology. Boosting works by sequentially applying a classification algorithm to reweighted versions of the training data and then taking a weighted majority vote of the sequence of classifiers thus produced. For many classification algorithms, this simple strategy results in dramatic improvements in performance. We show that this seemingly mysterious phenomenon can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood. For the two-class problem, boosting can be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multiclass generalizations based on multinomial likelihood are derived that exhibit performance comparable to other recently proposed multiclass generalizations of boosting in most situations, and far superior in some. We suggest a minor modification to boosting that can reduce computation, often by factors of 10 to 50. Finally, we apply these insights to produce an alternative formulation of boosting decision trees. This approach, based on best-first truncated tree induction, often leads to better performance, and can provide interpretable descriptions of the aggregate decision rule. It is also much faster computationally, making it more suitable to large-scale data mining applications.

Mass detection on mammogram images : A first assessment of deep learning techniques <=SEP=> Deep Learning approaches have gathered a lot of attention lately. In this work, we study their application to the breast cancer field, in particular for mass detection in mammograms. Several experiments were made on a real mammogram benchmark dataset. Deep Learning approaches were compared to other classification methodologies. It was concluded that, although useful, the implementation used does not outperform SVMs. Further study and adjustment of the method for this application is needed.

Open-set Plant Identification Using an Ensemble of Deep Convolutional Neural Networks <=SEP=> Open-set recognition, a challenging problem in computer vision, is concerned with identification or verification tasks where queries may belong to unknown classes. This work describes a fine-grained plant identification system consisting of an ensemble of deep convolutional neural networks, within an open-set identification framework. Two wellknown deep learning architectures of VGGNet and GoogLeNet, pretrained on the object recognition dataset of ILSVRC 2012, are fine-tuned using the plant dataset of LifeCLEF 2015. Moreover, GoogLeNet is finetuned using plant and non-plant images, to serve for rejecting samples from non-plant classes. Our systems have been evaluated on the test dataset of PlantCLEF 2016 by the campaign organizers and the best proposed model has achieved an official score of 0.738 in terms of the mean average precision, while the best official score was announced to be 0.742.

Real time hand pose estimation using depth sensors <=SEP=> This paper describes a depth image based real-time skeleton fitting algorithm for the hand, using an object recognition by parts approach, and the use of this hand modeler in an American Sign Language (ASL) digit recognition application. In particular, we created a realistic 3D hand model that represents the hand with 21 different parts. Random decision forests (RDF) are trained on synthetic depth images generated by animating the hand model, which are then used to perform per pixel classification and assign each pixel to a hand part. The classification results are fed into a local mode finding algorithm to estimate the joint locations for the hand skeleton. The system can process depth images retrieved from Kinect in real-time at 30 fps. As an application of the system, we also describe a support vector machine (SVM) based recognition module for the ten digits of ASL based on our method, which attains a recognition rate of 99.9% on live depth images in real-time1.

A Microstrip Ultra-Wideband Bandpass Filter With Cascaded Broadband Bandpass and Bandstop Filters <=SEP=> This paper develops a novel ultra-wideband bandpass filter by cascading a broadband bandpass filter with another broadband bandstop filter. Properly selected impedances of transmission lines achieve broadband bandpass and bandstop filters and make independent designs possible. Detailed design and synthesis procedures are provided; moreover, agreement between measured and theoretically predicted results demonstrates feasibility of the proposed filter. Due to its simple structure, the ultra-wideband bandpass filter newly introduced in this paper is suitable for integration in the single-chipped circuit or implementation on printed circuit boards.

An Evaluation Framework for Plagiarism Detection <=SEP=> We present an evaluation framework for plagiarism detection.1 The framework provides performance measures that address the specifics of plagiarism detection, and the PAN-PC-10 corpus, which contains 64 558 artificial and 4 000 simulated plagiarism cases, the latter generated via Amazon’s Mechanical Turk. We discuss the construction principles behind the measures and the corpus, and we compare the quality of our corpus to existing corpora. Our analysis gives empirical evidence that the construction of tailored training corpora for plagiarism detection can be automated, and hence be done on a large scale.

A Review of Window Query Processing for Data Streams <=SEP=> In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control. Category: Ubiquitous computing

Current-mode sensorless control of single-phase brushless DC fan motors <=SEP=> This paper proposes a new control scheme for the implementation of a low-cost and high efficiency sensorless speed control IC for single-phase brushless dc (BLDC) fan motors. The proposed control scheme detects the zero-crossing-point (ZCP) of the measured back-EMF to generate commutation signals without Hall sensor. A current mode soft switching scheme is used to smooth the current spikes induced by the reduction of the back-EMF when the rotor is crossing the commutation boundary. An adaptive blanking time control strategy is used to adjust the time interval to ensure correct detection of the ZCP. An open-loop constant Ampere/Hertz ramping control scheme is developed for the startup control from zero speed and switching to sensorless mode once the ZCP is detected. The proposed sensorless control scheme has been verified by using computer simulation based on a developed single-phase BLDC fan motor model. Experimental verification of the proposed control scheme has been carried out by using digital implementation technique. Experimental results reveal the superior performance of the proposed control scheme.

Semi-supervised time series classification <=SEP=> The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data. In reality, such data may be very difficult or expensive to obtain. For example, it may require the time and expertise of cardiologists, space launch technicians, or other domain specialists. As in many other domains, there are often copious amounts of unlabeled data available. For example, the PhysioBank archive contains gigabytes of ECG data. In this work we propose a semi-supervised technique for building time series classifiers. While such algorithms are well known in text domains, we will show that special considerations must be made to make them both efficient and effective for the time series domain. We evaluate our work with a comprehensive set of experiments on diverse data sources including electrocardiograms, handwritten documents, and video datasets. The experimental results demonstrate that our approach requires only a handful of labeled examples to construct accurate classifiers.

High-Power Pulse Generator With Flexible Output Pattern <=SEP=> This paper presents a high-voltage bipolar rectangular pulse generator using a solid-state boosting front-end and an H-bridge output stage. The topology generates rectangular pulses with fast enough rise time and allows easy step-up input voltage. In addition, the circuit is able to adjust positive or negative pulsewidth, dead time between two pulses, and operating frequency. The topology can also be controlled to produce unipolar pulses and other pulse patterns without changing its configuration. With an appropriate dc source, the output voltage can also be adjusted to requirements of different applications. The intended application for such a circuit is algal cell membrane rupture for oil extraction, although additional applications, include biotechnology and plasma sciences, medicine, and food industry. A 1 kV/200 A bipolar solid-state pulse generator was fabricated to validate the theoretical analysis presented in this paper. In addition, to validate the analysis with simulations and prototype tests, biological test were conducted in order to examine the technical value of the proposed circuit. These evaluations seem to suggest that oil production rate from bipolar pulses may double that of an equivalent process with unipolar pulses.

X CLAIM : Interoperability with Cryptocurrency-Backed Tokens ? <=SEP=> Building trustless cross-blockchain trading protocols is challenging. Therefore, centralized liquidity providers remain the preferred route to execute transfers across chains — which fundamentally contradicts the purpose of permissionless ledgers to replace trusted intermediaries. Enabling crossblockchain trades could not only enable currently competing blockchain projects to better collaborate, but seems of particular importance to decentralized exchanges as those are currently limited to the trade of digital assets within their respective blockchain ecosystem. In this paper we systematize the notion of cryptocurrencybacked tokens, an approach towards trustless cross-chain communication. We propose XCLAIM, a protocol for issuing, trading, and redeeming e.g. Bitcoin-backed tokens on Ethereum. We provide implementations for three possible protocol versions and evaluate their security and on-chain costs. With XCLAIM, it costs at most USD 1.17 to issue an arbitrary amount of Bitcoinbacked tokens on Ethereum, given current blockchain transaction fees. Our protocol requires no modifications to Bitcoin’s and Ethereum’s consensus rules and is general enough to support other cryptocurrencies.

Reading comprehension and its underlying components in second-language learners: A meta-analysis of studies comparing first- and second-language learners. <=SEP=> We report a systematic meta-analytic review of studies comparing reading comprehension and its underlying components (language comprehension, decoding, and phonological awareness) in first- and second-language learners. The review included 82 studies, and 576 effect sizes were calculated for reading comprehension and underlying components. Key findings were that, compared to first-language learners, second-language learners display a medium-sized deficit in reading comprehension (pooled effect size d = -0.62), a large deficit in language comprehension (pooled effect size d = -1.12), but only small differences in phonological awareness (pooled effect size d = -0.08) and decoding (pooled effect size d = -0.12). A moderator analysis showed that characteristics related to the type of reading comprehension test reliably explained the variation in the differences in reading comprehension between first- and second-language learners. For language comprehension, studies of samples from low socioeconomic backgrounds and samples where only the first language was used at home generated the largest group differences in favor of first-language learners. Test characteristics and study origin reliably contributed to the variations between the studies of language comprehension. For decoding, Canadian studies showed group differences in favor of second-language learners, whereas the opposite was the case for U.S. studies. Regarding implications, unless specific decoding problems are detected, interventions that aim to ameliorate reading comprehension problems among second-language learners should focus on language comprehension skills.