ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION
|
|
- Wilfrid McKinney
- 5 years ago
- Views:
Transcription
1 Joural of Data Sciece , DOI: /JDS _16(4) ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION David D. Haagal *, Nileema N. Bhalerao 2 Departmet of Statistics, Savitribai Phule Pue Uiversity Pue , Idia ABSTRACT May software reliability growth models based upo a o-homogeeous Poisso process (NHPP) have bee proposed to measure ad asses the reliability of a software system quatitatively. Geerally, the error detectio rate ad the fault cotet fuctio durig software testig is cosidered to be depedet o the elapsed time testig. I this paper we have proposed three software reliability growth models (SRGM s) icorporatig the otio of error geeratio over the time as a extesio of the delayed S-shaped software reliability growth model based o a o-homogeeous Poisso process (NHPP). The model parameters are estimated usig the maximum likelihood method for iterval domai data ad three data sets are provided to illustrate the estimatio techique. The proposed model is compared with the existig delayed S-shaped model based o error sum of squares, mea sum of squares, predictive ratio risk ad Akaike s iformatio criteria usig three differet data sets. We show that the proposed models perform satisfactory better tha the existig models. Keywords:Error detectio rate; Fault Cotet Rate Fuctio; No-homogeeous Poisso process; Predictive ratio risk. * Correspodig author: David D. Haagal david haagal@yahoo.co.i
2 858 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION 1. Itroductio Over the past four decades several software models (SRGM) have bee proposed by various researchers [See Pham (1993, Teg ad Pham (2006), Pham (1996), Obha ad Yamada (1984), Teg ad Pham (2004), Zhag et al. (2003)]. The pioeerig attempt i the o-homogeeous Poisso process (NHPP) software reliability growth model was by Goel ad Okumoto (1979) (GO). The model describes the failure observatio pheomeo by a expoetial curve. There are other SRGM s describig either S-shaped curves or a mixture of expoetial ad S-shaped curves (flexible). Some of the importat models fallig uder this category are due to Yamada et al. (1983), Obha (1984), Bittati et al. (1988), Kapur ad Garg (1992), Kapur et al. (1999), Pham (2006), Che (2010) ad Lai ad Garg (2012). These models were developed based o the assumptio that faults detected i the testig phase are removed immediately with o debuggig time delay ad o ew faults are itroduced ito the software. I other words, it is assumed that wheever a attempt is made to remove a fault, it is removed with certaity ad this is referred as perfect because of a umber of factors like tester s skill ad expertise. The testig is observed ad the origial fault may remai, leadig to a pheomeo kow as imperfect debuggig. Aother possibility is that while correctig a software error additioal errors may be geerated ad these errors may get ito software. Such models may be referred as error geeratio models. I the case of error geeratio, the total fault cotet icreases as testig progresses because ew faults are itroduced ito the system while removig the origial faults. Goel ad Okumoto (1979) have itroduced the cocept of imperfect debuggig for the first time i literature. Obha ad Cho (1989) exteded this work by itroducig the error geeratio ito the GO model ad amed it as imperfect debuggig model. Kapur ad Grag (1990) itroduced the imperfect debuggig i GO model ad they cosidered fault itroductio rate per remaiig faults beig reduced due to the imperfect debuggig. Thus the umber of failure observed ad detected by ifiite time is more tha the iitial fault cotet. Yamada et al. (1992) exteded GO model by assumig that fault itroductio rate is liear ad expoetial time depedet. Further several authors have used this approach to model error geeratio activity i software reliability model. Pham ad Zhag (1997) have developed a software reliability model cosiderig error itroductio rate as expoetial ad error itroductio rate as o-decreasig type. Pham et al. (1999) have discussed liear fault itroductio rate fuctio ad fault itroductio is of o-decreasig time depedet type. Tokuo ad Yamada (2000) proposed imperfect debuggig SRGM with two types of hazard rates for software reliability measuremet ad assessmet. Zhag ad Pham (2000) developed NHPP model with imperfect debuggig ad time depedet fault-detectio rate. Zhag et al. (2003) proposed SRGM model to itegrate fault removal efficiecy, failure rate, ad fault itroductio rate ito software reliability assessmet. Chatterjee ad Shukla (2016) proposed a chage poit-based SRGM uder imperfect debuggig with revised cocept of fault depedecy. The above discussed models does ot always reflect real testig eviromets. Recetly Haagal ad Bhalerao (2016a, 2016b, 2017) obtaied software reliability growth models based o iverse Weibull, geeralized iverse Weibull, exteded iverse Weibull distributios. It is of iterest to costruct a SRM by cosiderig
3 David D. Haagal ad Nileema N. Bhalerao 859 itroductio of error geeratio durig testig ad cetral processig uit (CPU) executio time. The remaider of the paper is orgaized as follows. I Sectio 2, we describe NHPP delayed S-shaped models. I sectio 3, we discuss the proposed models with three differet fault cotet fuctios ad software reliability assessmet measures ad the estimatio of ukow model parameters usig maximum likelihood method. Parameter estimatio of is of primary importace i software reliability predictio. Oce the aalytical solutio for m(t) is kow for a give model, the parameters i the solutio eed to be determied. Parameter estimatio is achieved by applyig a techique of maximum likelihood estimate (MLE), for the iterval domai area data. I may cases, the maximum likelihood estimators are cosistet ad asymptotically ormally distributed as the sample size icreases; see Zhao ad Xie (1996). I Sectio 4, we represet the aalysis of three data sets DS I, DS II ad DS III. Sectio 5 cotais the major coclusios ad remarks of the study. 2. NHPP Delayed S-Shaped Model I the NHPP S-shaped mode, the software reliability growth curve is a S-shaped curve. The detectio rate of faults, where the error detectio rate chages with time, because the greatest at a certai time after testig begis, after which it decreases expoetially. I other words, some faults are covered by other faults at the begiig of the testig phase, before these faults are actually removed, the covered faults remai udetected. Yamada et al. (1984) also determied that the software testig process usually ivolves a learig process where testers becomes familiar with the software products, eviromets, ad software specificatios. Several S-shaped models (Yamada et al. 1984; Pham 1997a) such as delayed S-shaped, iflectio S-shaped, etc., exists i literature. Kareer et al. (1990) proposed a S-shaped SRGM with two types of errors. The errors have bee classified depedig upo their survey. Gupta et al. (2011) obtaied software reliability estimatio usig delayed S-shaped model uder imperfect debuggig ad time lag. Ahmed et al. (2011) developed a iflatio SRGM cosiderig log-logistic testig-effort ad imperfect debuggig. Kaur ad Sharma (2015) predict the time betwee failure ad accuracy by usig CASRE tool for SRG models. Bokhari et al. (2017) proposed delayed S-shaped SRGM with imperfect debuggig ad ew modified Weibull testig effort fuctio. We ow discuss a stochastic model for a software error detectio process based o NHPP i which the growth curve of the umber of detected software errors for the observed failure data is S-shaped, called delayed S-shaped NHPP model (Yamada et al 1984). The software error detectio procedure described by a S-shaped curve ca be characterized as a learig process i which the test team members become familiar with the test eviromet, testig tools or project requiremets, i.e., their test skills gradually improve. The delayed S-shaped model is based o the followig assumptios: 1. All the faults i the program are mutually idepedet from the failure detectio poit of view.
4 860 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION 2. The probability of failure detectio at ay time is proportioal to the curret umber of faults i a software. 3. The proportioality of failure detectio i costat. 4. The iitial error cotet of the software is a radom variable. 5. A software system is subject to failures at radom times caused by errors preset i the system. 6. The time betwee (i 1) th ad i th failures depeds o the time to the (i 1) th failure. 7. Each time a failure occurs, the error which caused it is simultaeously removed ad o other errors are itroduced. O the basis of these assumptios we have the followig differetial equatio: m(t) = b(t)[a m(t)]. a > 0, b(t) > 0, t 0 (2.1) t a=expected total umber of faults that exists i the software before testig. b(t) = failure detectio rate per fault, which also represets the average failure rate of a fault. I delayed S-shaped NHPP model, b(t) = b2 t 1+bt,where b is the error detectio rate per error i the steady state. Solvig the differetial equatio give i (2.1) with respect to m(t) uder the iitial coditio m(0) = 0. Yamada et al. (1984) obtaied the mea value fuctio give by: m(t) = a[1 (1 + bt)e bt ] (2.2) which shows a S-shaped curve. This model is called delayed S-shaped NHPP model. Further, the coutig process N(t), t 0 represetig the cumulative umber of software faults detected up to testig time t is a stochastic process. Basic assumptio about this process lead to the commoly accepted coclusio that, for ay t 0, N(t) is a Poisso distributed with time depedet Poisso parameter m(t), the mea value fuctio (MVF). P{N(t) = } = [m(t)] e m(t), = 0,1,2,, (2.3)! where m(t) is give by : t m(t) = λ(x)dx (2.4) 0 The MVF represets the expected umber of software errors that have accumulated up to time t, or estimated cumulative faults up to time t. The itesity fuctio, λ(t) of the NHPP give by: λ(t) = ab 2 te bt (2.5) This represets the umber of faults represeted per uit testig time.
5 David D. Haagal ad Nileema N. Bhalerao 861 I geeral the secod assumptio (2) i.e. the detected faults are removed with certaity is ot always true [See Yamada et al. (1992), Pham ad Zhag (1997) ad Pham (1999)]. If additioal itroduced faults affect the fractio of the fault cotet, we have to modify this assumptio by itroducig the cocept of error geeratio while debuggig (or testig) process is a actio. That is, total fault cotet rate fuctio, a(t) represetig the sum of expected umber of iitial software faults ad itroduced faults by time t. Replacig a by a(t) i equatio (2.1), we have differetial equatio m(t) = b(t)[a(t) m(t)]. a(t) > 0, b(t) > 0, t 0 (2.6) t The above differetial equatio was give by Pham (2007). The geeralized mea value fuctio (MVF) solutio of the above differetial equatio (2.6) give by (Pham ad Zhag 1997) is as follows: m(t) = e B(t) [m 0 + a(τ)b(τ)e B(τ) 0 t dτ] (2.7) t where B(t) = b(τ)dτ with iitial coditio m(t t 0 ) = m 0 ad t 0 is the time to begi the 0 debuggig process. Pham (2007) obtaied NHPP SRGM with a(t) = α(1 + γt) 2 ad b(t) = γ2 t (1+γt) i this case both a(t) ad b(t) have commo parameter γ. I our proposed models we cosider the parameters are idepedet istead of depedet case. May existig software reliability growth models [Pham (2006)], Pham ad Zhag (2003), Yamada ad Osaki (1985) ca be cosidered as a special case of the above geeral model. A icreasig fuctio a(t) implies a icreasig total umber of faults ad reflects imperfect debuggig. A icreasig b(t) implies a icreasig fault detectio rate, which could be either attributed to imperfect debuggig, or to software process fluctuatios, or a combiatio of both. Differet a(t) ad b(t) fuctios also reflect differet assumptios of the software testig processes. I the simplest model, the fuctio a(t) ad b(t) are both costats. A costat a(t) = a stads for the assumptio that o ew errors are itroduced durig the debuggig process. A costat b(t) = b implies that the proportioal factor relatig the error detectio rate λ(t) to the total umber of remaiig errors is costat. I a geeral model, the fuctios a(t) ad b(t) are both fuctios of time. I the followig sectio we propose geeral models with three differet types of fault cotet fuctio a(t) ad discuss the methods of estimatig parameters of the models.
6 862 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION 3. Proposed Models with Three Differet Fault Cotet Rate Fuctios i Delayed S-shaped NHPP 3.1.1Liear Fault Cotet Rate Fuctio Here we assume that fault itroductio rate is a liear fuctio ad depedet o time, a(t) = a 1 (t) = a(1 + αt) a > 0, α > 0, t 0 where a is the umber of iitial fault cotet i the system ad α is a icreasig rate of the umber of itroduced faults to the iitial fault cotet fuctio. Let m 1 (t) be the MVF whe fault cotet fuctio a 1 (t) is substituted for a(t) i (2.6) thus we have: m 1 (t) t = b(t)[a(1 + αt) m 1 (t)]. a > 0, α > 0, b(t) > 0 t 0 (3.1) with b(t) = b2 t 1+bt. Solvig the differetial equatio give i (3.1) with respect to m 1(t) uder the iitial codtitio m 1 (0) = 0 we derived the mea value fuctio give by: m 1 (t) = ( a 2aα b ) e bt (1 + bt) + aα b (1 + bt) + (a 2aα b ) + 3aα b(1 + bt) (3.2) I this paper we call NHPP model with MVF m_1(t) give i (3.2) as delayed S-shaped liear model. The itesity fuctio of this model is: λ 1 (t) = (a + 2aα b ) b2 te bt 3aα + aα (3.3) (1 + bt) 2 Software Reliability Assessmet Measures Based o delayed S-shaped liear model, we ca derive the followig quatitative measures useful for software reliability assessmet. (a) Software Reliability Let S i, (i = 1,2, 3 ) be a radom variable represetig the i th software failure occurrece time. Defie X i = S i S i 1, (i = 1,2,3 ); S 0 = 0, is a radom variable represetig the time iterval betwee (i 1) th ad i th software failure occurrece. The coditioal probability that the i th software failure does ot occur betwee (t, t + x], (x 0) o the coditio that the (i 1) th software failure has occurred at testig time t, is give by: R(x t) = P{X i > x S i 1 = t} = exp[ {m(x + t) m(t)}], (3.4) t 0, x 0. substitutig (3.2) i (3.4) we have delayed S-shaped liear software reliability R 1 (x t) = exp [ {(a + 2aα b ) e bt {(1 + bt) (1 + b(t + x)e bx } + aα b (1 + bx) 3axα (1 + bt)(1 + b(t + x)) }], x, t 0 (3.5)
7 David D. Haagal ad Nileema N. Bhalerao 863 (b) Expected Residual Fault Cotet Cosider the expectatio of {a(t) N(t)} for the NHPP model i (3.2). Sice N(t) is a radom variable, the umber of residual fault cotet at testig time t is: (t) = a(t) E[N(t)] = a(t) m(t) (3.6) Let 1 (t) deote the expected residual fault cotet for delayed S-shaped liear SRM, that is 1 (t) = a 1 (t) m 1 (t) (3.7) 1 (t) = a(1 + αt) [( a 2aα b ) e bt (1 + bt) + aα b (1 + bt) +(a 2aα b + 3aα b(1 + bt) )]. (3.8) 3.1.1Parameter Estimatio I this sectio we discuss the method of estimatig the parameters of the models metioed above Estimatio usig iterval Domai Data Suppose that pairs of observatios (t i, y i ); (i = 1,2,3,, ; 0 < t 1 < t 2 < < t ) are made durig the testig phase where y i deote the umber of software faults detected up to the testig time t i, i = 1,2,,. The correspodig probability mass fuctio is P[N(t 1 ) = y 1, N(t 2 ) = y 2,, N(t ) = y ] ad hece the likelihood fuctio for the iterval domai is give by L = (m(t i) m(t i 1 )) y i y i 1 exp[ m(t (y i y i 1 )! i ) m(t i 1 )] (3.9) i=1 where t 0 = 0 ad y 0 = 0. Takig the atural logarithm of equatio (3.9) yields loglikelihood fuctio, that is ll = (y i y i 1 ) l[m(t i ) m(t i 1 )] m(t ) l[(y i y i 1 )!] i=1 i=1 (3.10)
8 864 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION Substitutig mea value fuctio m 1 (t) ito the equatio (3.10), we get logarithmic of likelihood fuctio excludig the costat terms, ll = (y i y i 1 ) l [( a 2aα b ) e bt i (1 + bti ) + aα b (1 + bt i) i=1 + (a 2aα b ) + 3aα b(1 + bt i ) ( a 2aα b ) e bt i 1 (1 + bti 1 ) + aα b (1 + bt i 1) + (a 2aα b ) + 3aα b(1 + bt i 1 ) ] ( a 2aα b ) e bt (1 + bt ) + aα b (1 + bt ) + (a 2aα b ) + 3aα b(1 + bt ) (3.11) Closed form expressios of MLEs of a, α ad b caot be obtaied. However, the MLEs ca be obtaied by iterative solutio procedure. Settig the derivatives of the loglikelihood fuctio for (a, α, β, b) to zero, the MLEs (a, α, b ) are obtaied by iterative solutio procedure i.e., Newto Raphso method. We have used R-software for the iterative solutio procedure. Let a, α, b be the MLEs of a, α, b respectively. 3.2 Quadratic Fault Cotet Rate Fuctio Here we assume that fault itroductio rate is a quadratic fuctio ad depedet o time, a(t) = a 2 (t) = δ + αt βt 2, δ > 0, α > 0, β > 0 t 0 where δ is the umber of iitial fault cotet i the system prior to the testig, ad α ad β are icreasig ad decreasig rate of the umber of itroduced faults to the iitial fault cotet fuctio. Let m 2 (t) be the MVF whe fault cotet fuctio a 2 (t) is substituted for a(t) i (2.6) thus have m 2 (t) = b(t)[δ + αt βt 2 m t 2 (t)]. δ > 0, α > 0, β > 0, b(t) > 0, t 0 (3.12) b2 t with b(t) =. Solvig the differetial equatio with respect to m (1+bt) 2(t) uder the iitial coditio m 2 (0) = 0 we derived the mea value fuctio give by : m 2 (t) = α b (1 + bt) + (δ 2α b + 3α b(1 + bt) + 4β b(1 + bt) ) ( 2α b + 4β b + δ) e bt (1 + bt) (3.13)
9 David D. Haagal ad Nileema N. Bhalerao 865 We shall call the preset NHPP model with MVF give i (3.13) as delayed S-shaped quadratic model. The itesity fuctio of this model is give by: 3α + 4β + 4β λ 2 (t) = α + (2α + δ) e (1 + bt) bt b 2 t (3.14) 2 b Based o delayed S-shaped quadratic model, we ca derive the followig quatitative measures useful for software reliability assessmet. (a) Software Reliability R(x t) = P{X i > x S i 1 = t} = exp[ {m(x + t) m(t)}], t 0, x 0. (3.15) Substitutig (3.13) i (3.15) we have delayed S-shaped quadratic software reliability R 2 (x t) = exp [ { α (3α + 4β)x (1 + bx) b (1 + b(t + x))(1 + bt) 2α + 4β ( + δ) e bt [e bx (1 + b(t + x)) b (1 + bt)]}], x, t 0. (3.16) (b) Expected Residual Fault Cotet Cosider the Expectatio of {a(t) N(t)} for the NHPP model i (3.13). Sice N(t) is a radom variable, the umber of residual fault cotet at testig time t is: (t) = a(t) E[N(t)] = a(t) m(t) (3.17) Let 2 (t) deote the expected residual fault cotet for delayed S-shaped quadratic SRM, that is: 2 (t) = a 2 (t) m 2 (t) (3.18) 2(t) = δ + αt βt 2 α b (1 + bt) + (δ 2α b + ( 2α b + 4β b + δ) e bt (1 + bt) 3α b(1 + bt) + 4β b(1 + bt) ) (3.19) 3.2.1Parameter Estimatio I this sectio we discuss the method of estimatig the parameters of the method metioed above Estimatio usig iterval Domai Data The likelihood for the iterval domai data is give by L = (m(t i) m(t i 1 )) y i y i 1 exp[ m(t (y i y i 1 )! i ) m(t i 1 )] (3.20) i=1
10 866 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION where t 0 = 0 ad y 0 = 0. Takig the atural logarithm of equatio (3.20) yields log-likelihood fuctio, that is ll = (y i y i 1 ) l[m(t i ) m(t i 1 )] m(t ) i=1 l [(y i y i 1 )!] i=1 (3.21) substitutig mea value fuctio m 1 (t) ito the equatio (3.21), we get logarithmic of likelihood fuctio excludig the costat terms. ll = (y i y i 1 ) l [ α b (1 + bt i) i=1 + (δ 2α b + 3α b(1 + bt i ) + 4β b(1 + bt i ) ) ( 2α b + 4β b + δ) e bt i (1 + bti ) α b (1 + bt i 1) + (δ 2α b + 3α b(1 + bt i 1 ) + 4β b(1 + bt i 1 ) ) ( 2α b + 4β b + δ) e bt i 1 (1 + bti 1 )] α b (1 + bt ) + (δ 2α b + 3α b(1 + bt ) + 4β b(1 + bt ) ) ( 2α b + 4β b + δ) e bt (1 + bt ) (3.22) Closed form expressios for MLEs of a, α ad b caot be obtaied. However, the MLEs ca be obtaied by iterate solutio procedure. Settig the derivatives of the loglikelihood fuctio for (a, α, β, b) to zero, the MLEs (a, α, b ) are obtaied by iterative solutio procedure i.e., Newto Raphso method. We have used R-software for the iterative solutio procedure. Let a, α ad b be the MLEs of a, α, b respectively. 3.3 Expoetial Fault Cotet Rate Fuctio Here we assume that the fault itroductio rate is expoetial fuctio depedet o time. We chose the followig fault cotet fuctio: a(t) = a 3 (t) = αe βt, α > 0, β > 0, t 0 where α is a umber of iitial fault cotet i the system prior to the testig ad b is a icreasig rate of the umber of itroduced faults to the iitial fault cotet fuctio. Let m 3 (t) be the MVF whe fault cotet fuctio a 3 (t) is substituted for a(t) i (2.6) thus we have m 3 (t) = b(t)[αe βt m t 3 (t)], a > 0, b(t) > 0, t 0 (3.23)
11 David D. Haagal ad Nileema N. Bhalerao 867 with b(t) = b2 t. Solvig the differetial equatio give i (3.23) with respect to m 1+bt 3(t) uder the iitial coditio m 3 (0) = 0 we derived the mea value fuctio give by: αβb 2 e βt αβb(1 + bt) m 3 (t) = β(β b) 2 (1 βt + bt) (1 + bt) (β b) 2 e bt (3.24) We shall call the preset model with MVF give i (3.24) as delayed S-shaped expoetial model. The itesity fuctio of this model is give by: λ 3 (t) = αbβ e βt (β b) [e βt β (β b)(1 + bt) b e βt (β b)(1 + bt) 2 b2 te bt (β b) ] (3.25) Based o delayed S-shaped expoetial model, we ca derive the followig quatitative measures useful for software reliability assessmet. (a) Software Reliability R(x t) = P{X i > x S i 1 = t} (3.26) = exp[ {m(x + t) m(t)}], t 0, x 0. substitutig (3.24) i (3.26) we have delayed S-shaped expoetial software reliability αb 2 β(t + x) + b(t + x))e β(t+x) R 3 (x t) = exp [ { [(1 (β b) 2 (1 + b(t + x)) (1 βt + bt)e βt ] (1 + bt) αβb (β b) 2 [(1 + b(t + x))e b(t+x) (1 + bt)e bt ]}], x, t 0 (3.27) (b) Expected Residual Fault Cotet Cosider the Expectatio of {a(t) N(t)} for the NHPP model i (3.24). Sice N(t) is a radom variable, the umber of residual fault cotet at testig time t is: (t) = a(t) E[N(t)] = a(t) m(t) (3.28) Let 3 (t) deote the expected residual fault cotet for delayed S-shaped expoetial SRM, that is: 3 (t) = a 3 (t) m 3 (t) (3.29) 3 (t) = αe bt αbβ e βt [ β b β + e βt (β b)(1 + bt) e bt (1 + bt) ] (3.30) β b 3.3.1Estimatio of Parameters Usig Iterval Domai Data The likelihood fuctio metioed above for the iterval domai data is give by L = (m(t i) m(t i 1 )) y i y i 1 exp[ m(t (y i y i 1 )! i ) m(t i 1 )] (3.31) i=1 where t 0 = 0 ad y 0 = 0. Takig the atural logarithm of equatio (3.31) yields loglikelihood fuctio, that is
12 868 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION ll = (y i y i 1 ) l[m(t i ) m(t i 1 )] m(t ) l [(y i y i 1 )!] i=1 i=1 (3.32) substitutig mea value fuctio m 1 (t) ito the equatio (3.32), we get logarithmic of likelihood fuctio excludig the costat terms. ll = (y i y i 1 ) l [ αbβ β b i=1 [ e βti β + e βti αbβ e βti 1 e βt i 1 [ + (β b) β (β b)(1 + bt i 1 ) ebt i 1(1 + bt i 1 ) ]] (β b) (β b)(1 + bt i ) e bti (1 + bti ) ] (β b) αbβ e βt [ (β b) β + e βt (β b)(1 + bt ) e bt(1 + bt ) ] (β b) (3.33) Closed form expressios for MLEs of a, α ad b caot be obtaied. However, the MLEs ca be obtaied by iterate solutio procedure. Settig the derivatives of the loglikelihood fuctio for (a, α, β, b) to zero, the MLEs (a, α, b ) are obtaied by iterative solutio procedure i.e., Newto Raphso method. We have used R-software for the iterative solutio procedure. Let a, α, b be the MLEs of a, α, b respectively. 4. Aalysis of Three Data Sets The Data Set I is about US Tactical Data Systems (NTDS) give by [Goel ad Okumoto (1979)a]: the software data set was extracted from iformatio about failures i the developmet of software for the real time multi-computer complex of the US Naval Fleet Computer Programmig Ceter of the US Naval Tactical Data System (NTDS). The software cosists of 38 differet project modules. The time horizo is divided ito four phases: Productio phase, test phase, user phase ad subsequet test phase. The 26 software failures were foud durig the productio phase, five durig the test phase ad the last failure was foud o 1th Ja Oe failure was observed durig the user phase, i September 1971, ad two failures durig the test phase i The Data Set II is about O Lie Data Etry IBM Software Package: The data reported by [Ohba (1984)] are recorded from testig a olie data etry software package developed by IBM. The Data Set III is about Real-Time Commad ad Cotrol System: The data set was reported by [Musa et el. (1987)] based o failure data from a real-time commad ad cotrol system, which represets the failure observed durig system testig for 25 hours of CPU time. Applyig data sets DS I, DS II ad DS III o the models discussed above, we obtai the maximum likelihood (ML) estimates ad goodess of fit measures, such as sum of squares due to error (SSE), mea squares error (MSE), predictive ratio risk (PRR) [Pham ad Deg (2003)] ad Akaike s iformatio criterio (AIC) values for existig ad for the proposed fiite failure models are summarized i Table 1, 2 ad 3 respectively. Further we have
13 David D. Haagal ad Nileema N. Bhalerao 869 plotted the actual data ad estimated values of cumulative faults (or Mea Value Fuctio (MVF)) of fiite failure models agaist time for data sets DS I, DS II ad DS II as show i Figures 1, 2 ad 3 respectively. The S-shaped model, Yamada et al (1984), with fault cotet fuctio as costat is compared with the proposed delayed S-shaped liear, quadratic ad expoetial model. From the Table 1, we observe that the SSE, MSE, PRR, AIC ad BIC values of our proposed delayed S-shaped liear, quadratic ad expoetial models are smaller tha the existig delayed S-shaped ad Pham model. Hece we may coclude that our proposed models perform better. Further we observe that the SSE, MSE, PRR, AIC ad BIC values for delayed S-shaped expoetial model are smaller as compared to the other two proposed models ad existig delayed S-shaped ad Pham model. Hece we coclude that our proposed delayed S-shaped expoetial model performs better tha all other models for Data Set I. Table 1 : ML ad AIC estimates of Models for DS I Model Name Estimates SSE MSE PRR AIC BIC a = Delayed S-shaped b = α = Pham γ =1.84 a = Delayed S-shaped α = Liear b = Delayed S-shaped Quadratic Delayed S-shaped Expoetial δ =4 α =0.1 β =0.2 b =0.1 α =39.03 β =0.001 b =
14 870 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION Figure 1 : Plot of Data ad Estimated cumulative Faults agaist time of DS I From the Figure 1, we observe that for our proposed delayed S-shaped liear, quadratic ad expoetial models, the estimated MVF is closer to the actual data poits as compared to the MVF of existig delayed S-shaped ad Pham software reliability growth models. Hece we coclude that our proposed models explais the data better tha the give existig models. Figure 2 : Plot of Estimated Residual Fault Cotet Fuctio agaist time of DS I
15 David D. Haagal ad Nileema N. Bhalerao 871 The Figure 2 illustrates the behavior of residual fault cotet fuctios of software reliability growth models for delayed S-shaped model ad our proposed delayed S-shaped liear, quadratic ad expoetial models. We observe that i compariso with the existig closed S-shaped model our proposed models residual fault cotet fuctios are gettig closer to zero as time icreases. Hece our proposed models perform better for data set I From the Table 2, we observe that the SSE, MSE, PRR, AIC ad BIC values of our proposed delayed S-shaped liear, quadratic ad expoetial models are smaller tha the existig delayed S-shaped model ad Pham model. Hece we may coclude that our proposed models perform better. Further we observe that the SSE, MSE, PRR, AIC ad BIC values for delayed S-shaped expoetial model are smaller as compared to the other two proposed models ad existig delayed S-shaped model ad Pham model. Hece we coclude that our proposed delayed S-shaped expoetial perform better tha all other models for Data Set II. Table 2 : ML ad AIC estimates of Models for DS II Model Name Estimates SSE MSE PRR AIC BIC Delayed S-shaped a = b = Pham α = γ = a =8 Delayed S-shaped Liear α = b = Delayed S-shaped Quadratic Delayed S-shaped Expoetial δ =4.9 α =0.030 β =0.001 b =0.1 α =23 β = b = From the Figure 3, we observe that for our proposed delayed S-shaped liear, quadratic ad expoetial models, the estimated MVF is closer to the actual data poits as compared to the MVF of existig delayed S-shaped ad Pham software reliability growth models. Hece we coclude that our proposed models explai the data tha the give existig model The Figure 4 illustrates the behavior of residual fault cotet fuctios of software reliability growth models for delayed S-shaped model ad our proposed delayed S-shaped liear, quadratic ad expoetial models. We observe that i compariso with the existig closed S-shaped model our proposed models residual fault cotet fuctios are gettig closer to zero as time icreases. Hece our proposed models perform better for data set II. From the Table 3, we observe that the SSE, MSE, PRR, AIC ad BIC values of our
16 872 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION proposed delayed S-shaped liear, quadratic ad expoetial models are smaller tha the existig delayed S-shaped model ad Pham model. Hece we may coclude that our proposed models perform better. Further we observe that the SSE, MSE, PRR, AIC ad BIC values for delayed S-shaped expoetial model are smaller as compared to the other two proposed models ad existig delayed S-shaped model ad Pham model. Hece we coclude that our proposed delayed S-shaped expoetial perform better tha all other models for Data Set III. Figure 3 : Plot of Data ad Estimated Cumulative Faults agaist Time of DS II From the Figure 5, we observe that for our proposed delayed S-shaped liear, quadratic ad expoetial models, the estimated MVF is closer to the actual data poits as compared to the MVF of existig delayed S-shaped ad Pham software reliability growth models. Hece we coclude that our proposed models explai the data tha the give existig model The Figure 6 illustrates the behavior of residual fault cotet fuctios of software reliability growth models for delayed S-shaped model ad our proposed delayed S-shaped liear, quadratic ad expoetial models. We observe that i compariso with the existig closed S-shaped model our proposed models residual fault cotet fuctios are gettig closer to zero as time icreases. Hece our proposed models perform better for data set III.
17 David D. Haagal ad Nileema N. Bhalerao 873 Figure 4 : Plot Estimated Residual Fault Cotet Fuctio agaist time of DS II Table 3 : ML ad AIC estimates of Models for DS III Model Name Estimates SSE MSE PRR AIC BIC Delayed S-shaped a = b = Pham α = γ = Delayed S-shaped Liear a = α = b = Delayed S-shaped Quadratic Delayed S-shaped Expoetial δ =3 α =0.045 β =0.3 b =0.11 α = β = b =
18 874 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION Figure 5 : Plot of Data ad Estimated Cumulative Faults agaist of DS III. Figure 6 : Plot of Estimated Residual Fault Cotet Fuctio agaist time of DS III
19 David D. Haagal ad Nileema N. Bhalerao Coclusios ad Remarks I this paper we proposed three differet software reliability growth models based o three types of fault cotet rate fuctio a(t). The model parameters are estimated usig maximum likelihood method by usig the iterval domai data type. Three data sets are illustrated for the above estimate techique ad model comparisos. The proposed models are compared with the existig delayed S-shaped models, usig sum of squares due to error, mea squares sum of error, predictive ratio risk, Akaikes iformatio criterio ad Bayesia Iformatio criterio. It may be observed that the proposed models perform better tha the existig models for all the three data sets. Further we also plotted estimated MVF values versus time. Ackowledgemets We thak the referee for the valuable suggestios ad commets which resulted ito the improved versio of the earlier mauscript.
20 876 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION Refereces [1] Ahmad, N., Kha, M.G.M. ad Rafi L.S. (2011). Aalysis of a iflectio S-shaped software reliability model cosiderig log-logistic testig-effort ad imperfect debuggig. Iteratioal Joural of Computer Sciece ad Network Security, 11(11), [2] Bittati, S., Bolzer, P., Pedrotti, E., Pozzi, N., ad Scattolii, R. (1988). A flexible modelig approach for software growth. I software Reliability Modelig ad Idetificatio, G. Goos ad J. Haramais, Eds. Berli: Spriger Verlag, pp [3] Bokhari, M.U., Siddiqui, A., ad Ahmad, N. (2017). Testig effort depedet delayed S-shaped software reliability growth model with imperfect debuggig. Iteratioal Joural of Computer Sciece ad Egieerig, 9(5), [4] Chatterjee, S. ad Shukla, A. (2016). Chage poit-based software model uder imperfect debuggig with revised cocept of fault depedecy. Joural of Risk ad Reliability, 230(6), [5] Che, Z. (2010). Empirical Bayes aalysis o the power law process with atural cojugate priors. Joural of Data Sciece, 8(1), [6] Gupta, A., Choudhary, D. ad Saxea, S. (2011). Software reliability estimatio usig Yamada delayed S-shaped model uder imperfect debuggig ad time lag. Iteratioal Joural of Computer Applicatios, 23(7), [7] Goel, A. L. ad Okumotu, K. (1979). Time depedet fault-detectio rate model for software ad other performace measures. IEEE Trasactio o Reliability, vol.28 pp [8] Haagal, D. D. ad Bhalerao, N. N. (2016a). Modelig ad statistical iferece o geeralized iverse Weibull software reliability growth model. Joural of the Idia Society for Probability ad Statistics, 17(2), [9] Haagal, D. D. ad Bhalerao, N. N. (2016b). Aalysis of NHPP software reliability growth models. Iteratioal Joural of Statistics ad Reliability, Egieerig, 3(2), [10] Haagal, D. D. ad Bhalerao, N. N. (2017). Modelig o exteded iverse Weibull software reliability growth model. Joural of Idia Associatio for Product, Quality & Reliability, 42(2), [11] Kapur, P. K. ad Garg, R.B. (1992). A software reliability growth model for a error removal pheomeo, Software Egieerig Joural, 7, [12] Kapur, P. K. ad Garg, R.B. ad Kumar, S. (1999). Cotributios to hardware ad software reliability, World Scietific Publishig Co. Ltd., Sigapore. [13] Kareer, N., Kapur, P. K. ad Grover, P.S. (1990). A S-shaped software reliability growth model with two types of errors. Microelectroics Reliability, 30(6),
21 David D. Haagal ad Nileema N. Bhalerao 877 [14] Kaur, D. ad Sharma, M. (2015). Software Reliability models: Time betwee failures ad accuracy estimatio. Iteratioal Joural of Computer Sciece ad Iformatio Techologies, 6(4), [15] Lai, R. ad Garg, M. (2012). A detailed study of software reliability models, Joural of software, 7(6), [16] Musa, J. D., Laio, A. ad Okumoto, K. (1987). Software Reliability: Measuremet, Predictio ad Applicatio, McGraw-Hill, New York. [17] Obha, M. ad Chou, X. (1989). Does imperfect debuggig affect software reliability growth models, Proceedig 4 th Iteratioal Coferece o Reliability ad Maitaiability, Tregastel, Frace, pp [18] Obha, M. ad Yamada, S. (1984). S-shaped software reliability growth models. I Proceedigs of the 4 th Iteratioal Coferece o Reliability ad Maitaiability, Tregastel, Frace, pp [19] Obha, H., Osaki, S. ad Y. Hatoyama (1984). Iflectio S-shaped software reliability growth models. Stochastic Models i Reliability Theory, Spriger-Verlag, Berli, [20] Pham, H. (1996). A software cost model with imperfect debuggig, radom life cycle ad pealty cost. Iteratioal Joural of Systems Sciece, vol. 27(5), [21] Pham, H. ad Zhag, X. (1997). A NHPP software reliability model ad its compariso. Iteratioal Joural of Reliability, Quality ad safety Egieerig, 4, [22] Pham, H. (1993). Software Reliability Assessmet: Imperfect debuggig ad multiple failure types i software developmet. EGradG-RAAM-10737, Idaho Natioal Egieerig Laboratory. [23] Pham, H. (1999). Reliability aalysis for dyamic cofiguratios of systems with three failures models, Reliability Egieerig ad System Safety, 63, [24] Pham, H. (2006). System Software Reliability, Spriger Series i Reliability Egieerig Spriger, Lodo, pp [25] Pham, H. (2007) A imperfect debuggig fault-detectio depedet parameter software. Iteratioal Joural of Automatio ad Computig, 4(4), [26] Pham, H. ad Zhag, X. (1997). A NHPP software reliability model ad its compariso. Iteratioal Joural of Reliability. Quality ad Safety Egieerig, 4, [27] Pham, H. ad Zhag, X. (2003). NHPP software reliability ad cost models with testig coverges. Europea Joural of Operatioal Research, 145(2), [28] Teg, X. ad Pham, H. (2004). Software cost model for quatifyig the gai with cosideratios of radom field eviromets. IEEE trasactios Computers, 53(3), [29] Teg, X. ad Pham, H. (2006). A ew methodology for predictig software reliability i the radom field eviromets, IEEE Trasactios o Reliability, 53(3),
22 878 ANALYSIS OF DELAYED S SHAPED SOFTWARE RELIABILITY GROWTH MODEL WITH TIME DEPENDENT FAULT CONTENT RATE FUNCTION [30] Tokuo, K. ad Yamada, S. (2000). A imperfect debuggig model with two types of hazard rates for software reliability measuremet ad assessmet. Mathematical ad Computer Modellig, 3, [31] Yamada, S. ad Osaki, S. (1985). Reliability growth modelig: Models ad applicatios. IEEE Trasactios o Software Egieerig, 11(12), [32] Yamada, S., Obha, M. ad Osaki, S. (1983). S-shaped reliability growth modelig for software fault detectio, IEEE Trasactios o Reliability, 32(5), [33] Yamada, S., Obha, M. ad Osaki, S. (1984). S-shaped software reliability growth models ad their applicatios. IEEE Trasactios o Reliability, 33, [34] Yamada, S., Tokuo, K. ad Osaki, S. (1992). Imperfect debuggig models with fault itroductio rate for software reliability assessmet. Iteratioal Joural of Systems Scieces, 23(12), [35] Zhag, X. ad Pham, H. (2000). Comparisos of o-homogeeous Poisso process software reliability models ad its applicatios. Iteratioal Joural of Systems Sciece, 31(9), [36] Zhag, X., Teg, H. ad Pham, H. (2003). Cosiderig fault removal efficiecy i software reliability assessmet. IEEE Trasactios o System, Maagemet, ad Cyberetics-Part A, 33(1), [37] Zaho, M. ad Xie, M. (1996). O maximum likelihood estimatio o a geeral o-homogeeous Poisso process. Scadiavia J. Statistics, 23(4),
Revisiting the performance of mixtures of software reliability growth models
Revisitig the performace of mixtures of software reliability growth models Peter A. Keiller 1, Charles J. Kim 1, Joh Trimble 1, ad Marlo Mejias 2 1 Departmet of Systems ad Computer Sciece 2 Departmet of
More informationDiscrete Software Reliability Growth Models with Discrete Test Effort Functions
Iteratioal Joural of Software Egieerig & Applicatios (IJSEA), Vol.2, o.4, October 2 Discrete Software Reliabilit Growth Models with Discrete Test Effort Fuctios Sk.MD.Rafi ad Shaheda Akthar 2 Assoc.Professor,
More informationThe Extended Weibull Geometric Family
The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationA SOFTWARE RELIABILITY GROWTH MODEL FOR THREE-TIER CLIENT SERVER SYSTEM
2 Iteratioal Joural of Computer Applicatios (975 8887) Volume No. A SOFTWARE RELIABILITY GROWTH MODEL FOR THREE-TIER CLIENT SERVER SYSTEM Pradeep Kumar Iformatio Techology Departmet ABES Egieerig College,
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationA Study on Weibull Distribution for Estimating the Reliability Dr. P. K. Suri 1, Parul Raheja 2
www.ijecs.i Iteratioal Joural Of Egieerig Ad Computer Sciece ISSN:239-7242 Volume 4 Issue 7 July 205, Page No. 3447-345 A Study o Weibull Distributio for Estimatig the Reliability Dr. P. K. Suri, Parul
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationA MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS
Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationCivil Engineering Computation
Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationCharacterizing graphs of maximum principal ratio
Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationEmpirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.
Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More information35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD
N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD Noah J. DeMoes, Gabriel T. Ba, Bryce D. Wilkis, Theodore
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationThroughput-Delay Scaling in Wireless Networks with Constant-Size Packets
Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,
More informationSOFTWARE usually does not work alone. It must have
Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationSectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work
200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationSecond-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems
Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationOn the Accuracy of Vector Metrics for Quality Assessment in Image Filtering
0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationBayesian Network Structure Learning from Attribute Uncertain Data
Bayesia Network Structure Learig from Attribute Ucertai Data Wetig Sog 1,2, Jeffrey Xu Yu 3, Hog Cheg 3, Hogya Liu 4, Ju He 1,2,*, ad Xiaoyog Du 1,2 1 Key Labs of Data Egieerig ad Kowledge Egieerig, Miistry
More informationArithmetic Sequences
. Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationperformance to the performance they can experience when they use the services from a xed location.
I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi
More information