2. Object Oriented Software testing Activities. Figure 1 the various testing activities in SDLC

Size: px
Start display at page:

Download "2. Object Oriented Software testing Activities. Figure 1 the various testing activities in SDLC"

Transcription

1 odelng of Object Orented oftware Testng ost Dnesh Kumar an, onuddn Ahmad 2 Faculty of omputng and nformaton Technology, ohar nversty 2Faculty of Busness, ohar nversty P.O. Box:, P.. 3, ohar, ultanate of Oman Tel: Ext: 25, oble: , e_mal: dnesh@soharun.edu.om, mahmad@soharun.edu.om Abstract An effort s made to develop a cost model n ths paper for the object orented software testng process. The software must be tested to an extent so that before releasng t. s assured that the falures rsks have been mnmzed. There s a trade-off between testng cost and release polces. There may be varous factors affectng the total software testng cost. n ths paper, an object orented software testng cost model s presented whch can be used to determne the optmal release polces for the software. Varous software cost factors are consdered n ths paper such as the cost of object orented testng and removng detected errors. The error whch ncurs lot of money and tme n the software development process must be ncluded as removal cost whch s a stochastc process. Key Words Object Orented ystems, Testng, ost, Error, and Bug.. ntroducton Once the software developng process (usually ncludng the followng four phases: analyss, desgn, codng, and testng s completed, the software company releases the software product to market and obtans some profts n return f the software functons successfully (l, A. et al Durng the developng process, the company has to pay for such expendtures as the labor fee, the cost of developng, and the cost of testng, and so on. Therefore there s always testng cost assocated whenever we want to make qualty software. ustomer satsfacton depends on the qualty of the software, hgher the qualty hgher the customer satsfacton but fnally the customer has to pay for all the expendtures occurred durng the software testng. Therefore t becomes the moral duty of software developng company to justfy the software testng cost n terms of software qualty acheved. Therefore t s mportant to have an estmaton of software testng cost n some mathematcal expresson. n the software development process, the manager must reasonably decde when to stop testng and release the software system to the user. Ths decson problem s called optmal software-release (Ohtera H. et al The pressure of delverng hgh qualty software products calls for a better understandng of the software development process and mproved software models (Koch H.. et al.983. The cost of software testng can be hgh, and n many cases t s exceedng 30% of the overall software development costs for the project (Hetzel et al Ths places ncreased pressure on testng team. The software products whch are developed usng object orented concepts needs a decson as when to stop testng based on some crtera. We develop a mathematcal expresson for all testng costs that may occur durng testng and removng errors n object orented development. n order to mprove the qualty of software products, testng serves as the man tool to remove faults n software products. There wll be exponental ncrease n the cost when qualty enforcement s carred out at the refnement stage n the software development process refnement (Pham H. et al Therefore, t s usually very mportant to determne when to stop testng based on the cost assessment. 2. Object Orented oftware testng Actvtes Fgure the varous testng actvtes n DL

2 n object orented software development lfe cycle the varous phases are shown n Fgure. The varous actvtes assocated wth these phases are also shown here. Actvtes are the thngs that are expected from the desgners and what they should be dong. An actvty takes nputs and produces outputs. These nputs and outputs are referred to as artfacts. The artfacts that act as an nput to a partcular actvty could be a use case, whle the output from that actvty could be a class dagram etc. 3. oftware testng cost oftware systems are prone to falures and the falure can occurs any tme or even t can be at any random tmes. Falures are caused by the faults n the systems. oftware testng s very crtcal part of the software because t helps n reducng the chances of falures. The cost of software development process has bg porton for the software testng. Accurately estmatng the costs of all phases of the software development process as well as software testng have become more mportant. nce resources are lmted, t s crtcal to determne how they should be allocated throughout the software lfe-cycle (Brand L.. et al Varous tools are also beng developed to estmate software testng costs. nce the man objectve of testng s to mprove the software qualty. Nether process mprovements n development nor n testng alone can guarantee qualty mprovement. Harter and laughter (Harter, D. E. et al state that t s an unresolved ssue how software qualty can be mproved. Qualty can be tested nto software products or t can be desgned or bult nto the products (laughter,. A., et al Accordng to Harter and laughter (Harter, D. E. et al. 2000, software qualty s rather desgned than tested nto products. Both desgn and testng have a sgnfcant nfluence on product qualty. The software cost estmaton should be done correctly. ome framework lke (Grmstad,. et al can be used for correctly estmatng the cost.here we wll try to model the object orented testng cost. ost estmaton (Dolado J.J., 200 can be erroneous and some strategy lke (Lederer A.L. et al. 988 can be used to estmate the cost estmaton errors. Varous researchers have also used experments to predct the project costs usng dfferent algorthmc technques (Banker, R. D. et al. 989, (Kemerer,. F. 987, (Kusters, R. et al. 990, (cabe; 976. These can also be used for estmatng the cost of testng the software. Fgure 2. The ost Dagram for Testng of Object Orented ystems. ost odel Object-orented testng needs to test all the aspects of software development process. An object orented software development conssts of varous phases n ts development cycle. Each phase of software development needs to be tested for correctness. Object orented softwares are developed usng L specfcatons. These L dagrams (Booch, G. et al. 998 can themselves be used to automatcally generate and select test cases (Kansomkeat,. et al (Offutt, J. et al.999. A use case s a set of scenaros that descrbes an nteracton between a user and a system. se case dagrams are related and ths relatonshp s vsble among actors and use cases. The two man components of a use case dagram are use cases and actors. There may be varous steps n whch use cases may be tested (Booth, G., 986. Frst of all the use cases are requred to be tested syntactcally to ensure that the use case descrptons descrbes the correct and proper nformaton. We must fnd answers of questons lke: s t complete? s t correct? s t consstent? After checkng for the syntax next step s doman testng. Here we need to fnd a doman expert. Agan, we need to ask the same questons: s t complete? s t correct? s t consstent? After that the next step s traceablty testng. Traceablty testng s to make sure all the requrements especally functonal requrement are there n the use cases and from the use cases to the requrements back. t should be complete, correct and consstent and ths should be tested. Let the number of use cases s N u and any th use case takes T tme n testng and the cost assocated wth testng one use-case testng be K u then total cost of use case testng s gven by: N u K u T use case = ( lass dagrams n object orented systems are descrpton of the types of objects n object orented systems and ther relatonshps wth each other. lass dagrams helps n modelng the class contents and class structures. lass

3 Dagrams uses desgn tools and elements of the class. lass dagrams express three dfferent aspects of the systems lke conceptual, specfcaton, and mplementaton. lasses consst of three man tems whch are: a name, attrbutes, and operatons. All the three are needed for testng the class concept and the cost of testng a class dagram wll depends on the followng tems.. The number of classes n a class dagram let t be N. 2. The number of relatonshps of each of the class wth other classes, let any class s havng relatonshps wth n other classes. 3. The number of attrbutes and the number of operatons that each class has, let a class has total number of attrbutes A and total number of operatons O. o the cost of testng a class dagram wll be: N lass Dagram =N K n (2 The other major component of object orented systems whch should be tested serously s nteracton dagrams, whch are responsble for modelng the behavor of use cases by descrbng the way groups of objects nteract to complete the task n the object orented systems. The two major knds of nteracton dagrams are sequence dagrams and collaboraton dagrams. nteracton dagrams are helpful n descrbng the behavor of objects n the use cases. nteracton dagrams provde nformaton for how the objects collaborate behaves n the object orented systems.. equence dagrams demonstrate the behavor of objects n a use case by descrbng the objects and the messages they pass. There may be a number of sequence dagrams. Let the number of sequence dagrams to test s N and the cost assocated wth testng one sequence dagram s K so the total cost of testng sequence dagrams s gven as: N equence Dagram = K n (3 ollaboraton dagrams descrbes the relatonshp between objects and the order of messages passed between objects. The objects are lsted as cons and arrows ndcate the messages beng passed between them. The numbers next to the messages are called sequence numbers. As the name suggests, they show the sequence of the messages as they are passed between the objects. Let the number of collaboraton dagrams s N l and the cost assocated wth one collaboraton dagram s K l then the total cost of testng collaboraton dagrams s: K l ollaboraton Dagram = K l n ( tate dagrams are used to descrbe the behavor of a system. tate dagrams descrbe all of the possble states of an object as events occur. Each dagram usually represents objects of a sngle class and tracks the dfferent states of ts objects through the system. The state dagram testng cost wll depend on the number of state dagrams N t and the number of states n each state dagram, let number of states n th state dagram s n. N t tate Dagram = K t n (5 Actvty dagrams descrbe the workflow behavor of a system. Actvty dagrams are smlar to state dagrams because actvtes are the state of dong somethng. The dagrams descrbe the state of actvtes by showng the sequence of actvtes performed. Actvty dagrams can show actvtes that are condtonal or parallel. The cost of testng actvty dagrams wll depend on number of actvty dagrams to be tested n program and the number of actvtes n each of the actvty dagrams. Let there be total N A actvty dagrams ate there and number of actvtes n th actvty dagram s n N A K A n Actvty Dagram = (6 oftware testng s done at varous levels, so the dfferent software test cost s assocated wth these varous levels. These are bascally unt testng, ntegraton testng and system testng. nt testng s concerned wth verfyng the behavor of the smallest solated components of the system. Typcally, ths knd of testng s performed by developers or mantaners and nvolves usng knowledge of the code tself. n practce, t s often dffcult to test components n solaton. omponents often tend to rely on others to perform ther functon. n object orented envronment the unt s a class. ntegraton testng s focused at the verfcaton of the nteractons between the components of the system. The components are typcally subjected to unt testng before ntegraton testng starts. A strategy that determnes the order n whch components should be combned usually follows from the archtecture of the system. ystem testng occurs at the level of the system as a whole. On the one hand, the system can be valdated aganst the non-functonal requrements, such as performance, securty, relablty or nteractons wth external systems. On the other hand, the functonalty mplemented by the system can be compared to ts specfcaton (Farren D, 996. Once the software developng process (usually ncludng the followng four phases: analyss, desgn, codng, and testng s completed, the software company releases the software product to market and obtans some profts n return f the software functons successfully. The product may not be good enough f all the metrcs nvolved n software test are not well tested (Kan,.H. et al. 200.

4 5. Testng cost model for object orented systems How the cost of object orented software vares? What are the factors on whch t depends on? Our proposed model tres to fnd out the answer of these questons. There are varous other models (Yang,.. et al. 995 (Goel A.L. et al.979] n lterature whch model the optmum release tme for the software. There may be software release polces determned by company management for ths. o ths estmaton of software test cost for object orented envronment s a crtcal ssue (Page T., et al, 989. Our model of software testng broadly dvdes the whole testng process as accordng to ts testng levels. We have taken nto consderaton the factors nto consderaton whch affect n each of these phases. Our model conssts of:. ost to perform testng E (. 2. ost ncurred n removng errors E 2 (. The odels assumptons are as follow: The cost to perform testng s proportonal to the testng tmes. Errors found durng testng consst of two parts - the determnstc part and the ncremental random part of the error. The testng of a class conssts of testng all of the class components and ts assocaton wth other classes. Notaton: : oftware unt testng cost per unt tme 2 : oftware ntegraton testng cost per unt tme 3 : oftware system testng cost per unt tme : determnstc cost to remove each error per unt tme durng unt testng phase 5 : determnstc cost to remove each error per unt tme durng ntegraton testng phase 6 : determnstc cost to remove each error per unt tme durng system testng phase T : Tme ncurred n unt testng T : Tme ncurred n ntegraton testng T : Tme ncurred n system testng w : random varable of cost to remove errors durng unt testng w : random varable of cost to remove errors durng ntegraton testng w : random varable of cost to remove errors durng system testng : Total number of classes w w testng m ( T : expectaton value of varable w n unt testng : expectaton value of varable w n ntegraton : average number of falures n all classes detected durng the unt testng tme T a. Testng ost: ncludes testng actvtes: preparng test cases, runnng them and analyzng results. E (= T + 2 T + 3 T (7 where T + T + T = T b. Error removal cost: Errors are removed as soon as they are dscovered. We wll fnd out the expressons of error removal cost at varous levels of testng. These levels are unt testng, ntegraton testng and system level testng. f we consder the testng at unt level, then here the unt s class. Let us consder that there are numbers of classes whch are tested for errors. Testng of a class means we have to test each of ts methods. Accordng to assumpton (2 above, the cost to remove errors durng the testng phase s a random varable and conssts of two parts - the determnstc part, say, and the ncremental random part, whch reflects the dffcultes of dfferent errors. (t, t>0 s countng process of errors detected durng testng phase and can be consdered a stochastc renewal process. The cost of removng j th error n a class: j = + W The cost of removng all errors from class any class s gven by: N ( T j w ( 8 Where (N (t >0 s the countng process of errors detected durng testng of class L. o N (T s the total number of errors dscovered n tme T. Expected total cost to remove all detected errors n a class durng perod [0,T, E 2 (T s gven by: 2 N ( T T E w E (9 j f there are total classes, then cost of removng all errors from classes: E ( T E N ( T j w N E w. N n n j n E w. N n j n

5 ost ncurred n ntegraton test ost ncurred n nt Testng. n w N n n N n n n n. N n w E( N w m w T m w [ m( T w ] where T T T T m( T and s average number of falures n all classes detected durng the unt testng tme T. The cost ncurred n error removal durng ntegraton testng: the cost of removng th error 5 w E ( T E E N ( T N ( T ( 5 w N ( T E ( 5 w. n n n E ( 5 w. n n n. n5 w n N u = N t K u T K t n so the total cost to remove errors N +N N A + K n K A m + N + K n K l + K l n [ m( T w ] 5m ( T w 6 m ( T c. mpact of Testng cost coeffcent n unt test the cost of removng all errors from a class depends on cost factor and the random factor W. From the expresson obtaned for total cost ncurred n unt test t s clear that total cost s lnear wth. To plot the graph between total unt test cost and We have taken =20, m ( 0 and 50 T ts clear that for more number of classes the cost would be ncreased wth that factor. t s evdent that the cost of testng s ncreasng wth the testng tme and number of faults appearng n the software w ost Factor (ORE: Wpro oftware Testng nt d. mpact of Testng cost coeffcent 5 + eres2 eres The cost ncurred n ntegraton testng depends on cost factor 5. From the expresson obtaned for total ntegraton testng cost t s observed that t s lnear wth w 5 n. n w n n n E( 5 m ( T 5 w mlar expresson s obtaned for system level testng: E ( T 6 w m ( T w ost factor 5 (ORE: Wpro oftware Testng nt eres

6 6. oncluson The testng cost n object orented software system has a great mpact on decdng the release tme for the software. The more we test the cost ncurred wll also ncrease more. But the overall completeness of software wll be sgnfcantly ncreased. Therefore there must be a trade-off between testng cost and tme. Our proposed model can be used for predctng the total cost ncurred n testng and removng errors and bugs from object orented systems. References:. Ohtera H., Yamada, 990, Optmum oftware-release Tme onsderng an Error- Detecton Phenomenon durng Operaton, EEE transactons on relablty. Vol. 39, no. 5. pp Koch H.., Kuba P., 983, "Optmal release lme of computer software".eee Trans. oftware Engneerng, vol E-9, pp Yang,.. and hao A., 995, "Relablty- Estmaton & toppng-rules for oftware Testng, Based on Repeated Appearances of Bugs," EEE Transacton on Relablty, 2, pp Goel A.L.and Okumoto K, 979, Tme- Dependent Error-Detecton Rate odel for oftware Relablty and Other Performance easures," EEE Ttans. Relablty, Vol. R- 28, No. 3, pp Page T., et al, 989, "An Object Orented odellng Envronment," Proceedngs of the Fourth Annual A onference on Object Orented Programmng ystems, Languages and Applcatons (OOPLA. 6. Farren D, 996, The Economcs of ystem Level Testng, PhD thess, Brune nv., xbrdge,.k. 7. Hetzel, Wllam., 988, The omplete Gude to oftware Testng, econd edton, John Wley & ons, NY A. 8. Pham H. and Zhang X., 999, oftware release polces wth gan n relablty justfyng the costs,.annals of oftware Engneerng 8, pp l, A., hmel,. F., 2000, Gottumukkala, R., and Zhang, L An ntegrated cost model for software reuse. n Proceedngs of the 22nd nternatonal onference on oftware Engneerng (Lmerck, reland, June 0 -, E '00. A Press, New York, NY, pp Booth, G., 986, Object Orented Development, EEE Transactons on oftware Engneerng, E-2, February, pp Kan,.H., Parrsh, J., and anlove, D., 200, n-process metrcs for software testng, B ystems Journal, Vol. 0, No., 200, p Harter, D. E. and laughter,. A Process maturty and software qualty: a feld study. n Proceedngs of the Twenty Frst nternatonal onference on nformaton ystems (Brsbane, Queensland, Australa. nternatonal onference on nformaton ystems. Assocaton for nformaton ystems, Atlanta, GA, pp Kansomkeat,. and Rvepboon, W Automated-generatng test case usng L statechart dagrams. A nternatonal onference Proceedng eres, vol. 7. outh Afrcan nsttute for omputer centsts and nformaton Technologsts, pp Booch, G., Rumbaugh, J., and Jacobson, The nfed odelng Language ser Gude. Object Technology eres. Addson Wessley Longman, nc. 5. Offutt, J., and Abdurazk, A Generatng test cases from L specfcatons. n Proceedng of the 2nd nternatonal onference on the nfed odelng Language (L99, Fort ollns, O, October, laughter,. A., Harter, D. E., and Krshnan,.. 998, Evaluatng the ost of oftware Qualty. ommuncatons of the A,, 8 (998, pp Grmstad,. and Jørgensen, A framework for the analyss of software cost estmaton accuracy. n Proceedngs of the 2006 A/EEE nternatonal ymposum on nternatonal ymposum on Emprcal oftware Engneerng (Ro de Janero, Brazl, eptember 2-22, EE '06. A Press, New York, NY, pp Brand L.. and Weczorek., 2002, "Resource estmaton n software engneerng," n Encyclopeda of software engneerng, J. J. arcnak, Ed., 2nd ed. New York: John Wley & ons, pp Lederer A.L. and Prasad, J. 988 "A causal model for software cost estmatng error," EEE Transactons on oftware Engneerng, vol. 2, no. 2, pp Dolado J.J., 200, "On the problem of the software cost functon," nformaton and oftware Technology, vol. 3, no., pp artn, R. 988 "Evaluaton of urrent oftware ostng Tools," oftware Eng. Notes, vol.3, no.3, pp Banker, R. D. and Kemerer,. F cale Economes n New oftware Development.

7 EEE Trans. oftw. Eng. 5, 0 (Oct. 989, pp Kemerer,. F An emprcal valdaton of software cost estmaton models. ommun. A 30, 5 (ay. 987, pp Kusters, R., van Genuchten,. J., and Heemstra, F. J Are software costestmaton models accurate. nf. oftw. Technol. 32, 3 (Apr. 990, pp cabe; 976, A omplexty easure, EEE Transactons on oftware Engneerng, 2, pp

Analysis of Continuous Beams in General

Analysis 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 information

Petri Net Based Software Dependability Engineering

Petri 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 information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE 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 information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

Smoothing Spline ANOVA for variable screening

Smoothing 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 information

S1 Note. Basis functions.

S1 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 information

Wishing you all a Total Quality New Year!

Wishing 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 information

Some 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 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 information

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL 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 information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course 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 information

Software Reliability Assessment Using High-Order Markov Chains

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 information

Mathematics 256 a course in differential equations for engineering students

Mathematics 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 information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

X- Chart Using ANOM Approach

X- 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 information

Cluster Analysis of Electrical Behavior

Cluster 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 information

y and the total sum of

y 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 information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: 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 information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

Review of approximation techniques

Review 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 information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

Software Up-gradations and Optimal Release Planning

Software Up-gradations and Optimal Release Planning Internatonal Journal of Computer Applcatons (0975 8887) Internatonal Conference on Relablty, Infocom Technologes and Optmzaton, 203 Software Up-gradatons and Optmal Release Plannng P K Kapur Amty Internatonal

More information

CONSTRUCTION OF RELIABLE SOFTWARE IN RESOURCE CONSTRAINED ENVIRONMENTS

CONSTRUCTION OF RELIABLE SOFTWARE IN RESOURCE CONSTRAINED ENVIRONMENTS CONSTRUCTION OF RELIABLE SOFTWARE IN RESOURCE CONSTRAINED ENVIRONMENTS Mladen A. Vouk, Department of Computer Scence, Box 8206 North Carolna State Unversty, Ralegh, NC 27695, USA Tel: 919-515-7886, Fax:

More information

Reducing Frame Rate for Object Tracking

Reducing 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 information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

Professional competences training path for an e-commerce major, based on the ISM method

Professional competences training path for an e-commerce major, based on the ISM method World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng

More information

Concerning Predictability in Dependable Componentbased Systems: Classification of Quality Attributes

Concerning Predictability in Dependable Componentbased Systems: Classification of Quality Attributes Concernng Predctablty n Dependable Componentbased Systems: Classfcaton of Qualty Attrbutes Ivca Crnovc 1, Magnus Larsson 2 1 Mälardalen Unversty, Department of Computer Scence and Engneerng Box 883, 721

More information

Using Simulation Modeling for IT Cost Analysis

Using Simulation Modeling for IT Cost Analysis Usng Smulaton Modelng for IT Cost Analyss Tmofe Popkov (tm@xjtek.com), Yur Karpov (karpov@xjtek.com), Maxm Garfulln (maxm@xjtek.com) http://www.xjtek.com/ http://www.xjlabs.com/ St.Petersburg State Techncal

More information

Module Management Tool in Software Development Organizations

Module 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 information

development speeds up. The shorter development time results in reduced costs. The extensibility and resolvability

development 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 information

Discrete and Continuous Time High-Order Markov Models for Software Reliability Assessment

Discrete and Continuous Time High-Order Markov Models for Software Reliability Assessment 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 vtaly.s.yakovyna@lpnu.ua,

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG 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 information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Software Reliability Estimation Based on Cubic Splines

Software 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 information

Support Vector Machines

Support 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 information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term 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 information

The Codesign Challenge

The 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 information

An Entropy-Based Approach to Integrated Information Needs Assessment

An 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 information

MODELING THE RELIABILITY OF INFORMATION MANAGEMENT SYSTEMS BASED ON MISSION SPECIFIC TOOLS SET SOFTWARE

MODELING THE RELIABILITY OF INFORMATION MANAGEMENT SYSTEMS BASED ON MISSION SPECIFIC TOOLS SET SOFTWARE Knowledge Dynamcs MODELING THE ELIABILITY OF INFOMATION MANAGEMENT SYSTEMS BASED ON MISSION SPECIFIC TOOLS SET SOFTWAE Cezar VASILESCU Assocate Professor, egonal Department of Defense esources Management

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. 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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

Using the Multiple-Clue approach for system testing on AIRBUS FAL (Final Assembly Line)

Using the Multiple-Clue approach for system testing on AIRBUS FAL (Final Assembly Line) Usng the Multple-Clue approach for system testng on AIRBUS FAL (Fnal Assembly Lne) Fassely Doumba, Odle Laurent, Dder Atger AIRBUS France 316 route de Bayonne 31060 Toulouse Cedex 09 {Frstname.Name}@arbus.com

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual 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 information

A Clustering Algorithm for Chinese Adjectives and Nouns 1

A Clustering Algorithm for Chinese Adjectives and Nouns 1 Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,

More information

USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES

USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES 1 Fetosa, R.Q., 2 Merelles, M.S.P., 3 Blos, P. A. 1,3 Dept. of Electrcal Engneerng ; Catholc Unversty of

More information

Functional Testing of Digital Systems

Functional Testing of Digital Systems Functonal Testng of Dgtal Systems Kwok- Woon La Bell Laboratores Murray Hll, New Jersey 07974 Danel P. Seworek Carnege-Mellon Unversty Pttsburgh, Pennsylvana 15213 ABSTRACT Functonal testng s testng amed

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A 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 information

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Regression Based Software Reliability Estimation: Duane Model

Regression 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 information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life 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 information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

Solving two-person zero-sum game by Matlab

Solving 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 information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual 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 information

Software Reliability Growth Models: Overview and Applications 1

Software 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 information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A 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 information

A GENERAL APPROACH FOR MAN-MACHINE SYSTEMS DESIGN

A GENERAL APPROACH FOR MAN-MACHINE SYSTEMS DESIGN Copyrght 2002 IFAC 5th Trennal World Congress, Barcelona, Span A GENERAL APPROACH FOR MAN-MACHINE SYSTEMS DESIGN A.Skaf,2, B.Davd 2, Z.Bnder, B. Descotes-Genon Laboratore d'automatque de Grenoble (LAG)

More information

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments Model Integrated Computng: A Framework for Creatng Doman Specfc Desgn Envronments James R. DAVIS Vanderblt Unversty, Insttute for Software Integrated Systems Nashvlle, TN 37203, USA ABSTRACT Model Integrated

More information

Learning to Project in Multi-Objective Binary Linear Programming

Learning to Project in Multi-Objective Binary Linear Programming Learnng to Project n Mult-Objectve Bnary Lnear Programmng Alvaro Serra-Altamranda Department of Industral and Management System Engneerng, Unversty of South Florda, Tampa, FL, 33620 USA, amserra@mal.usf.edu,

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

More information

Study on Fuzzy Models of Wind Turbine Power Curve

Study on Fuzzy Models of Wind Turbine Power Curve Proceedngs of the 006 IASME/WSEAS Internatonal Conference on Energy & Envronmental Systems, Chalkda, Greece, May 8-0, 006 (pp-7) Study on Fuzzy Models of Wnd Turbne Power Curve SHU-CHEN WANG PEI-HWA HUANG

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining 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 information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality 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 information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems

Determining Fuzzy Sets for Quantitative Attributes in Data Mining Problems Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku

More information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

MATHEMATICS FORM ONE SCHEME OF WORK 2004

MATHEMATICS FORM ONE SCHEME OF WORK 2004 MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation 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 information

AADL : about scheduling analysis

AADL : 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 information

Modelling a Queuing System for a Virtual Agricultural Call Center

Modelling a Queuing System for a Virtual Agricultural Call Center 25-28 July 2005, Vla Real, Portugal Modellng a Queung System for a Vrtual Agrcultural Call Center İnc Şentarlı, a, Arf Orçun Sakarya b a, Çankaya Unversty, Department of Management,06550, Balgat, Ankara,

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Towards a Tactic-Based Evaluation of Self-Adaptive Software Architecture Availability

Towards a Tactic-Based Evaluation of Self-Adaptive Software Architecture Availability Towards a Tactc-Based Evaluaton of Self-Adaptve Software Archtecture Avalablty Alreza Parvz-Mosaed 1, Shahrouz Moaven 2, Jafar Habb 3, Abbas Heydarnoor 4 Sharf Unversty Of Technology Tehran, Iran {aparvz

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

Estimating Costs of Path Expression Evaluation in Distributed Object Databases

Estimating 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 information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

Fusion Performance Model for Distributed Tracking and Classification

Fusion 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 information

Specifications in 2001

Specifications in 2001 Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secret-key

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

The Research of Support Vector Machine in Agricultural Data Classification

The 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 information

A HIERARCHICAL SIMULATION FRAMEWORK FOR APPLICATION DEVELOPMENT ON SYSTEM-ON-CHIP ARCHITECTURES. Vaibhav Mathur and Viktor K.

A HIERARCHICAL SIMULATION FRAMEWORK FOR APPLICATION DEVELOPMENT ON SYSTEM-ON-CHIP ARCHITECTURES. Vaibhav Mathur and Viktor K. A HIERARCHICAL SIMULATION FRAMEWORK FOR APPLICATION DEVELOPMENT ON SYSTEM-ON-CHIP ARCHITECTURES Vabhav Mathur and Vktor K. Prasanna Department of EE-Systems Unversty of Southern Calforna Los Angeles, CA

More information

Parameter estimation for incomplete bivariate longitudinal data in clinical trials

Parameter 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 information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Verification by testing

Verification by testing Real-Tme Systems Specfcaton Implementaton System models Executon-tme analyss Verfcaton Verfcaton by testng Dad? How do they know how much weght a brdge can handle? They drve bgger and bgger trucks over

More information