Software Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency
|
|
- Flora Gibbs
- 5 years ago
- Views:
Transcription
1 Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science & Engineering Department National aiwan University he Chinese University of Hong Kong aipei, aiwan Shatin, Hong Kong Abstract Many stuies have been performe on the subject of software reliability, but few explicitly consier the impact of software testing on the reliability process. his paper presents two important issues on software reliability moeling an software reliability economics: testing effort an efficiency. First, we will iscuss on how to exten the logistic testing-effort function into a general form. he generalize logistic testing-effort function has the avantage of relating the work profile more irectly to the natural flow of software evelopment. herefore, it can be use to escribe the actual consumption of resources uring software evelopment process an get a conspicuous improvement in moeling testing-effort expenitures. Furthermore, we will incorporate the generalize logistic testing-effort function into software reliability moeling an its fault-preiction capability is evaluate through four numerical experiments on real ata. hen, we will aress the effects of automate techniques or tools on increasing the efficiency of software testing. New testing techniques will usually increase test coverage. We propose a moifie software reliability cost moel to reflect these effects. From the simulation results, we obtain a powerful software economic policy which clearly inicates the benefits of applying new automate testing techniques an tools uring software evelopment process.. Introuction When computer applications permeate our aily life, reliability becomes a very important characteristic of a computer system. In moern society, computer-controlle an computer-embee systems heavily epen on the Sy-Yen Kuo is with A& Labs-Research, New Jersey. He is on leave from National aiwan University, aipei, aiwan. correct performance of software. Software reliability is one of the most important features for a critical system which can affect human s life. herefore, it is necessary to measure an control the reliability of a software system. A number of Software Reliability Growth Moels (SRGMs) have been propose [, 6]. Among these moels, Goel an Okumoto consiere an NHPP as the stochastic process to escribe the fault process []. Yamaa et al. [-] moifie the G-O moel an incorporate the concept of testing-effort in an NHPP moel to get a better escription of the software fault phenomenon. Later, we [7-8] also propose a new software reliability growth moel with the logistic testing-effort function. In this paper, we exten the logistic testing-effort function to a generalize form. he generalize logistic testing-effort function has the avantage of relating a work profile more irectly to the natural structure of the software evelopment. herefore, it can be use to pertinently escribe the resource consumption uring the software evelopment process an get a conspicuous improvement in moeling the istribution of testing-effort expenitures. In general, we will have more confience in the measure software reliability with more software tests. Unfortunately, testing with ineffective or reunant test cases may lea to excessive cost. o avoi such phenomenon, we nee to know when to stop testing. One alternative is to restrict the test ata such that testing will stop when the os of etecting aitional faults (estimate by SRGMs) are very low. But this may not be realistic since testers typically want to test for all possible valuable failure ata, even the cost of testing is significant. Okumoto an Goel [] first iscusse the software optimal release policy from the cost-benefit viewpoint an propose a software reliability cost moel. It was shown that the optimal software release time can be obtaine base on a cost criterion when minimizing the total expecte cost. Recently, many papers iscusse such optimal software release time problem base on the cost-reliability relationship [4-6, 8-,, 8-9,, 4]. In
2 fact, to etect aitional faults uring the test phase of a software evelopment process, the testers or ebuggers may use some new automate tools or methos that are just iscovere an become available. hese tools, techniques or methos can greatly help the evelopers an testers to create tests an eliminate some reunant test cases. As time progresses, they can etect aitional faults uring testing, which saves the greater expense of correcting faults uring the operational phase. hese approaches have improve software testing an prouctivity recently, allowing project managers to maximize software reliability. Hence the extra cost trae-off base on new techniques an tools can be consiere in software reliability cost moel an viewe as the investment require to improve long-term competitiveness an to spee up the software prouct release in the commercial market. In this paper, we propose a new reliability cost moel that provies a means of assessing whether the software cost is uner control an the software quality is improving with time. he methos we propose allow the software testers an software quality assurance (SQA) engineers to ecie when the software is likely to be of aequate quality for release.. Relationship between SRGM an testing-effort function In this section we propose a set of generalize software reliability growth moels incorporating testing-effort functions. he mathematical relationship between reliability moels an testing effort expenitures is explicitly escribe in etail. Numerical results are given to illustrate the avantage of this new approach.. Software reliability moeling escriptions.. Review of SRGM with Logistic testing-effort function A typical software reliability moel is base on the following assumptions []:. he fault removal process is moele by a Non Homogeneous Poisson Process (NHPP).. he software system is subject to failures at ranom times cause by manifestation of remaining faults in the system.. he mean number of faults etecte in the time interval (t, t+ t] to the current testing-effort is proportional to the mean number of remaining faults in the system at time t. 4. he proportionality is a constant over time. 5. esting effort expenitures are escribe by a Logistic testing-effort function. 6. Each time a failure occurs, the fault that cause it is immeiately remove an no new faults are introuce. Base on the thir assumption, we obtain the following ifferential equation: m( r [ a m( ] () t Solving the above ifferential equation uner the bounary conition m()= (i.e., the mean value function m( must be equal to zero at time ), we have m(=a(-exp[-r(w(-w())])=a(-exp[-rw (]) () where m( is the expecte mean number of faults etecte in time (, t], is the current testing-effort consumption at time t, a is the expecte number of initial faults, an r> is the error etection rate per unit testing-effort at time t. Eq. () is an NHPP moel with mean value function consiering the testing-effort consumption. From the above escription, we know that represents the current testing-effort consumption (such asvolume of test cases, human power, CPU time, an so on) at time t uring the software testing/ebugging phase. he consume testing-effort can inicate how effective the faults are etecte in the software. herefore, this function plays an important role in moeling software reliability an it can be escribe by ifferent istributions. From the stuies in [-5, 4], several testing-effort pattern expressions, such as Exponential, Rayleigh, an Weibull-type curves, can be applie. Moreover, we [7-8] propose a Logistic testing-effort function to escribe the possible test effort patterns, in which the current testing-effort consumption is NA exp[ t] NA () Aexp[ t] t t (exp[ ] Aexp[ ]) where N is the total amount of testing effort to be eventually consume, isthe consumption rate of testing-effort expenitures, an A is a constant. he cumulative testing effort consumption of Logistic testing-effort function in time (, t] is W ( N A exp[ t] (4) an t W ( ) (5) Besies,the testing effort reaches its maximum value at time ln A tmax (6)
3 .. A generalize Logistic testing-effort function From the previous stuies in [7-8], we know that the Logistic testing-effort function (i.e. the Parr moel [4]) is base on a escription of the actual software evelopment process an can be use to escribe the work profile of software evelopment. In aition, this function can be use to consier an evaluate the effects of possible improvements on software evelopment methoology, such as top-own esign or stepwise refinement. herefore, if we relax some assumptions when eriving the original Parr moel an take into account the structure evelopment effort, we obtain a generalize Logistic testing-effort function as: / ( ( ) / ) W t N (7) t Ae where is a structuring inex with a large value for moeling well-structure software evelopment efforts, an is a constant. If =, the above equation becomes N W ( t Ae (8) If is viewe as a normalize constant an the above equation is reuce to Eq. (4). Similarly, if =, we have N W ( t Ae (9) Similarly, if we set, we get a more generalize an plain solution for escribing the cumulative testing effort consumption in time (, t]: N W ( () t Ae In this case,the testing effort reaches its maximum value at time A t max ln( ) / (). Numerical examples.. Numerical example he first ata set is from Ohba [7] where the testing time is measure in CPU hours. he Maximum Likelihoo Estimation an Least Squares Estimation are use to estimate the parameters of Eq. (), Eq. (4), an Eq. (), an we substitute the calculate normalizing value for. he estimate values of parameters for the generalize logistic testing-effort function are liste in able. From able, =.66 is the real estimate value for the first ata set an the other possible values of are pre-calculate. Figure epicts the fitting of the estimate current testing effort by using generalize logistic testing-effort function, in which we fin that the peak work rate occurs when about half of the work on the project has been one. his phenomenon can be interprete as that in a well-structure software evelopment environment, the slope of the testing-effort consumption curve may grow slowly initially, but a compensating reuction will happen later. able shows the estimate values of parameters by using ifferent SRGMs an two comparison criteria, Accuracy of Estimation (AE) an Mean of Square Fitting Faults (MSF) [7-8]. he smaller MSF an AE inicate fewer number of fitting faults an better performance. From able, we know that when the value of varies from to, both MSF an AE will be less than other existing SRGMs; therefore, it is conceivable that the propose moel has a better gooness-of-fit. able : Parameters of generalize logistic testing-effort function for the first ata set. N A esting Effort(CPU Hours) 4 K= K= K=.66 K= Actual ime(weeks) Figure : Observe/estimate testing-effort vs. time for the first ata set. able : Comparison results for the first ata set. Moel a r AE(%) MSF
4 Propose Moel (=) (=.5) (=) (=.6) (=) (=.5) (=4) (=4.5) G-O Moel G-O with Weibull fun G-O with Rayl. Fun G-O with Exp. fun. Inflection S Moel Delaye S Moel Exp. Moel Delaye S Moel with Ray. fun. S-Shape Moel with logistic fun HGDM 87.7 NA HGDM with NA linear factor HGDM with 85. NA Exp. factor Musa Log. Poisson NA 7... Numerical example he secon ata set is cite from Musa et al. [4-5]. he software were teste for weeks (5. CPU Hours were use) an 6 faults were etecte. he Maximum Likelihoo Estimation an Least Squares Estimation are use to estimate the parameters of the Eq. (), Eq. (4), an Eq. () an we substitute the calculate normalizing value for. he estimate values for the parameters are liste in able. In fact, from able, =.77 is the real estimate value for the secon ata set an other possible values of are pre-calculate. Figure epicts the fitting of the estimate current testing effort by using generalize logistic testing-effort function. able 4 shows the estimate values of parameters an the comparison results between the observe an the estimate values obtaine by the other SRGMs. Similarly, smaller AE an MSF inicate less fitting errors an better performance. We fin that when the value of varies from.5 to 4.5, both MSF an AE will be less than other existing SRGMs. Hence, we still can conclue that the propose moel is goo enough to give a more accurate escription of resource consumption uring the software evelopment phase an gives a better fit in this experiment. able : Parameters of generalize logistic testing-effort function for the secon ata set. N A esting Effort(CPU Hours) K= K=.77 K= Actual 5 5 ime(weeks) Figure : Observe/estimate testing-effort vs. time for the secon ata set. able 4: Comparison results for the secon ata set. Moel a r AE (%) MSF Propose Moel (=) ( =.77) ( =.5) ( =) ( =) ( =.5) ( =4) ( =4.5) G-O Moel G-O with Rayleigh fun. Exp. Moel Delay S-shape Moel
5 Delaye S with Exp. fun. Delaye S with Logistic function Numerical example he thir set of real ata is the pattern of iscovery of faults in the software that supporte Space Shuttle flights SS, SS, SS4 at the Johnson Space Center []. he system is also a real-time comman an control application. A weekly summary of software test hours an the faults of various severity iscovere is given in []. he cumulative number of iscovere faults up to thirty-eight weeks is 7. Similarly, the Maximum Likelihoo Estimation an Least Squares Estimation are use to estimate the parameters of the Eq. (), Eq. (4), an Eq. (), an we substitute correct normalizing value for. he estimate values of parameters for the generalize logistic testing-effort function are liste in able 5. In fact, from able 5, =.56 is real estimate value for this ata set an the other possible values of are pre-calculate. Figure epicts the fitting of the estimate current testing effort by using generalize logistic testing-effort function. able 6 shows the estimate values of parameters by using ifferent SRGMs an the comparison criteria. herefore, the estimation results of iniviual moels show that the propose moel gives the better AE. able 5: Parameters of generalize logistic testing-effort function for the thir ata set. N A esting Effort(CPU Hours) vs. time for the thir ata set. able 6: Comparison results for the thir ata set. Moel a r AE (%) Propose Moel (=) (=.56) (=.5) (=) (=.5) G-O Moel G-O with Rayleigh Function..4 Numerical example 4 he fourth set of real ata is the pattern of iscovery of faults by homa in []. he ebugging time an the number of etecte faults per ay are reporte. he cumulative number of iscovere faults up to twenty-two ays is 86 an the total consume ebugging time is 9 CPU hours. All ebugging ata are use in this experiment. Similarly, we can estimate each parameter by the Maximum Likelihoo Estimation an Least Squares Estimation in the propose SRGM an they are shown in able 7. In fact, from able 7, =.76 is real estimate value for this ata set an the other possible values of are pre-calculate. Figure 4 epicts the fitting of the estimate current testing effort by using generalize logistic testing-effort function. able 8 shows the estimate values of parameters by using ifferent SRGMs an the comparison criteria. herefore, in this ata set, we conclue that our propose moel gets a reasonable preiction in estimating the number of software faults an fits this ata set better than others. able 7: Parameters of generalize logistic testing-effort function for the fourth ata set. N A K= K=.56 K= K= Actual ime(weeks) Figure : Observe/estimate testing-effort
6 esting Effort(CPU Hours) K= K=.76 K= K=.5 Actual 5 5 ime(weeks) Figure 4: Observe/estimate testing-effort vs. time for the fourth ata set. able 8: Comparison results for the fourth ata set. Moel a r AE (%) Propose Moel (=) (=.5) (=.76) (=) (=.5) G-O Moel HGDM Optimal release time incorporating test efficiency In the last section we escribe a generalize approach to incorporate testing effort into software reliability moels. In this section we will ientify the efficiency of testing an stuy its impact on software reliability. In particular, we iscuss how to incorporate testing efficiency into reliability moels an how to etermine the optimal software release time.. Impact of new tools/techniques on software testing efficiency As soon as software coing is complete, the necessary but expensive testing phase starts. During the testing phase, the evelopers will nee to make a software reliability evaluation an etermine when to stop testing. If the results meet the requirement specifications an the reliability criteria are also satisfie, then the software prouct is reay for release. herefore, ajusting specific parameters in an SRGM an aopting the corresponing actions appropriately can help to achieve the goal of etermining the software release time. Several approaches can be applie. For example, we have iscusse the applications of testing-effort control an management problem in our previous stuy [7]. Using the propose methos, we can easily control the moifie consumption rate of testing-effort expenitures an etect more faults in a specifie time interval. his means that the evelopers an testers can evote their time an resource to complete their testing tasks base on well-controlle expenitures. In aition to controlling the testing-effort expenitures, we can achieve a given operational quality at a specifie time by introucing new automate testing tools an techniques. hat is, through the aoption of new testing techniques an tools, we can etect an remove more aitional faults (i.e. those faults that are not easily expose uring the testing phase). hese new methos, however, will impose extra software evelopment cost. For example, professional experts can help evelopers to assess the original software evelopment process, to meet their quality goals, an to reuce risks. In general, these external personnel can offer efficient an effective approaches to test planning, moule-level unit testing, or testing strategies. Moreover, many automate testing tools an techniques are available to increase test coverage an replace traitional manual testing. he benefits of applying new techniques an tools inclue increase software quality, reuce testing costs, improve release time to market, repeatable test steps, an improve testing prouctivity [5,, 5, ]. Consequently, it is esirable that these experts an automate testing tools/techniques can greatly help the evelopers in etecting aitional faults that are ifficult to fin uring regular testing an usage, in ientifying an correcting faults effectively, an in improving their software evelopment processes. An important step towar these new approaches, then, is to offer enough information about these approaches to software evelopers an reliability engineers. Before aopting the automate techniques an tools, we shoul get quantitative information from the inustrial ata relative to these methos past performance (i.e. the previous testing experience), or get qualitative information from the evaluation on the methos attributes. Basically, these methos past performance shoul be evaluate in etermining whether they will be successful in managing reliability growth []. In aition, they can be evaluate by performing various simulations base on actual ata sets. Finally, the test team s capacity in applying these techniques an tools an the relate operational profiles also play an important role. We iscuss how the software reliability moeling process can inclue these testing methos, an how a new optimal software release time problem can be formulate an solve.. Optimal software release time problem Okumoto an Goel [] first iscusse the software optimal release policy from the cost-benefit viewpoint. he total cost of testing-effort expenitures at time, C(), can be expresse as [-, 7, 9-,, 8-9, 4]:
7 C ( ) C m( ) C [ m( ) m( )] C LC x) x C ( ) C( ). his phenomenon usually occurs () infrequently, but if it can really shorten the testing perio where LC =software life-cycle length uner the same software reliability requirements, we may still consier applying the new techniques. By C =cost of correcting an error uring testing ifferentiating Eq. () with respect to the time we have: C =cost of correcting an error uring operation C =cost of testing per unit testing-effort expenitures. C( ) C ( ) C (( P) m( )) C From the work by B. Boehm [6], we know C >C as (( P) m( )) C ) (6) C is usually an orer of magnitue greater than C. In orer to etect aitional faults uring testing, the testers If we let Eq. (6) be equal to zero an use the mean value an ebuggers may use new automate tools or techniques. function in Eq. (), we can get a finite an unique solution he cost trae-off of these new tools an techniques, for the etermination of an optimal software release therefore, shoul be consiere in the software cost moel, time problem base on the new cost criterion. incluing their expenitures an benefits. Consequently, From Eq. (6), if we let C (+P)= C an C (+P)= C, we moify the overall software cost moel as follows [4]: then we have C( ) C ( ) C ( P) m( ) C [ m( ) ( P) LC C( ) C ( ) C m( ) C m( ) m( )] C x ) x () C ) where C () is the cost function for eveloping an acquiring the automate tools an techniques that etect an (7) aitional fraction P of faults uring testing. If the mean value function is given in Eq. (), we obtain We note that the cost for eveloping an acquiring new tools or techniques, C (), oes not have to be a constant uring the testing. Moreover, the testing cost for C () can be parameterize an estimate base on actual ata. From our experience, we foun that C () may have ifferent forms as time progresses, which epens on the characteristics of a tool s performance, testing effort expenitures, effectiveness, an so on. We can formulate this cost function as simple linear functions or simple non-linear functions. In general, the longer the software is teste, the more the testing cost C (). Uner the cost-benefit consierations, the automate tools or techniques will pay for themselves if C ( ) C( ) (4) hat is, m( ) C [ m( ) m( )] C x x C LC ) C ( ) C ( P) m( ) C [ m( LC ) ( P) m( )] C x) x Rearranging the above equation, we obtain C ) P m( ) ( C ) (5) ( C Eq. (5) is use to ecie whether the new automate tools or techniques are effective or not. If C () is low enough or if the new methos are effective in etecting aitional faults, this investment is worthwhile. Usually appropriate automate tools or techniques are best selecte epening on how thoroughly failure ata are collecte an faults are categorize [5]. Sometimes incorporating new automate tools an techniques into a software evelopment process may introuce excessive, that is, C( ) C ( ) C ar ) exp[ rw ( )] C ar ) exp[ rw ( )] C ) (8) Without loss of generally, we consier several possibilities for C () in orer to interpret the cost consumption: () C () is a constant. () C () is proportional to the testing-effort expenitures. () C () is exponentially relate to the testing-effort expenitures. A. C ()= C, s ; C ()=, < s C( ) ) [ ( C C ) ar exp[ r(( W ( ) W ( ))] C ] (9) Since > for, C ( ) if ( C C ) ar exp[ r( W ( ) W ())] C () he left-han sie in Eq. () is a monotonically ecreasing function of. Here we let s be the starting time of aopting new techniques/tools. If ( C s C, then C ) ar exp[ r( W ( ) W ())] ( C C ) ar exp[ r( W ( LC ) W ())] C for s < < LC. herefore, the optimal software release time = s since
8 C ( ) for s << LC. Similarly, if ( C s C an C ) ar exp[ r( W ( ) W ())] ( C C ) ar exp[ r( W ( LC ) W ())] C, there exists a finite an unique solution satisfying Eq. (). hat is, A ln minimizes C() () N where C C N ln ar r C A since C ( ) for s << an C( ) > for << LC. If ( C C ) ar exp[ r( W ( LC ) W ())] C, then ( C C ) ar exp[ r( W ( ) W ())] C for s << LC. herefore, the optimal software release time = LC since C ( ) for s < < LC. heorem : Assume C ()= C (constan, C >, C >, C >, C >, C >C, we have CASE ( C C ) ar exp[ r( W ( s ) W ())] C an ( C C ) ar exp[ r( W ( LC ) W ())] C : there exists a finite an unique solution satisfying Eq. () an the optimal software release time is =. CASE ( C C ) ar exp[ r( W ( s ) W ())] C : = s. CASE ( C C ) ar exp[ r( W ( LC ) W ())] C : = LC. B. C ( ) C C s t, s ; C ()=, < s where C is an nonnegative real number that inicates the basic cost of aopting new techniques/tools, an s is the start time of aopting new techniques/methos. C( ) C ) C ar ) exp[ rw ( )] C ar ) exp[ rw ( )] C ) w ) [( C C ) ar exp[ r(( W ( ) ())] ( W C C ] () Since > for, C ( ) if ( C C ) ar exp[ r( W ( ) W ())] C C () As the left-han sie in Eq. () is a monotonically ecreasing function of, therefore, if ( C s C C an C ) ar exp[ r( W ( ) W ())] ( C C ) ar exp[ r( W ( LC ) W ())] C C, there exists a finite an unique solution satisfying Eq. (). where A ln minimizes C() (4) N C C N ln ar r C C A heorem : Assume C ( ) C C s t, C,C >, C >, C >, C >, C >C, we have CASE ( C C ) ar exp[ r( W ( s) W ())] C C an ( C C ) ar exp[ r( W ( LC ) W ())] C + C : there exists a finite an unique solution satisfying Eq. () an the optimal software release time is =. CASE ( C C ) ar exp[ r( W ( s) W ())] C C : = s. CASE ( C C ) ar exp[ r( W ( LC) W ())] C C : = LC. C. < s, s C ( ) C ( C s m C ( ) C m ) ( C C s m ;C ()=, ar ) exp[ rw ( )] C ar ) exp[ rw ( )] C ) w [( C C ) ar exp[ rw ( )] C + ( t s m C m ( C ] Because > for, C ( ) if
9 P ( ) [( C C ) ar exp[ rw ( ] C m C ( m ] s C (5) he left-han sie in Eq. (5) is a monotonically ecreasing function of. herefore, if ( C C ) ar exp[ r( W ( s ) W ())] C an P( LC )<C, it means that there exists a finite an unique solution satisfying Eq. (5), which can be solve by numerical methos. It is note that C ( ) for s an C( ) for >. hus, = minimizes C() for < LC. Similarly, we can get the following theorem. heorem : m Assume C ( ) C ( C s, C, C >, C >, C >, C >, C >C, we have CASE ( C C ) ar exp[ r( W ( s ) W ())] C an P( LC )<C : there exists a finite an unique solution satisfying Eq. (5) an the optimal software release time is =. CASE ( C C ) ar exp[ r( W ( s ) W ())] C : = s. CASE P( LC )>C : = LC. D. C ( ) C C (exp[ m ( ) ] ) s w t t, s ; C ()=, < s. C( ) C m ) exp[ m t] C ar ) s exp[ rw ( )] C ar ) exp[ rw ( )] C ) w {( C C ) ar exp[ rw ( )] ( C C m exp[ m t] } s Since > for, C ( ) if ( ) ( C C ) ar exp[ rw ( ] C m exp[ m t] C s (6) he left-han sie in Eq. (6) is a monotonically ecreasing function of. herefore, if ( C C ) ar exp[ r( W ( s ) W ())] Cm C an Q( LC ) <C, it means that there exists a finite an unique solution satisfying Eq. (6), which can be solve by numerical methos [6]. It is note that C ( ) for s an C( ) > for >. hus, = minimizes C() for < LC. Similarly, we can get the following theorem. heorem 4: Assume C ( ) C C (exp[ m ( ) ] ) s w t t, C >, C >, C >, C >, C >, C >C, we have CASE ( C C ) ar exp[ r( W ( s) W ())] Cm C an Q( LC )<C : there exists a finite an unique solution satisfying Eq. (6) an the optimal software release time is =. CASE ( C C ) ar exp[ r( W ( s ) W ())] Cm C : = s. CASE Q( LC )>C, : = LC.. Numerical example We have consiere several ifferent cases of minimizing the software cost in which the new automate tools an techniques are introuce uring testing. Due to the limitation of space, we choose Eq. () as the testing-effort function for a software evelopment project. Other logistic testing-effort functions with ifferent values can be similarly applie base on the same proceure. From the previously estimate parameters for the first ata set in able, we get N= , A=49.67, =.584, =.66, a=69.9, r= We further set C =$, C =$ per error, C =$5 per error, C =$ per unit testing-effort expenitures, an LC = weeks. We will consier the following two types of cost function C (): m. ( ) C ( C C s. C ( ) C C (exp[ m ( ) ] ) s w t t Here we assume C =$, s =9, LC =, an m=, that is, C ( ) 9 t. From heorem, the relationship of the cost optimal release time with ifferent P is given in able 9. From able 9, we fin that if the P value is larger, the optimal release time is larger an the total expecte software cost is smaller. his reflects that when we have better testing performance, we can etect
10 more latent faults through aitional techniques an tools. herefore, we can shorten testing time an release software soon. Compare with the estimate values of traitional software cost moel (i.e. Eq. ()) where =4.88, C()=479.66, we can see that in able 9, same optimal release time is achieve when P=. (i.e., =4.89), then C()= 4.9. It means that the C() is smaller than C() with equal optimal release time; that is, the assumption C ( ) C( ) is satisfie. Besies, the Operational Quality Inex (OQI) is increase from 89.5% to 98.6% [7]. Similarly, the relationships of the optimal release time with various P values base on ifferent cost functions are shown in able -4. From these tables we conclue the following facts: ) As P increases, the optimal release time increases but the total expecte software cost C() ecreases. his is because we can etect more faults an reuce the cost of correcting faults uring operational phase. ) Uner the same P value an with ifferent cost m functions (such as ( ) C ( C or C s C ( ) C C (exp[ m ( ) ] ) s w t t ), the larger the cost function is, the smaller the optimal release time is. However, the ifference in estimating the total expecte software cost is insignificant. able 9: Relationship between the cost optimal release time, C(), an P base on the cost function () C 9 t P C() P C() able : Relationship between the cost optimal release time, C(), an P base on the cost function C () (. 9 P C() P C() able : Relationship between the cost optimal release time, C(), an P base on the cost function C () (exp[ 9 t] ) P C() P C() able : Relationship between the cost optimal release time, C(), an P base on the cost function 9 C () (exp[. t] ) P C() P C() able : Relationship between the cost optimal release time, C(), an P base on the cost function C () 5 (exp[ 9 t] ) P C() P C() able 4: Relationship between the cost optimal release time, C(), an P base on the cost function 9 C () 5 (exp[. t] ) P C() P C() Summary an conclusions
11 In this paper we stuy the impact of software testing effort an efficiency on the moeling of software reliability, incluing the reliability measure an the cost for optimal release time. We propose a generalize logistic testing-effort function which relates work profile irectly to the natural flow of software evelopment. his function is use to escribe the actual consumption of resources uring software testing which provies more accurate information for reliability moeling purpose. We also escribe the effects of applying new tools an techniques for increase efficiency of software testing an stuie the relate optimal software release time problem from the cost-benefit viewpoint. New reliability problems are formulate to incorporate software testing effort an efficiency. Finally, numerical examples are provie to emonstrate these new approaches. 5. Acknowlegments We woul like to express our gratitue for the support of the National Science Council, aiwan, R.O.C., uner Grant NSC 87-PC-E--7. he work escribe in this paper was also partially supporte by a grant from the Research Grant Council of the Hong Kong Special Aministrative Region (Project No. CUHK44/99E). he authors are please to thank Professor Y. K. Malaiya for his many constructive an insightful suggestions for improving the etails of this manuscript. Besies, we also thank several anonymous referees for their critical review an comments. References [] S. Yamaa, J. Hishitani, an S. Osaki, "Software Reliability Growth Moel with Weibull esting Effort: A Moel an Application," IEEE rans. on Reliability, Vol. R-4, pp. -5, 99. [] S. Yamaa, H. Ohtera, an H. Narihisa, "Software Reliability Growth Moels with esting Effort", IEEE rans. on Reliability, vol. R-5, No., pp. 9-, April 986. [] S. Yamaa an S. Osaki, " Cost-Reliability Optimal Release Policies for Software Systems, IEEE rans. on Reliability, Vol. 4, No. 5, pp. 4-44, 985. [4] J. D. Musa, A. Iannino, an K. Okumoto (987). Software Reliability, Measurement, Preiction an Application. McGraw Hill. [5] J. D. Musa (999). Software Reliability Engineering: More Reliable Software, Faster Development an esting. McGraw-Hill. [6] M. E. Helaner, M. Zhao, an N. Ohisson, "Planning Moels for Software Reliability an Cost," IEEE rans. on Software Engineering, Vol. 4, No. 6, pp. 4-44, June 998. [7] C. Y. Huang, J. H. Lo an S. Y. Kuo, "A Pragmatic Stuy of Parametric Decomposition Moels for Estimating Software Reliability Growth," Proceeings of the 9th International Symposium on Software Reliability Engineering (ISSRE 98), pp. -, Nov , Paerborn, Germany. [8] C. Y. Huang, S. Y. Kuo an I. Y. Chen, "Analysis of a Software Reliability Growth Moel with Logistic esting-effort Function," Proceeings of the 8th International Symposium on Software Reliability Engineering (ISSRE 97), pp , Nov. 997, Albuquerque, New Mexico. U.S.A. [9] R. H. Huo, S. Y. Kuo, an Y. P. Chang, "Optimal Release imes for Software Systems with Scheule Delivery ime Base on HGDM," IEEE rans. on Computers, Vol. 46, No., pp. 6-, Feb [] R. H. Huo, S. Y. Kuo, an Y. P. Chang, "Optimal Release Policy for Hyper-Geometric Distribution Software Reliability Growth Moel," IEEE rans. on Reliability, Vol. 45, No. 4, pp , Dec [] K. Okumoto an A. L. Goel, "Optimum Release ime for Software Systems Base on Reliability an Cost Criteria, Journal of Systems an Software, Vol., pp. 5-8, 98. [] M. R. Lyu (996). Hanbook of Software Reliability Engineering. McGraw Hill. [] S. R. Dalal an C. L Mallows, "When Shoul One Stop esting Software, " Journal of the American Statistical Association, Vol. 8, No. 4, pp , September 988. [4] F. N. Parr, "An Alternative to the Rayleigh Curve for Software Development Effort," IEEE rans. on Software Engineering, SE-6, pp. 9-96, 98. [5] M. Lipow, "Preiction of Software Failures, " Journal of Systems an Software, Vol., pp. 7-75, 979. [6] B. Boehm (98). Software Engineering Economics. Prentice-Hall, Englewoo Cliffs, NJ. [7] M. Ohba, " Software Reliability Analysis Moels, IBM J. Res. Develop., Vol. 8, No. 4, pp , July 984. [8] Y. W. Leung, "Optimum Software Release ime with a Given Buget, Journal of Systems an Software, Vol. 7, pp. -4, 99. [9] S. Yamaa, H. Narihisa, an S. Osaki, " Optimum Release Policies for a Software System with a Scheule Delivery ime, Int. J. of Systems Science, Vol. 5, pp , 984. [] J. Farquhar an A. Mosleh, "An Approach to Quantifying Reliability-Growth Effectiveness," Proceeings Annual Reliability an Maintainability Symposium, pp. 66-7, 995. [] S. S. Gokhale, M. R. Lyu, an K. S. rivei, "Software Reliability Analysis Incorporating Fault Detection an Debugging Activities, Proceeings of the 9th International Symposium on Software Reliability Engineering (ISSRE 98), pp. -, November , Paerborn, Germany. [] P. N. Misra, "software reliability analysis, IBM Systems Journal, Vol., No., pp. 6-79, 98. [] Y. ohma, R. Jacoby, Y. Murata, an M. Yamamoto, "Hyper-Geometric Distribution Moel to Estimate the Number of Resiual Software Faults, Proc. COMPSAC-89, Orlano, pp. 6-67, 989. [4] C. Y. Huang, S. Y. Kuo, an M. R. Lyu, " Optimal Software Release Policy Base on Cost, Reliability an esting Efficiency," he wenty-hir Annual International Computer Software an Applications Conference (COMPSAC 99), October 7-9, 999, Phoenix, Arizona,
12 U.S.A. (accepte for publication) [5] M. R. Lyu an A. Nikora, " Using Software Reliability Moels More Effectively, IEEE Software, pp. 4-5, July 99. [6] Xie, M., Software Reliability Moeling, Worl Scientific Publishing Company, 99.
Effort-Index-Based Software Reliability Growth Models and Performance Assessment
Effort-Index-Based Software Reliability Growth Models and Performance Assessment Chin-Yu Huang *, Sy-Yen Kuo *, Michael R. Lyu **, and Jung-Hua Lo * * Department of Electrical Engineering ** Computer Science
More informationEffort-Index-Based Software Reliability Growth Models and Performance Assessment
Effort-Index-Based Software Reliability Growth Models and Performance Assessment Chin-Yu Huangl, Sy-Yen Kuo*, and Michael R. Lp** ** *Department of Electrical Engineering Computer Science & Engineering
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationAnalysis of a Software Reliability Growth Model with Logistic Testing-Effort Function
Analysis of a Software Reliability Growth Model with Logistic Testing-Effort Function Chin-Yu Huang and Sy-Yen Kuo Department of Electrical Engineering National Taiwan University Taipei, Taiwan sykuo@cc.ee.ntu.edu.tw
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationClassification and clustering methods for documents. by probabilistic latent semantic indexing model
A Short Course at amang University aipei, aiwan, R.O.C., March 7-9, 2006 Classification an clustering methos for ocuments by probabilistic latent semantic inexing moel Shigeichi Hirasawa Department of
More informationEFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER
FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationWilliam S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract
Optimization Methos for Calculating Design Imprecision y William S. Law Eri K. Antonsson Engineering Design Research Laboratory Division of Engineering an Applie Science California Institute of Technology
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationTHE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM
International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More informationA Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
272 INFORMS Journal on Computing 0899-1499 100 1204-0272 $05.00 Vol. 12, No. 4, Fall 2000 2000 INFORMS A Revise Simplex Search Proceure for Stochastic Simulation Response Surface Optimization DAVID G.
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationAdvanced method of NC programming for 5-axis machining
Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin
More informationSoftware Reliability Models: Failure rate estimation
Software Reliability Models: Failure rate estimation Animesh Kumar Rai M.Tech Student, Department of information Technology Amity School of Engineering and Technology Amity University, Noida, Uttar Pradesh
More informationFrequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms
Proceeings of the 7th WSEAS International Conference on Simulation, Moelling an Optimization, Beijing, China, September 15-17, 2007 429 Frequenc Domain Parameter Estimation of a Snchronous Generator Using
More informationNAND flash memory is widely used as a storage
1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage
More informationKeywords: Software reliability, Logistic Growth, Curve Model, Software Reliability Model, Mean Value Function, Failure Intensity Function.
Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Software Reliability
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationVerifying performance-based design objectives using assemblybased vulnerability
Verying performance-base esign objectives using assemblybase vulnerability K.A. Porter Calornia Institute of Technology, Pasaena, Calornia, USA A.S. Kiremijian Stanfor University, Stanfor, Calornia, USA
More informationA Plane Tracker for AEC-automation Applications
A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationAnimated Surface Pasting
Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca
More informationLocal Path Planning with Proximity Sensing for Robot Arm Manipulators. 1. Introduction
Local Path Planning with Proximity Sensing for Robot Arm Manipulators Ewar Cheung an Vlaimir Lumelsky Yale University, Center for Systems Science Department of Electrical Engineering New Haven, Connecticut
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationHOW DO SECURITY TECHNOLOGIES INTERACT WITH EACH OTHER TO CREATE VALUE? THE ANALYSIS OF FIREWALL AND INTRUSION DETECTION SYSTEM
HOW O SECURTY TECHNOLOGES NTERACT WTH EACH OTHER TO CREATE VALUE? THE ANALYSS O REWALL AN NTRUSON ETECTON SYSTEM Huseyin CAVUSOGLU Srinivasan RAGHUNATHAN Hasan CAVUSOGLU Tulane University University of
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationA Duality Based Approach for Realtime TV-L 1 Optical Flow
A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos
More informationAlgorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
Algorithm for Intermoal Optimal Multiestination Tour with Dynamic Travel Times Neema Nassir, Alireza Khani, Mark Hickman, an Hyunsoo Noh This paper presents an efficient algorithm that fins the intermoal
More informationDiscrete time modelling in software reliability engineering a unified approach
Comput Syst Sci & Eng 2009) 6: 71 77 2009 CRL Publishing Ltd International Journal of Computer Systems Science & Engineering Discrete time modelling in software reliability engineering a unified approach
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationA Convex Clustering-based Regularizer for Image Segmentation
Vision, Moeling, an Visualization (2015) D. Bommes, T. Ritschel an T. Schultz (Es.) A Convex Clustering-base Regularizer for Image Segmentation Benjamin Hell (TU Braunschweig), Marcus Magnor (TU Braunschweig)
More informationPolitecnico di Torino. Porto Institutional Repository
Politecnico i Torino Porto Institutional Repository [Proceeing] Automatic March tests generation for multi-port SRAMs Original Citation: Benso A., Bosio A., i Carlo S., i Natale G., Prinetto P. (26). Automatic
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationPower-Performance Trade-offs for Energy-Efficient Architectures: A Quantitative Study
In the Proc. of the Intl. Conf. on Computer Design (ICCD-02), Frieburg, March 2002 Power-Performance Trae-offs for Energy-Efficient Architectures: A Quantitative Stuy Hongbo Yang R. Govinarajan Guang R.
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationResearch Article Research on Law s Mask Texture Analysis System Reliability
Research Journal of Applie Sciences, Engineering an Technology 7(19): 4002-4007, 2014 DOI:10.19026/rjaset.7.761 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitte: November
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationA new fuzzy visual servoing with application to robot manipulator
2005 American Control Conference June 8-10, 2005. Portlan, OR, USA FrA09.4 A new fuzzy visual servoing with application to robot manipulator Marco A. Moreno-Armenariz, Wen Yu Abstract Many stereo vision
More informationTracking and Regulation Control of a Mobile Robot System With Kinematic Disturbances: A Variable Structure-Like Approach
W. E. Dixon e-mail: wixon@ces.clemson.eu D. M. Dawson e-mail: awson@ces.clemson.eu E. Zergeroglu e-mail: ezerger@ces.clemson.eu Department of Electrical & Computer Engineering, Clemson University, Clemson,
More informationFeature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory
Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative
More informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationThe Journal of Systems and Software
The Journal of Systems an Software 83 (010) 1864 187 Contents lists available at ScienceDirect The Journal of Systems an Software journal homepage: www.elsevier.com/locate/jss Embeing capacity raising
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationImpact of changing the position of the tool point on the moving platform on the dynamic performance of a 3RRR planar parallel manipulator
IOSR Journal of Mechanical an Civil Engineering (IOSR-JMCE) e-issn: 78-84,p-ISSN: 0-4X, Volume, Issue 4 Ver. I (Jul. - Aug. 05), PP 7-8 www.iosrjournals.org Impact of changing the position of the tool
More informationDesign and Analysis of Optimization Algorithms Using Computational
Appl. Num. Anal. Comp. Math., No. 3, 43 433 (4) / DOI./anac.47 Design an Analysis of Optimization Algorithms Using Computational Statistics T. Bartz Beielstein, K.E. Parsopoulos,3, an M.N. Vrahatis,3 Department
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationTHE increasingly digitized power system offers more data,
1 Cyber Risk Analysis of Combine Data Attacks Against Power System State Estimation Kaikai Pan, Stuent Member, IEEE, Anré Teixeira, Member, IEEE, Milos Cvetkovic, Member, IEEE, an Peter Palensky, Senior
More informationNEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationRegularized Laplacian Zero Crossings as Optimal Edge Integrators
Regularize aplacian Zero rossings as Optimal Ege Integrators R. KIMME A.M. BRUKSTEIN Department of omputer Science Technion Israel Institute of Technology Technion ity, Haifa 32, Israel Abstract We view
More informationReformulation and Solution Algorithms for Absolute and Percentile Robust Shortest Path Problems
> REPLACE THIS LINE WITH YOUR PAPER IENTIFICATION NUMBER (OUBLE-CLICK HERE TO EIT) < 1 Reformulation an Solution Algorithms for Absolute an Percentile Robust Shortest Path Problems Xuesong Zhou, Member,
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationAn Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions
An Investigation in the Use of Vehicle Reientification for Deriving Travel Time an Travel Time Distributions Carlos Sun Department of Civil an Environmental Engineering, University of Missouri-Columbia,
More informationThe speed-controlled interpolator for machining parametric curves
COMPUTER-AIDED DESIGN Computer-Aie Design 31 (1999) 349 357 www.elsevier.com/locate/ca The spee-controlle interpolator for machining parametric curves S.-S. Yeh, P.-L. Hsu* Department of Electrical an
More informationRough Set Approach for Classification of Breast Cancer Mammogram Images
Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationChapter 1: Introduction
Page No Chapter 1: Introduction...1-58 1.1. Software Reliability Engineering...2 1.2. Software Reliability...4 1.3. The failure curve for Hardware and Software Reliability...4 1.4 Software Development
More informationk-nn Graph Construction: a Generic Online Approach
k-nn Graph Construction: a Generic Online Approach Wan-Lei Zhao arxiv:80.00v [cs.ir] Sep 08 Abstract Nearest neighbor search an k-nearest neighbor graph construction are two funamental issues arise from
More informationTable-based division by small integer constants
Table-base ivision by small integer constants Florent e Dinechin, Laurent-Stéphane Diier LIP, Université e Lyon (ENS-Lyon/CNRS/INRIA/UCBL) 46, allée Italie, 69364 Lyon Ceex 07 Florent.e.Dinechin@ens-lyon.fr
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationInvestigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal
991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea
More informationWLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic
WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e
More informationDesign of Controller for Crawling to Sitting Behavior of Infants
Design of Controller for Crawling to Sitting Behavior of Infants A Report submitte for the Semester Project To be accepte on: 29 June 2007 by Neha Priyaarshini Garg Supervisors: Luovic Righetti Prof. Auke
More informationNET Institute*
NET Institute* www.netinst.org Working Paper #08-24 October 2008 Computer Virus Propagation in a Network Organization: The Interplay between Social an Technological Networks Hsing Kenny Cheng an Hong Guo
More informationApproximation with Active B-spline Curves and Surfaces
Approximation with Active B-spline Curves an Surfaces Helmut Pottmann, Stefan Leopolseer, Michael Hofer Institute of Geometry Vienna University of Technology Wiener Hauptstr. 8 10, Vienna, Austria pottmann,leopolseer,hofer
More information