Numerous techniques mine change data captured in software archives to assist software engineering efforts. These change-based approaches typically analyze change sets – groups of co-committed changes – under the assumption that the development work represented by change sets is both meaningful and related to a single change task. However, we have found that change sets often violate this assump...

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

We propose an interaction technique for manipulating precise data or selecting one element from a large number of items. Although conventional graphical interaction tools like sliders cannot be used for selecting more items than the pixel size of the slider, we can specify more precise data by using the elastic slider based on the rubber-band metaphor, where a control object can be moved by pul...

This paper introduces discretionary imprecise data in Data Envelopment Analysis (DEA) and discusses the efficiency evaluation of Decision Making Units (DMUs) with non-discretionary imprecise data. Then, suggests a method for evaluation the efficiency of DMUs with non-discretionary imprecise data. When some inputs and outputs are imprecise and non-discretionary, the DEA model becomes non-linear ...

Atomic coordinates in the Worldwide Protein Data Bank (wwPDB) are generally reported to greater precision than the experimental structure determinations have actually achieved. By using information theory and data compression to study the compressibility of protein atomic coordinates, it is possible to quantify the amount of randomness in the coordinate data and thereby to determine the realist...

a new algorithm for classification of dmus to efficient and inefficient units in data envelopment analysis is presented. this algorithm uses the non-archimedean charnes-cooper-rhodes[1] (ccr) model. also, it applies an assurance value for the non-archimedean                          using only simple computations on inputs and outputs of dmus (see [18]). the convergence and efficiency of the ne...

While sophisticated research infrastructures assist scientists in managing massive volumes of data, the so-called long tail of research data frequently suffers from a lack of such services. This is mostly due to the complexity caused by the variety of data to be managed and a lack of easily standardiseable procedures in highly diverse research settings. Yet, as even domains in this long tail of...