Do Information Retrieval Algorithms for Automated Traceability Perform Effectively on Issue Tracking System Data?

Author(s):  
Thorsten Merten ◽  
Daniel Krämer ◽  
Bastian Mager ◽  
Paul Schell ◽  
Simone Bürsner ◽  
...  
Author(s):  
Kevin Giordano ◽  
Meredith Chaput ◽  
Adam Anz ◽  
Jeremy Braziel ◽  
James Andrews ◽  
...  

AbstractThe purpose of this study was to describe the knee kinetics of baseball hitting, develop a tool to predict knee kinetics from easily obtainable measures, and to compare knee kinetics to other exercises along the rehabilitation continuum to determine a timeline for when hitting may resume after ACL reconstruction. Nineteen high school baseball athletes (16.3±0.8 yrs, 180.6±5.7 cm, 78.4±10.8 kg) participated. Participants took ten swings off a tee. Kinetic data were recorded using an electromagnetic tracking system. Data from swings with the top three exit velocities were averaged for analysis. Linear regressions were used to determine if predictors of height, mass, age and exit velocity could predict the following torques: bilateral knee net, extension, internal and external rotation, valgus and varus torque; and anterior force. Backwards regression models revealed independent variables could significantly predict front knee net, internal and external rotation, extension, and varus torque, and anterior force; and back knee net and valgus torque. Based on the kinetics of baseball hitting compared to those of rehabilitation exercises, if the involved knee is the front, we suggest tee hitting may be initiated at 13 weeks after ACL reconstruction. If the involved knee is the back, we suggest tee hitting may initiated at 17 weeks after ACL reconstruction.


2004 ◽  
pp. 159-169 ◽  
Author(s):  
Michael Cornelson ◽  
Ed Greengrass ◽  
Robert L. Grossman ◽  
Ron Karidi ◽  
Daniel Shnidman

2021 ◽  
Author(s):  
Shirin Akbarinasaji

Background: Bug tracking systems receive many bug reports daily. Although the software quality team aims to identify and resolve these bugs, they are never able to fix all of the reported bugs in the issue tracking system before the release deadline. However, postponing the bug fixing may have some consequences. Prioritization of bug reports will help the software manager decide which bugs to fix and which bugs to postpone. Typically, bug reports are prioritized based on the severity, priority, time and effort for fixing, customer pressure, etc. Aim: Previous studies have shown that these factors may not be appropriate for prioritization. Therefore, relying on them to automate bug prioritization might be misleading. In this dissertation, we aim to prioritize bug reports with respect to the consequence of not fixing the bugs in terms of their relative importance in the issue tracking system. Method: In order to measure the relative importance of bugs in the issue tracking system, we propose the construction of a dependency graph based on the reported dependency-blocking information in the issue tracking system. Two metrics, namely depth and degree, are used to measure the relative importance of the bugs. However, there is uncertainty in the dependency graph structure as the dependency information is discovered manually and gradually. Owing to this uncertainty, prioritization of bugs in the descending order of depth and degree may be misleading. To handle the uncertainty, we propose a novel approach of a partially observable Markov decision process (POMDP) and partially observable Monte Carlo planning (POMCP). Result: To check the feasibility of the proposed approach, we analyzed seven years of data from an open source project, Firefox, and a commercial project. We compared the proposed policy with the developer policy, maximum policy, and random policy. Conclusion: The results suggest that software practitioners do not consider the relative importance of bugs in their current practice. The proposed framework can be combined with practitioners’ expertise to prioritize bugs more effectively and take the depth and degree of bugs into account. In practice, the POMDP framework with the POMCP planner can help practitioners sequentially select bugs to minimize the connectivity of the dependency graph.


2008 ◽  
Author(s):  
Shree D. Chhatwal ◽  
Stuart J. Rose
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document