An Extended Replication of an Experiment for Assessing Methods for Software Requirements Inspections

We have performed an extended replication of the Porter-Votta-Basili experiment comparing the Scenario method and the Checklist method for inspecting requirements specifications using identical instruments. The experiment has been conducted in our educational context represented by a more general definition of a defect compared to the original defect list. Our study involving 24 undergraduate students manipulated three independent variables: detection method, requirements specification, and the order of the inspections. The dependent variable measured is the defect detection rate. We found the requirements specification inspected and not the detection method to be the most probable explanation for the variance in defect detection rate. This suggests that it is important to gather knowledge of how a requirements specification can convey an understandable view of the product and to adapt inspection methods accordingly. Contrary to the original experiment, we can not significantly support the superiority of the Scenario method. This is in accordance with a replication conducted by Fusaro, Lanubile and Visaggio, and might be explained by the lack of individual defect detection skill of our less experienced subjects.     

The estimation of efficacy of oral iron supplementation during treatment with epoetin beta (recombinant human erythropoietin) in patients undergoing cardiac surgery

OBJECTIVE: Quantitative evaluation of radiographic methods proposed to improve the detection of joint space narrowing (JSN) in femorotibial osteoarthritis (OA). METHODS: Thirty-two consecutive patients with knee OA and five normal controls had three different weight-bearing radiographs of the knee: (1) anteroposterior film of both knees in full extension (extended knees), (2) anteroposterior film of one knee in extension while the patient was standing on the homolateral foot (standing on homolateral foot), (3) posteroanterior film of both knees flexed at 30 degrees (schuss view). Joint space was analyzed blind using both an evaluation of JSN with a six-grade scale (JSN score) and an image analyser computer measurement of the mean joint space width (mean JSW). The medial compartment of medial femorotibial OA knees, the lateral compartment of lateral femorotibial OA knees, as well as both compartments of control knees, were measured. Extended knee and schuss views were made 1 year later in 10 patients for the evaluation of sensitivity to change. RESULTS: The JSN scores +/- S.D. in schuss, standing on the homolateral foot and extended knee views were 2.75 +/- 1.31, 1.95 +/- 1.3 and 1.66 +/- 1.27, respectively. The mean JSW +/- S.D. in schuss, standing on the homolateral foot, and extended knee views were 2.9 +/- 1.9 mm, 3.5 +/- 1.6 mm and 3.8 +/- 1.5 mm, respectively. Changes in JSN scores and mean JSW with schuss view increased with OA severity. In controls, JSW of the medial compartment did not vary in the three views. JSW of the lateral compartment of controls was significantly larger in the schuss view. The change in JSW after 1 year was -0.41 mm (P = 0.02) in the schuss view and -0.17 mm (P > 0.05) in the extended knee view. CONCLUSION: The schuss view is suggested as the most accurate method for the evaluation of JSW in femorotibial OA.     

Fe calculations of stress fields from cracks located at the fusion line of weldments

This paper investigates the stress fields for a crack located at the fusion line of a weldment. The strength mis-matching and the size of the HAZ were varied, and the corresponding distribution of the maximum principal stress was examined. The weld metal strength was globally overmatched with respect to the base material, but locally over- and undermatched with respect to the heat affected zone. Three cases of mis-match were compared, and it was found that reducing the strength of the HAZ lowered the maximum principal stresses.     

On security arguments of the second round SHA-3 candidates

In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the design of a new cryptographic hash algorithm in response to vulnerabilities like differential attacks identified in existing hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. 14 candidates were left in the second round, out of which five candidates have been recently chosen for the final round. An important criterion in the selection process is the SHA-3 hash function security. We identify two important classes of security arguments for the new designs: (1) the possible reductions of the hash function security to the security of its underlying building blocks and (2) arguments against differential attack on building blocks. In this paper, we compare the state of the art provable security reductions for the second round candidates and review arguments and bounds against classes of differential attacks. We discuss all the SHA-3 candidates at a high functional level, analyze, and summarize the security reduction results and bounds against differential attacks. Additionally, we generalize the well-known proof of collision resistance preservation, such that all SHA-3 candidates with a suffix-free padding are covered.     

Loveparade 2010: Automatic video analysis of a crowd disaster

On July 24, 2010, 21 people died and more than 500 were injured in a stampede at the Loveparade, a music festival, in Duisburg, Germany. Although this tragic incident is but one among many terrible crowd disasters that occur during pilgrimage, sports events, or other mass gatherings, it stands out for it has been well documented: there were a total of seven security cameras monitoring the Loveparade and the chain of events that led to disaster was meticulously reconstructed.In this paper, we present an automatic, video-based analysis of the events in Duisburg. While physical models and simulations of human crowd behavior have been reported before, to the best of our knowledge, automatic vision systems that detect congestions and dangerous crowd turbulences in real world settings were not reported yet. Derived from lessons learned from the video footage of the Loveparade, our system is able to detect motion patterns that characterize crowd behavior in stampedes. Based on our analysis, we propose methods for the detection and early warning of dangerous situations during mass events. Since our approach mainly relies on optical flow computations, it runs in real-time and preserves privacy of the people being monitored.     

Improving sub-pixel accuracy for long range stereo

Dense stereo algorithms are able to estimate disparities at all pixels including untextured regions. Typically these disparities are evaluated at integer disparity steps. A subsequent sub-pixel interpolation often fails to propagate smoothness constraints on a sub-pixel level.We propose to increase the sub-pixel accuracy in low-textured regions in four possible ways: First, we present an analysis that shows the benefit of evaluating the disparity space at fractional disparities. Second, we introduce a new disparity smoothing algorithm that preserves depth discontinuities and enforces smoothness on a sub-pixel level. Third, we present a novel stereo constraint (gravitational constraint) that assumes sorted disparity values in vertical direction and guides global algorithms to reduce false matches, especially in low-textured regions. Finally, we show how image sequence analysis improves stereo accuracy without explicitly performing tracking. Our goal in this work is to obtain an accurate 3D reconstruction. Large-scale 3D reconstruction will benefit heavily from these sub-pixel refinements.Results based on semi-global matching, obtained with the above mentioned algorithmic extensions are shown for the Middlebury stereo ground truth data sets. The presented improvements, called ImproveSubPix, turn out to be one of the top-performing algorithms when evaluating the set on a sub-pixel level while being computationally efficient. Additional results are presented for urban scenes. The four improvements are independent of the underlying type of stereo algorithm.     

A globally optimal estimator for the delta-lognormal modeling of fast reaching movements

Fast reaching movements are an important component of our daily interaction with the world and are consequently under investigation in many fields of science and engineering. Today, useful models are available for such studies, with tools for solving the inverse dynamics problem involved by these analyses. These tools generally provide a set of model parameters that allows an accurate and locally optimal reconstruction of the original movements. Although the solutions that they generate may provide a data curve fitting that is sufficient for some pattern recognition applications, the best possible solution is often necessary in others, particularly those involving neuroscience and biomedical signal processing. To generate these solutions, we present a globally optimal parameter extractor for the delta-lognormal modeling of reaching movements based on the branch-and-bound strategy. This algorithm is used to test the impact of white noise on the delta-lognormal modeling of reaching movements and to benchmark the state-of-the-art locally optimal algorithm. Our study shows that, even with globally optimal solutions, parameter averaging is important for obtaining reliable figures. It concludes that physiologically derived rules are necessary, in addition to global optimality, to achieve meaningful ?Λ extractions which can be used to investigate the control patterns of these movement primitives.     

Clones: what is that smell?

Clones are generally considered bad programming practice in software engineering folklore. They are identified as a bad smell?(Fowler et?al. 1999) and a major contributor to project maintenance difficulties. Clones inherently cause code bloat, thus increasing project size and maintenance costs. In this work, we try to validate the conventional wisdom empirically to see whether cloning makes code more defect prone. This paper analyses the relationship between cloning and defect proneness. For the four medium to large open source projects that we studied, we find that, first, the great majority of bugs are not significantly associated with clones. Second, we find that clones may be less defect prone than non-cloned code. Third, we find little evidence that clones with more copies are actually more error prone. Fourth, we find little evidence to support the claim that clone groups that span more than one file or directory are more defect prone than collocated clones. Finally, we find that developers do not need to put a disproportionately higher effort to fix clone dense bugs. Our findings do not support the claim that clones are really a “bad smell”?(Fowler et?al. 1999). Perhaps we can clone, and breathe easily, at the same?time.     

A digital library framework for heterogeneous music collections: from document acquisition to cross-modal interaction

In this paper, we present a digital library system for managing heterogeneous music collections. The heterogeneity refers to various document types and formats as well as to different modalities, e. g., CD-audio recordings, scanned sheet music, and lyrics. The system offers a full-fledged, widely automated document processing chain: digitization, indexing, annotation, access, and presentation. Our system is implemented as a generic and modular music repository based on a service-oriented software architecture. As a particular strength of our approach, the various documents representing aspects of a piece of music are jointly considered in all stages of the document processing chain. Our user interfaces allow for a multimodal and synchronized presentation of documents (WYSIWYH: what you see is what you hear), a score- or lyrics-based navigation in audio, as well as a cross- and multimodal retrieval. Hence, our music repository may be called a truly cross-modal library system. In our paper, we describe the system components, outline the techniques of the document processing chain, and illustrate the implemented functionalities for user interaction. We describe how the system is put into practice at the Bavarian State Library (BSB) Munich as a part of the German PROBADO Digital Library Initiative (PDLI).     

A population-based iterated greedy algorithm for the minimum weight vertex cover problem

Given an undirected, vertex-weighted graph, the goal of the minimum weight vertex cover problem is to find a subset of the vertices of the graph such that the subset is a vertex cover and the sum of the weights of its vertices is minimal. This problem is known to be NP-hard and no efficient algorithm is known to solve it to optimality. Therefore, most existing techniques are based on heuristics for providing approximate solutions in a reasonable computation time.Population-based search approaches have shown to be effective for solving a multitude of combinatorial optimization problems. Their advantage can be identified as their ability to find areas of the space containing high quality solutions. This paper proposes a simple and efficient population-based iterated greedy algorithm for tackling the minimum weight vertex cover problem. At each iteration, a population of solutions is established and refined using a fast randomized iterated greedy heuristic based on successive phases of destruction and reconstruction. An extensive experimental evaluation on a commonly used set of benchmark instances shows that our algorithm outperforms current state-of-the-art approaches.