Tracking of a reported bug for fixing is a fascinating area of research in software engineering. Many open source, free and commercial bug tracking tools have been developed and are currently under development. The industry needs criteria to select the best tool among the available set of tools that will help in fixing and tracking the progress of bug fixes. In this paper, we use BugZilla, Jira...

The objective of this study is to identify CR characteristics associated with the CR-fixing duration in the testing phase. Our data set associated with CR-fixing duration includes censored data [1], which censoring arises by discarding the CR because it turns out not actually CR. Although CR-fixing duration of censored data is not known, censored data has a partial information that CRfixing is ...

We investigate utilizing the integer programming (IP) technique of reduced cost fixing to improve maximum satisfiability (MaxSAT) solving. In particular, we show how reduced cost fixing can be used within the implicit hitting set approach (IHS) for solving MaxSAT. Solvers based on IHS have proved to be quite effective for MaxSAT, especially on problems with a variety of clause weights. The uniq...

In [17, 18] we presented a pairing based DAA protocol in the asymmetric setting, along with a “security proof”. Jiangtao Li has pointed out to us an attack against this published protocol, thus our prior work should not be considered sound. In this paper we give a repaired version, along with a highly detailed security proof. A full paper will be made available shortly. However in the meantime ...

We develop statistical enumeration methods for self-avoiding walks using a powerful sampling technique called the multicanonical Monte Carlo method. Using these methods, we estimate the numbers of the two dimensional N-step self-avoiding walks up to N = 256 with statistical errors. The developed methods are based on statistical mechanical models of paths which include self-avoiding walks. The c...

Use of alternate substrates (acetylene, azide, cyanide) for estimating N(2) fixation confirmed that recombined fractions from different bacteria are functional but restricted in complementarity.

An (n, k)-bit-fixing source is a distribution on n bit strings, that is fixed on n − k of the coordinates, and jointly uniform on the remaining k bits. Explicit constructions of bit-fixing extractors by Gabizon, Raz and Shaltiel [SICOMP 2006] and Rao [CCC 2009], extract (1 − o(1)) · k bits for k = poly log n, almost matching the probabilistic argument. Intriguingly, unlike other well-studied so...