Discrete and Continuous Time High-Order Markov Models for Software Reliability Assessment
|
|
- Lucas Fleming
- 6 years ago
- Views:
Transcription
1 Dscrete and Contnuous Tme Hgh-Order Markov Models for Software Relablty Assessment Vtaly Yakovyna and Oksana Nytrebych Software Department, Lvv Polytechnc Natonal Unversty, Lvv, Ukrane Abstract. Due to the crtcal challenges and complexty of modern software systems developed over the last decade, there has arsen an ever ncreasng attenton to look for products wth hgh relablty at reasonable costs. Software development process moves toward component-based desgn, and archtecture based approach n software relablty modelng s wdely used. However, n lots of models for software relablty assessment the assumpton of ndependent software runs s a smplfcaton of real software behavour. Ths paper descrbes two software relablty models that use hgh-order Markov chans thus takng nto account dependences among software component runs for more accurate software relablty assessment. The effcency and accuracy of developed models s nvestgated by the example of several software products. It s shown that usng the software relablty models based on the hgh-order Markov chans results n the software relablty assessment accuracy up to 10 20%. Keywords. Software relablty, archtecture-based model, hgh-order Markov chans. Key Terms. SoftwareComponent, SoftwareSystem, MathematcalModel. 1 Introducton Computer systems are wdely used n modern ndustry for control and automaton purposes. All of these systems are controlled by software. Thus, software s used n ar traffc control, nuclear power plants, automated patents montorng etc. Therefore hgh requrements for software relablty are demanded because falures of such systems can lead not only to sgnfcant fnancal losses, but also threaten human lfe and health. Although technques that allow assessng and ensurng the specfed hardware relablty requrements have been developed, there are no common approaches for software systems assessment. Accordng to STD-729, software relablty s defned as the probablty of falurefree software operaton for a specfed perod of tme n a specfed envronment [1, 2]. Although Software Relablty s defned as a probablstc functon, and comes wth the noton of tme, t should be noted that, contrast to tradtonal hardware rela-
2 blty, software relablty s not a drect functon of tme [1]. Electronc and mechancal parts may become "old" and wear out wth tme and usage, but software wll not rust or wear-out durng ts lfe cycle. Software wll not change over tme unless ntentonally changed or upgraded. The hstory of software relablty assessment methods and tools began n the 60s of last century. A number of researchers [3-7] worked on ssues of development and research of software relablty analyss and assessment models and methods that would allow reducng the costs requred for software testng stage. New software relablty assessment models that reflect the nternal structure of the applcaton and nteracton of ts components [6], called archtectural-based models, are beng developed because of ncreasng complexty of software systems and the result of expandng ther functonal purpose. In known models based on archtectural approach [6, 7] the theory of frst order Markov chans s used wth the assumpton that the software components runs are ndependent. Ths assumpton s not always true due to the complexty of modern software archtecture and huge set of usage scenaros ths assumpton [8, 9]. Therefore, for the development of adequate software relablty assessment models, whch wll mprove the testng process (e.g. allow to reduce the needed resources), one should consder the hgh-order Markov chans, whch allow to take nto account the nterdependence of components runs [10]. Ths paper descrbes the software relablty assessment models based on archtectural approach, whch use dscrete and contnuous tme hgh-order Markov chans and ther comparson based on real world data. Nowadays archtecture-based software relablty models have been well studed n theory, but there s lack of papers descrbng ther practcal applcatons. Developng of hgh-order models for software relablty assessment s not descrbed enough n lterature as well. Thus, the development of new archtecture-based software relablty assessment models that take nto account the dependences among software component runs along wth ther applcaton to real world data s stll a problem watng for soluton. 2 Software Relablty Model wth Dscrete Tme Hgh-Order Markov Chan Ths model consders absorbng Markov process that mples the exstence of one or more absorbng states,.e. states that, once entered, cannot be left. The developed software relablty assessment model [10] s herarchcal, that s ntally software archtecture parameters are calculated based on software usage model [11] usng the theory of Markov processes, and then the behavour of each component falures s taken nto account. The dscrete tme HOMC software relablty model can be descrbed usng the followng components C s the graph wth vertces correspondng to software components, whle edges ndcates the program control flow ( 1, N, where N s the number of program components); P p.. kl s the hgh-order transton proba-
3 blty matrx ( p.. kl transton probablty from component і to component l dependng on beng n prevous K components); Q q.. kl s the ntal probablty vector; t s the falure rate of -th software component. Accordng to ths model the relablty of the whole system s calculated as R N R l l1. In turn, the relabltes of each component ( R l ) usng hgh-order Markov chans are calculated by R exp( l V t.. k... kl... kl ( t) dt) kl 0. To calculate V.. the expected number of vsts a component l dependng on beng n prevous K components one has to solve the followng system of lnear equatons: N 1 V j.. kl q.. k V.. k p.. kl (3) 1, here t.. denotes the tme spent at the component l dependng on beng n prevous kl K components. l (1) (2) 3 Software Relablty Model wth Contnuous Tme Hgh- Order Markov Chan Usng dscrete-tme model has a number of sgnfcant smplfcatons and restrctons. Thus, ths model takes nto account only the number of vsts to -th component wthout takng nto account of the dstrbuton functon of ths random varable (whle takng t nto account the expected value should be used). In addton, t s clear that at any gven tme t the software falure s generally caused by the falure of the software component, whch s executed at a gven tme (n case of sequental connecton of software components n Relablty Block Dagram). Thus, to ncrease the degree of adequacy of the software relablty archtectural model the contnuous tme Markov chans should be used. The contnuous tme HOMC software relablty model can be descrbed usng the followng components C s the graph wth vertces correspondng to software components, whle edges ndcates the program control flow ( the number of program components); a 1, N, where N s A s the hgh-order transton probabl-
4 ty matrx, j 1, N (the values of matrx elements a depends on the way of gettng nto the state ); p s the probablty beng n state P p t s the probablty vector, where t t C at tme t ; s the falure rate of -th software component. In ths case, the falure rate of a software system consstng of N components can be wrtten as [12] here N t p t t 1 t s the falure rate of -th component, t, (4) p s the probablty of -th component executon at tme t. Components falure rates t can be obtaned from the results of unt testng usng known software relablty models, for example ones based on an nhomogeneous Posson process [13]. If the flow control between the components of the software s presented as a Markov process wth contnuous tme, assumng that the -th state of the process s the executon of -th component, the tme dependences of the probabltes beng n -th state ( t ) can be obtaned by solvng the system of equatons of the Kolmogorov p Chapman [14] for ths process: t dp ( t) p j ( t) j ( t) p j ( t), S (5) dt js js, here (t) s the transton ntensty from component і to component j at tme t, and S denotes the set of all system states. In general the transton ntenstes (t) depends on the transton probabltes a and could be calculated from latter. To take nto account the nterdependence of executon of software component (and consequently changes of transton probablty from -th state) dependng on the way of gettng to the current state, the hgh-order Markov chan should be used (the order K of the model determnes the accounted length of the path). In a case of hgh-order Markov chans the actual problem s to calculate the transton probabltes dependng on the program control flow background. It s well known that a hgh order Markov chan can be represented as a frst order chan by approprate redefnng the state space [15]. For software mplementaton of models that use hgh-order chans, t s necessary to have the formalzed algorthm for ths representaton. Usng the analogy wth the known Erlang phase method [16] a hgh-order Markov process can be represented as an equvalent frst-order process wth addtonal vrtual states. Each state of the orgnal graph C (geometrc da-
5 gram, showng the possble states of the system and the possble transtons of the system from one state to another) s splt nto such number of vrtual states as many dfferent paths of length K to ths state exst. Thus the problem soluton essentally s reduced to usng of graph theory. Therefore, to calculate the number m of chans of K-th order from state to state j the followng expresson based on the Floyd method can be used: m K S K 1 m el l j1 here e are the elements of the dentty matrx. Usng (6) one can buld an equvalent graph C whch s a representaton of the ntal graph C, takng nto account all K -th order paths to -th state. Ths allows to avod the dependences of the transton ntenstes (t) on the program control flow background. Then the tme dependence of the software component executon probablty s obtaned by solvng the system of Kolmogorov Chapman equatons (5) for the equvalent frst order Markov process. Usng ths dependence n (4) together wth the component falure rate, the falure rate of the whole software system can be calculated. For calculaton of software relablty measures, based on the obtaned relatonshp (4), one can use the followng relatons [14]: - relablty functon P(t) the probablty that no falure wll occur wthn the tme nterval [0, t] can be calculated as P( t) exp( t 0 m 1 lj, K (6) ( ) d ) (7) - mean operatng tme to falure T l 1 ) 0 T P( d (8) 4 Determnaton of the Markov Chan Order for Software Relablty Assessment In ths paper t s proposed to use AIC and BIC crtera [17] snce they are not a hypothess test and they don t use the sgnfcance level. Although these crtera gve consstent results and don t depend on the estmated model order. They are effcently
6 used for weather forecastng and selecton of adequate envronmental model [18]. But the usage of these crtera n software relablty modelng stll remans unexamned. In general AIC crteron [19] s calculated by the followng expresson: AIC 2k 2ln( L), (9) here k s the number of ndependent parameters n the model, and L s the model s maxmum lkelhood functon. If the value of ths software model s maxmum lkelhood functon s substtuted n the expresson (9), and nstead of parameter k one substtute the number of the K-th K order model parameters, whch contan N components ( k N ( N 1) ), then the followng expresson can be obtaned [20] here kl AIC ( K) 2N K ( N 1) 2ln( p n.. kl.. kl ), (10), j,.., k, l n.. s the number of transtons from component і to component l dependng on beng n prevous components ( j... k l ) n observed sequence and p.. s the transton probablty n ths sequence. kl As t can be seen from (10), ths crteron s ndependent of sample sze. Therefore, AIC crteron s used n the case of a large sample sze (observable sequence) when the software s tested many tmes and the sequence of software component runs s logged. An alternatve to AIC crteron s ВІС [21], whch takes nto account the number of elements n observable sequence and expressed as BIC ( K) 2ln( L) ln( n) k. (11) In the case of usng the BIC crteron for the Markov chan optmal order determnaton n the case of software relablty modelng, the expresson smlar to AIC crteron (10) s obtaned: BIC ( K) 2N K ( N 1)ln( n) 2 n.. kl ln p.. kl. (12), j,.., k, l It s worth noted that the BIC crteron should be used at the small sample sze of emprcal data concernng the software usage, because t mposes stronger penaltes even when the sample sze n>8. Thus, after determnng the order of Markov chan, the well-known classcal Markov tools can be used for software relablty assessment as t was descrbed above.
7 5 Verfcaton of the Models To study the effcency of the developed software relablty assessment model that uses the dscrete tme hgh-order Markov chans, the relabltes of the fve software systems, developed by one of the authors, were calculated usng the frst and the hgh order Markov chan models. The average amount of software components n tested software systems s 10. The results of relablty calculatons usng the frst and the hgh-order models are shown n Fg. 1 along wth the relablty obtaned from unt testng data. 0,90 0,85 Frst-order model Second-order model Testng data Relablty, R 0,80 0,75 0, Software Fg.1. The comparson dagram of the software relablty assessment accuracy usng frst and hgh order dscrete tme models. As shown n fg. 1, the usage of software relablty assessment model based on dscrete tme hgh-order Markov chans makes t possble to ncrease the software relablty accuracy to 6% even for software systems wth a small number of components. To llustrate the effcency of contnuous tme software relablty model, the relablty of the authors' developed program wth four components (n ths case, each component refers to one of the followng program classes Input, Calculaton, Output, Ext) was analyzed. The values of each component falures rates are presented n Table 1. Table 1. Falure detecton frequency for each component Component Falures detecton frequency Input 0.11 Calculaton 0.18 Output 0.09 Ext 0.01
8 The probablty transton matrx and the ntal probablty vector of the Markov chan were calculated and are summarzed n Table 2 and Table 3 correspondngly. Table 2. The frst order probablty transton matrx Component Input Calculaton Output Ext Input Calculaton Output Ext Table 3. The frst order ntal probablty vector Components Input Calculaton Output Ext Probablty The AIC crteron was used for optmal Markov chan order determnaton (the sample set contans 188 entres). The AIC values are lsted n Table 4. Table 4. The values of АІС for dfferent chan orders The process order AIC value The ntal graph C ndcatng the program components and control flow, as well as graph C of the equvalent second order (see Table 4) Markov process are shown n Fg. 2 and 3 correspondngly. The notatons n these fgures are as follows: I correspond to Input state, C to Calculaton, O to Output, and E to Ext state (see Table 2); ndexes ndcates the prevous state n control flow hstory (thus state OC means that the current state Output has been reached from prevous state Calculaton).
9 I C E O Fg.2. Intal graph, representng the components and control flows of the software used for contnuous tme relablty model verfcaton. E Io Ic I C Oc Cc Oo Fg.3. Graph representng an equvalent to the second order Markov chan process for software shown n Fg. 2. Fg. 4 shows the tme dependency of falure rate on tested software system (Fg. 2) obtaned from contnuous tme frst- and second-order Markov chans. It s worth notng that for contnuous tme model smulatons tme was counted as arbtrary tme unts (a.u). As t s seen from ths fgure the frst order model gves slghtly (1 5%) reduced falure rate value for small values of tme, whle t gves sgnfcantly (20%) overestmated falure rate value for mddle tme values range, and when the value of t ncreases by more than 60 a.u. the dfference between values of t obtaned from
10 both models almost tends to be neglgble. Reducng the dfference of t values, obtaned from the frst and the second-order models, to zero at hgh tmes can be explaned by decreasng of the t value tself and by the absence of dfferences n the software behavour descrpton by two models n ths case. In the case of t both models suggest that system s n the Ext state (see Fg. 2, 3) and, accordngly, ts falure rate s lmted by ths component falure rate. Dfferences of t behavour on the ntal evoluton stages of software system can be entrely explaned by dfferences n the software system behavour descrpton by dfferent models, where the frst-order model gnores the nterdependence of software component runs, and therefore the probabltes of components executng are dfferent at gven tme t for both models. Thus, t could be argued that software relablty model based on the hgh order Markov chan descrbes the software system behavour more adequately and determnes ts relablty measures more accurately. 0, frst order model 2 - second order model 0,10 (t) 0, , t, a.u. Fg.4. Tme dependence of the tested software falure rate, obtaned from the frst (1) and second-order (2) models. Ths concluson s confrmed by the analyss of software system relablty functon tme dependence obtaned usng equaton (7) as shown n Fg. 5. Note that the relablty functon s calculated usng Ukranan natonal standards [22] and, as t was ndcated n (7), represents the probablty of falure free operaton durng the tme nterval 0,t, but not exactly at the tme t. So, t s evdently that the relablty functon s tme-decreasng one. As t can be seen from Fg. 5, the dfference n the values P t ncreases up to 20% wth tme value ncreasng. Ths behavor s easly
11 understood f takng nto account the nterval estmaton of relablty for the range 0,t [15], and ts devaton evdently ncreases wth nterval length ncreasng. So, we can conclude that gnorng the nterdependence of software components runs could results n ncreasng naccuracy of software relablty measures estmaton up to 20%. Another measure of relablty, whch was used to determne the developed hghorder model effectveness and adequacy, s the mean operatng tme to falure T 1. The value of mean operatng tme to falure calculated by the expresson (8) s 20.9 tme unts for frst-order model, whle the value obtaned from the second-order model s 23.3 tme unts. Obvously the dfference between the frst and the second-order models s 11.5%, whch can be crucal n the relablty analyss of the complex techncal systems. 1,0 1 - frst order model 2 - second order model 0,8 P(t) 0,6 0,4 0, t, a.u. Fg.5. The tme dependence of the tested software relablty functon, obtaned from the frst (1) and second-order (2) models. Therefore, the usage of software relablty models based on the hgh-order Markov chans even wth a small components number (n ths case there was 4 component software, see Fg. 2) and complexty (n ths case the optmal model order s 2, see Table 4) results n the ncrease of model adequacy and the software relablty assessment accuracy on 10 20%. The value of such growth of relablty estmaton accuracy s especally mportant n the case of complex hardware and software systems n whch the mstake of software component relablty estmaton can repeatedly affect the accuracy of whole system relablty assessment. Usng the hgh-order models for more complex software systems could results n more sgnfcant mprovements of relablty assessment.
12 6 Conclusons In ths paper the software relablty models usng dscrete and contnuous tme hgh-order Markov chans, whch enable consderaton the dependences among software components runs, have been developed. Software relablty assessment based on the hgh-order dscrete tme Markov chans allows to ncrease the software relablty measures accuracy up to 6 %, and hgh-order contnuous tme Markov chan up to 10 20%. The advantage of hgh-order dscrete tme Markov chans model for software relablty analyss s small computng resources needed even for software wth a lot of components, whle the advantages of hgh-order contnuous tme Markov chans model are ndependence from the samplng step (n the case of dscrete tme model t may cause naccurate transton probabltes calculaton), and also automatc consderaton of transtons p that avods unnecessary computatons. Practcal aspects of estmatng nput parameters for the models as well as studyng the dependence of the software relablty on ts characterstcs (components number, the average number of varables n the component, components coheson etc.) wll be descrbed elsewhere. References 1. Lyu, M. R.: Handbook of Software Relablty Engneerng. McGraw-Hll, New York, U.S.A. and IEEE Computer Socety Press, Los Alamtos, Calforna, U.S.A. (1996) 2. Standard Glossary of Software Engneerng Termnology, STD (1991) 3. Musa, J.D.: Valdty of Executon Tme Theory of Software Relablty. IEEE Trans. on Relablty 3, (1979) 4. Goel, A. L., Okumoto K.: Tme-Dependent Error Detecton Rate Model for Software and other Performance Measures. IEEE Trans. on Relablty R-28, (1979) 5. Xe, M.: Software Relablty Modellng. World Scentfc, Sngapore (1991) 6. Goševa-Popstojanova, K., Trved Kshor S.: Archtecture-Based Approach to Relablty Assessment of Software Systems. Performance Evaluaton, 45, ( 2001) 7. Gokhale, S.S., Wong, W.E., Horgan, J.R., Trved Kshor, S.: An Analytcal Approach to Archtecture-Based Software Performance Relablty Predcton. Performance Evaluaton 58(4), (2004) 8. Takag, T., Furukawa, Z., Yamasak, T.: Accurate Usage Model Constructon Usng Hgh- Order Markov Chans. In: Supplementary Proc. 17th Int. Symposum on Software Relablty Engneerng, pp.1 2 (2006) 9. Burkhart, W., Fatha, Z. (Eds.): Testng Software and Systems. Proc. 23rd IFIP WG 6.1 Int. Conf. LNCS, vol (2011) 10. Yakovyna, V., Serdyuk, P., Nytrebych, O., Fedasyuk, D.: Hgh-Order Markov Chans Usage n Software Relablty Analyss. Bulletn of Lvv Polytechnc Natonal Unversty 771, (2013) (n Ukranan) 11. Fedasyuk, D., Yakovyna, V., Serdyuk, P., Nytrebych О.: Varable State-Based Software Usage Model Based on ts Varables. Econtechmod 3, (2014) 12. Yakovyna, V., Masyukevych, V.: The Model for Software Relablty Estmaton Usng Hgh-Order Contnuous-Tme Markov Chans. In: Proc.9th Int. Scentfc and Techncal Conference on Computer Scence and Informaton Technologes, pp (2014)
13 13. Senv, M., Yakovyna, V., Chabanyuk, Ya., Fedasyuk, D.: The Method of Relablty Predcton and Estmaton Based on Model wth Dynamc Index of Project Sze. Computng 10, (2011) (n Ukranan) 14. Polovko A., Gurov, S.: Fundamentals of the Relablty Theory. Practcal work. BHV- Peterburg (2006) (n Russan) 15. Markov Models, Hdden and Otherwse, Volochy, B.Yu., Ozrkovsk, L.D., Kulyk, I.V.: Formalzaton of Dscrete-Contnuous Stochastc Systems Model Buldng usng Erlang Phases Method. Vdbr Obrobka Informats 36, (2012) (n Ukranan) 17. Burnham, P.: Model Selecton and Multmodel Inference: a Practcal Informaton- Theoretc Approach. Sprnger, Hedelberg (2002) 18. Lu, T.: Applcaton of Markov Chans to Analyze and Predct the Tme Seres. Modern Appled Scence 4(5), (2010) 19. Akake, Н.: A New Look at the Statstcal Model Identfcaton. IEEE Trans. Auto. Control 19(6), (1974) 20. Tong, H.: Determnaton of the Order of a Markov Chan by Akake's Informaton Crteron. J. Appl. Probablty 12, (1975) 21. Schwarz, G.: Estmatng the Dmenson of a Model. Annals of Statstcs 6(2), (1978) 22. Dependablty of Techncs. Terms and Defntons, State Standard of Ukrane DSTU (1996)
Software Reliability Assessment Using High-Order Markov Chains
Internatonal Journal of Engneerng Scence Inventon ISSN (Onlne): 2319 6734, ISSN (Prnt): 2319 6726 www.jes.org Volume 3 Issue 7ǁ July 2014 ǁ PP.01-06 Software Relablty Assessment Usng Hgh-Order Markov Chans
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationPetri Net Based Software Dependability Engineering
Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationRegression Based Software Reliability Estimation: Duane Model
Regresson Based Software Relablty Estmaton: Duane Model 1 DR. R. SATYA PRASAD, MR. N. V.K. STANLEY RAJU 1 ASSOCIATE PROFESSOR, DEPT. OF CS&E, NAGARJUNA NAGAR, ANU, ANDHRA PRADESH, INDIA Research Scholar,
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
More informationFusion Performance Model for Distributed Tracking and Classification
Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationdevelopment speeds up. The shorter development time results in reduced costs. The extensibility and resolvability
Analyss of Software Relablty Growth Models for Quanttatve Evaluaton of Software Relablty and Goodness of Ftness Metrcs Harmnder Pal Sngh Dham 1, Vabhav Bansal 2 1, 2 Department Computer Scence & Engneerng,
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationAvailable online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc
More informationComplex System Reliability Evaluation using Support Vector Machine for Incomplete Data-set
Internatonal Journal of Performablty Engneerng, Vol. 7, No. 1, January 2010, pp.32-42. RAMS Consultants Prnted n Inda Complex System Relablty Evaluaton usng Support Vector Machne for Incomplete Data-set
More informationReliability and Performance Models for Grid Computing
Relablty and Performance Models for Grd Computng Yuan-Shun Da,2, Jack Dongarra,3,4 Department of Electrcal Engneerng and Computer Scence, Unversty of Tennessee, Knoxvlle 2 Department of Industral and Informaton
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationSoftware Reliability Estimation Based on Cubic Splines
Software Relablty Estmaton Based on Cubc Splnes P.L.M. Kelan Bandara, G.N. Wramanayae and J.S.Goonethllae Abstract Software relablty s one of the most mportant software qualty attrbute and Software relablty
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationEstimating Costs of Path Expression Evaluation in Distributed Object Databases
Estmatng Costs of Path Expresson Evaluaton n Dstrbuted Obect Databases Gabrela Ruberg, Fernanda Baão, and Marta Mattoso Department of Computer Scence COPPE/UFRJ P.O.Box 685, Ro de Janero, RJ, 2945-970
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationA Semi-parametric Regression Model to Estimate Variability of NO 2
Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationDYNAMIC NETWORK OF CONCEPTS FROM WEB-PUBLICATIONS
DYNAMIC NETWORK OF CONCEPTS FROM WEB-PUBLICATIONS Lande D.V. (dwl@vst.net), IC «ELVISTI», NTUU «KPI» Snarsk A.A. (asnarsk@gmal.com), NTUU «KPI» The network, the nodes of whch are concepts (people's names,
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationFinite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c
Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More informationConditional Speculative Decimal Addition*
Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationSoftware Reliability Growth Models: Overview and Applications 1
Software Relablty Growth Models: Overvew and Applcatons 1 Razeef Mohd., 2 Mohsn Nazr 1, 2 Department of Informaton Technology, Central Unversty of Kashmr, Inda 1 m.razeef@gmal.com, 2 mohsn.kawoosa@yahoo.com
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationVanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,
Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationAvailable online at ScienceDirect. Procedia Computer Science 103 (2017 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Computer Scence 03 (207 ) 562 568 XIIth Internatonal Symposum «Intellgent Systems», INTELS 6, 5-7 October 206, Moscow, Russa Retral queueng systems
More informationThree supervised learning methods on pen digits character recognition dataset
Three supervsed learnng methods on pen dgts character recognton dataset Chrs Flezach Department of Computer Scence and Engneerng Unversty of Calforna, San Dego San Dego, CA 92093 cflezac@cs.ucsd.edu Satoru
More information