Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test
|
|
- Angelica Hutchinson
- 6 years ago
- Views:
Transcription
1 Introdutory Programming, IMM, DTU Systemati Software Test Peter Sestoft a Programs often ontain unintended errors how do you find them? Strutural test Funtional test Notes: Systemati Software Test, sestoft/programmering/struktur.pdf Software test (afprøvning) Systemati ativity. Goal: to reveal errors in the program Input data set: arefully designed speially for this purpose. Systemati software test is quality assessment. a. Translated into English by Morten P. Lindegaard. Minor hanges and some additions made by nne Haxthausen. Sestoft, 18. november Introdutory Programming Page test-1 Sestoft, 18. november Introdutory Programming Page test-3 Motivation Non-trivial programs almost always ontain unintended (but avoidable) errors. Strutural test and funtional test Errors in programs may have severe onsequenes: Strutural test Funtional test In the Gulf war (1991), some Patriot missiles failed to hit inoming Iraqi Sud missiles (whih subsequently killed people on the ground). Errors in the software ontrolling the baggage handling system of Denver International irport delayed its opening by a year (1995), ausing losses of around 360 million dollars. The first launh of the European riane 5 roket failed (1996), ausing losses of hundreds of million dollars. (Programming error and insuffiient test). Errors in poorly designed ontrol software in the Thera-25 radio-therapy equipment (1987) exposed several aner patients to heavy doses of radiation, killing some. Our programs are simpler and ause smaller aidents. But the programs should still not ontain errors. You may prove that the programs are orret (by loop invariants et.). This is done for e.g. Metro ontrol-programs (Frane), misellaneous equipment in spaeraft (NS),... But it is often too expensive, too labourious, or too time-onsuming. Furthermore, it only prevents ertain kinds of errors. Badly designed user-interfaes are e.g. not prevented. Starting point the soure ode the problem Found logial errors unobserved ases kinds of errors wrong initialization of variables unobserved requirements Strutural test is also known as internal test or white-box test. Funtional test is also known as funtional test or blak-box test. In both ases, the first task is to design a test suite (afprøvning) ontaining: a table of input data properties a table of input data set and the orresponding, expeted output data To test the program, it is run with the input data sets, after whih the atual output data is ompared with the expeted output data. Sestoft, 18. november Introdutory Programming Page test-2 Sestoft, 18. november Introdutory Programming Page test-4
2 Strutural test: Conditional- and repetition statements Weak purpose: all parts of the program have been exeuted. Espeially, all branhes of onditional statements (if, swith, try-ath,... ) must have been exeuted. Strong purpose: every repetition statement has been exeuted zero times, exeuted exatly one time, and exeuted more than one time. This heks that variables have reasonable values before the first exeution of the body of the loop, as well as the following exeutions. Statement Cases to test if Condition and for Zero, one, and more than one exeutions while Zero, one, and more than one exeutions do-while One and more than one exeutions swith Every branh must be exeuted Strutural test, example 1: find the smallest and the greatest number (Minmax.java) publi lass Minmax { publi stati void main ( String[] args ) { int mi, ma; //urrent minimum and maximum System.out.println(""); mi = ma = Integer.parseInt(args[0]); for (int i = 1; i < args.length; i = i+1) { /* 2 */ int obs = Integer.parseInt(args[i]); if (obs > ma) ma = obs; /* 3 */ else if (mi < obs) mi = obs; /* 4 */ System.out.println("Minimum = " + mi + "; maximum = " + ma); Sestoft, 18. november Introdutory Programming Page test-5 Sestoft, 18. november Introdutory Programming Page test-7 Strutural test: Composite logial expressions Test all possible ombinations of truth values for terms. Conjuntion (logial and, &&): (x!= 0) && (1000/x > y) yields (x!= 0) && (1000/x > y) Disjuntion (logial or, ): (x == 0) (1000/x > y) yields (x == 0) (1000/x > y) Table of test ases Choie Input data set Input property 1 1 B t least one number 2 zero times B Exatly one number 2 one C Exatly two numbers 2 more than one E t least three numbers 3 C Current number urrent maximum 3 D Current number 4 E Current number urrent maximum urrent maximum and 4 E Current number maximum and urrent In the program: urrent maximum == ma, urrent minimum == mi, urrent number == obs urrent minimum urrent minimum Sestoft, 18. november Introdutory Programming Page test-6 Sestoft, 18. november Introdutory Programming Page test-8
3 Error! Table of input data sets and expeted output data Input data set Contents Expeted output B 17 Minimum = 17; maximum = 17 C Minimum = 27; maximum = 29 D Minimum = 37; maximum = 39 E Minimum = 47; maximum = 49 Input data sets D and E yield wrong output: Minimum = 39; maximum = 39 Minimum = 49; maximum = 49 Reason: erroneous ondition at 4. Correted test ases Choie Input data set Input property 1 1 B t least one number 2 zero times B Exatly one number 2 one C Exatly two numbers 2 more than one E t least three numbers 3 C Current number urrent maximum 3 D Current number 4a E Current number urrent maximum urrent maximum and 4a E Current number maximum and urrent The old input data sets may be used again. urrent minimum urrent minimum Sestoft, 18. november Introdutory Programming Page test-9 Sestoft, 18. november Introdutory Programming Page test-11 Strutural test, example 2: find the two smallest numbers (possibly equal) (Mintwo.java) Correted program publi lass Minmax { publi stati void main ( String[] args ) { int mi, ma; //urrent minimum and maximum System.out.println(""); mi = ma = Integer.parseInt(args[0]); for (int i = 1; i < args.length; i = i+1) { /* 2 */ int obs = Integer.parseInt(args[i]); if (obs > ma) ma = obs; /* 3 */ else if (obs < mi) mi = obs; /* 4 */ System.out.println("Minimum = " + mi + "; maximum = " + ma); publi stati void main (String[] args) { int mi1 = 0, mi2 = 0; System.out.println(""); mi1 = Integer.parseInt(args[0]); if (args.length == 1) /* 2 */ System.out.println("Smallest = " + mi1); int obs = Integer.parseInt(args[1]); if (obs < mi1) /* 3 */ { mi2 = mi1; mi1 = obs; for (int i = 2; i < args.length; i = i+1) { /* 4 */ obs = Integer.parseInt(args[i]); if (obs < mi1) /* 5 */ { mi2 = mi1; mi1 = obs; else if (obs < mi2) /* 6 */ mi2 = obs; System.out.println("The two smallest are " + mi1 + " and " + mi2); Sestoft, 18. november Introdutory Programming Page test-10 Sestoft, 18. november Introdutory Programming Page test-12
4 Table of test ases Choie Input data set Input property 1 1 B t least one number 2 B Exatly one number 2 C t least two numbers 3 C Seond number first number 3 D Seond number first number 4 zero times D Exatly two numbers 4 one E Exatly three numbers 4 more than one H t least four numbers 5 E Third number urrent minimum 5 F Third number 6 F Third number urrent minimum urrent minimum and 6 G Third number minimum and urrent seond least seond least Correted program publi stati void main (String[] args) { int mi1 = 0, mi2 = 0; System.out.println(""); mi1 = Integer.parseInt(args[0]); if (args.length == 1) /* 2 */ System.out.println("Smallest = " + mi1); int obs = Integer.parseInt(args[1]); mi2 = obs; if (obs < mi1) /* 3 */ { mi2 = mi1; mi1 = obs; for (int i = 2; i < args.length; i = i+1) { /* 4 */ obs = Integer.parseInt(args[i]); if (obs < mi1) /* 5 */ { mi2 = mi1; mi1 = obs; else if (obs < mi2) /* 6 */ mi2 = obs; System.out.println("The two smallest are " + mi1 + " and " + mi2); Sestoft, 18. november Introdutory Programming Page test-13 Sestoft, 18. november Introdutory Programming Page test-15 Table of input data sets Input data set Contents Expeted output B 17 Smallest = 17 C The two smallest are 27 and 29 D The two smallest are 37 and 39 E The two smallest are 47 and 48 F The two smallest are 57 and 58 G The two smallest are 67 and 68 H The two smallest are 76 and 77 Error! Input data set C produes wrong results: The two smallest are 27 and 0 The variable mi2 is not assigned a value before it is printed (in ase C). Funtional test: Does the program solve the problem? Goal: to see whether the program solves the given problem. Method: try to show that the program does not solve the problem. Prerequisites for funtional test 1. fairly preise desription of the problem. 2. Ideas of diffiult ases and wrong ways to solve the problem. 3. The expeted output data an by alulated or approximated without using the program. Designing a funtional test may reveal ambiguities in the desription of the problem. Designing a funtional test may be a good way to begin developing the program. It retains its initial value, 0. n appropriate assignment of mi2 is neessary. Sestoft, 18. november Introdutory Programming Page test-14 Sestoft, 18. november Introdutory Programming Page test-16
5 Table of input data sets and expeted output data Input data set Contents Expeted output Funtional test, example 1: find the smallest and the greatest number Given a (possibly empty) sequene of numbers, find the greatest and the smallest of these numbers. mbiguity: What should we do with an empty list of numbers? Clarifiation: We assume that an error message should be given. (What other sensible possibility is there?) B 17 Minimum = 17; maximum = 17 C Minimum = 27; maximum = 27 C Minimum = 35; maximum = 36 C Minimum = 45; maximum = 46 D Minimum = 53; maximum = 57 D Minimum = 63; maximum = 67 D Minimum = 73; maximum = 77 D Minimum = 83; maximum = 89 Sestoft, 18. november Introdutory Programming Page test-17 Sestoft, 18. november Introdutory Programming Page test-19 Table of input data properties Input data set B C1 C2 C3 D1 D2 D3 D4 Input property One number Two numbers, equal Two numbers, inreasing Two numbers, dereasing Three numbers, inreasing Three numbers, dereasing Three numbers, greatest in the middle Three numbers, smallest in the middle Funtional test, example 2: Find the greatest differene Given a (possibly empty) sequene of numbers, find the greatest differene between two onseutive numbers. mbiguity: What should we do with a sequene ontaining zero or one number? Clarifiation: We assume that error messages should be given and Only one number, respetively mbiguity: Greatest signed differene or unsigned differene? Clarifiation: We assume that is should be the numeri differene (i.e. unsigned differene). Sestoft, 18. november Introdutory Programming Page test-18 Sestoft, 18. november Introdutory Programming Page test-20
6 Table of input data properties Strutural versus funtional test Strutural and funtional test often use the same input data set. Table of input data sets and expeted output data dvantages of strutural test Input data set Input property Input data set Contents Expeted output Mehani, demands a systemati approah but not a deep understanding of the problem. Finds logial errors in the program. B One number B 17 Only one number Gives the person doing the testing (or the programmer) an opportunity to study the program in detail. C1 Two numbers, equal C May lead to modifying the program and as a result a better program. C2 Two numbers, inreasing C Covers all the details of the solution to the problem. C3 Two numbers, dereasing C D1 Three numbers, inreasing differene D dvantages of funtional test D2 Three numbers, dereasing differene D Independent of the program. Need not be hanged when the program is hanged (but when the problem is hanged). Gives the person doing the testing an opportunity to study the (desription of the) problem in detail. May lead to modifying the desription of the problem, making it more preise. Sestoft, 18. november Introdutory Programming Page test-21 Sestoft, 18. november Introdutory Programming Page test-23 Given a day of the month Funtional test, example 3: Legal dates and a month non-leap year. The day and the month are given as integers. Examples: 31/12 and 31/8 are legal dates, whereas 29/2 and 1/13 are not., deide whether they determine a legal data in a Input data set Contents Expeted output 0 1 Illegal 1 0 Illegal 1 1 Legal 31 1 Legal 32 1 Illegal 28 2 Legal 29 2 Illegal 31 3 Legal 32 3 Illegal 30 4 Legal 31 4 Illegal 31 5 Legal 32 5 Illegal 30 6 Legal 31 6 Illegal 31 7 Legal 32 7 Illegal 31 8 Legal 32 8 Illegal 30 9 Legal 31 9 Illegal Legal Illegal Legal Illegal Legal Illegal 1 13 Illegal Pratial hints about rerunning tests Rerun a test after eah modifiation or improvement of the program. Save the input data sets so they easily an be rerun, e.g. in a file testminmax.bat under Windows, e.g.: java Minmax >> testminmax.res java Minmax 17 >> testminmax.res java Minmax >> testminmax.res java Minmax >> testminmax.res or in a shell sript testminmax under Linux/Unix, e.g.: #! /bin/sh java Minmax >> testminmax.res java Minmax 17 >> testminmax.res java Minmax >> testminmax.res java Minmax >> testminmax.res The file must be on your path, and for Linux/Unix you should give it exeution status with the ommand: hmod a+x testminmax Running suh a sript will ause output data to be saved in a textfile testminmax.res. Before running the test, write expeted results in a file testminmax.exp. The results an be ompared automatially with expeted results in testminmax.exp (using diff under Unix/Linux or f under MS DOS). Sestoft, 18. november Introdutory Programming Page test-22 Sestoft, 18. november Introdutory Programming Page test-24
7 Testing (non main) methods of a lass So far we have onsidered how to test a main method taking arguments on the ommand line. For a non main method, the priniples for making a test suite (presented in two tables) are the same as for main methods. However, to exeute the test, you must write a speial test lass that has a main method that invokes the method with eah input data set of the test suite. The main method an either provide you with the results of the invokations (so that you an ompare them with expeted output) or even better make the omparison for you. Testing graphial user interfaes Testing graphial user interfaes (with windows and a mouse) is umbersome: One must desribe arefully step by step what ations the test person must perform, and what the program s expeted reations are. Exeuting the test must be done manually; it annot be rerun automatially. Sestoft, 18. november Introdutory Programming Page test-25 Sestoft, 18. november Introdutory Programming Page test-27 Sample struture of a test lass lass X { stati ResType m(rgtype x) {... //method to be tested publi lass XTest { // test lass publi stati void main (String[] args) { //test the data sets of the test suite test(input1, expetedoutput1);... test(inputn, expetedoutputn); private stati void test(rgtype a, ResType expeted) { ResType res = X.m(a); Test in perspetive Testing an improve our onfidene in a program, but it an never prove that a program has no errors. The saying of the statistiian is relevant: bsene of evidene isn t evidene of absene! The tester thinks that the test is suessful if it does find errors. The programmer thinks that the test is suessful if it does not find errors. When tester and programmer is the same person, there is a psyhologial onflit. It takes time to design a test. This motivates for avoiding superfluous hoie- and repetition statements (simplifies the strutural test); avoiding superfluous speial ases in the desription of the problem (simplifies the funtional test). Programs must be tested if ( res differs from expeted ) System.out.println("m(" + a + ") returns " + res + " -- differs from expeted " + expeted); if errors an damage humans or animals; if errors an lead to onsiderable eonomi losses; if they are used to draw sientifi onlusions. It is out of sope of this ourse to desribe all aspets of testing. Sestoft, 18. november Introdutory Programming Page test-26 Sestoft, 18. november Introdutory Programming Page test-28
Chapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationDynamic Algorithms Multiple Choice Test
3226 Dynami Algorithms Multiple Choie Test Sample test: only 8 questions 32 minutes (Real test has 30 questions 120 minutes) Årskort Name Eah of the following 8 questions has 4 possible answers of whih
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationFinding the Equation of a Straight Line
Finding the Equation of a Straight Line You should have, before now, ome aross the equation of a straight line, perhaps at shool. Engineers use this equation to help determine how one quantity is related
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationMultiple Assignments
Two Outputs Conneted Together Multiple Assignments Two Outputs Conneted Together if (En1) Q
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationAn Event Display for ATLAS H8 Pixel Test Beam Data
An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall
Department of Eletrial and Computer Engineering University of Wisonsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2014-2015 Assignment #2 Date Tuesday, September 25, 2014 Due
More informationUCSB Math TI-85 Tutorials: Basics
3 UCSB Math TI-85 Tutorials: Basis If your alulator sreen doesn t show anything, try adjusting the ontrast aording to the instrutions on page 3, or page I-3, of the alulator manual You should read the
More informationDepartment of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Test I Solutions
Department of Eletrial Engineering and Computer iene MAACHUETT INTITUTE OF TECHNOLOGY 6.035 Fall 2016 Test I olutions 1 I Regular Expressions and Finite-tate Automata For Questions 1, 2, and 3, let the
More informationtrue false Imperative Programming III, sections , 3.0, 3.9 Introductory Programming Control flow of programs While loops: generally Loops
Introductory Programming Imperative Programming III, sections 3.6-3.8, 3.0, 3.9 Anne Haxthausen a IMM, DTU 1. Loops (while, do, for) (sections 3.6 3.8) 2. Overview of Java s (learnt so far) 3. Program
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More information13.1 Numerical Evaluation of Integrals Over One Dimension
13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied
More informationRecursion examples: Problem 2. (More) Recursion and Lists. Tail recursion. Recursion examples: Problem 2. Recursion examples: Problem 3
Reursion eamples: Problem 2 (More) Reursion and s Reursive funtion to reverse a string publi String revstring(string str) { if(str.equals( )) return str; return revstring(str.substring(1, str.length()))
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationrepresent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to
Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat
More informationOne Against One or One Against All : Which One is Better for Handwriting Recognition with SVMs?
One Against One or One Against All : Whih One is Better for Handwriting Reognition with SVMs? Jonathan Milgram, Mohamed Cheriet, Robert Sabourin To ite this version: Jonathan Milgram, Mohamed Cheriet,
More informationOrientation of the coordinate system
Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a
More informationWORKSHOP 20 CREATING PCL FUNCTIONS
WORKSHOP 20 CREATING PCL FUNCTIONS WS20-1 WS20-2 Problem Desription This exerise involves reating two PCL funtions that an be used to easily hange the view of a model. The PCL funtions are reated by reording
More informationPerformance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification
erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationRun Time Environment. Implementing Object-Oriented Languages
Run Time Environment Implementing Objet-Oriented Languages Copright 2017, Pedro C. Diniz, all rights reserved. Students enrolled in the Compilers lass at the Universit of Southern California have epliit
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationCapturing Large Intra-class Variations of Biometric Data by Template Co-updating
Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert Loria Université Nany 2 Campus Sientifique, BP 239 F-54506 Vandoeuvre lès Nany edex Dirk.Seifert@Loria.fr inria-00268864, version 2-23 Apr 2008
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationAlleviating DFT cost using testability driven HLS
Alleviating DFT ost using testability driven HLS M.L.Flottes, R.Pires, B.Rouzeyre Laboratoire d Informatique, de Robotique et de Miroéletronique de Montpellier, U.M. CNRS 5506 6 rue Ada, 34392 Montpellier
More informationType of document: Usebility Checklist
Projet: JEGraph Type of doument: Usebility Cheklist Author: Max Bryan Version: 1.30 2011 Envidate GmbH Type of Doumet Developer guidelines User guidelines Dutybook Speifiation Programming and testing Test
More informationAdapting K-Medians to Generate Normalized Cluster Centers
Adapting -Medians to Generate Normalized Cluster Centers Benamin J. Anderson, Deborah S. Gross, David R. Musiant Anna M. Ritz, Thomas G. Smith, Leah E. Steinberg Carleton College andersbe@gmail.om, {dgross,
More informationInterconnection Styles
Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export
More informationOptimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints
5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of
More informationUsing Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks
Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La
More informationCOMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP
Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationDefine - starting approximation for the parameters (p) - observational data (o) - solution criterion (e.g. number of iterations)
Global Iterative Solution Distributed proessing of the attitude updating L. Lindegren (21 May 2001) SAG LL 37 Abstrat. The attitude updating algorithm given in GAIA LL 24 (v. 2) is modified to allow distributed
More informationA Visualization Technique for Unit Testing and Static Checking with Caller Callee Relationships
A Visualization Tehnique for Unit Testing and Stati Cheking with Caller Callee Relationships Yuko Muto, Kozo Okano, Shinji Kusumoto Graduate Shool of Information Siene and Tehnology Osaka University Suita,
More informationTriangles. Learning Objectives. Pre-Activity
Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards
More informationwith respect to the normal in each medium, respectively. The question is: How are θ
Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationDynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group
Dynami Programming Leture #8 of Algorithms, Data strutures and Complexity Joost-Pieter Katoen Formal Methods and Tools Group E-mail: katoen@s.utwente.nl Otober 29, 2002 JPK #8: Dynami Programming ADC (214020)
More informationFlow Demands Oriented Node Placement in Multi-Hop Wireless Networks
Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationVerifying Interaction Protocol Compliance of Service Orchestrations
Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, mayer}@pst.ifi.lmu.de Abstrat. An important aspet
More informationAllocating Rotating Registers by Scheduling
Alloating Rotating Registers by Sheduling Hongbo Rong Hyunhul Park Cheng Wang Youfeng Wu Programming Systems Lab Intel Labs {hongbo.rong,hyunhul.park,heng..wang,youfeng.wu}@intel.om ABSTRACT A rotating
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationMulti-Channel Wireless Networks: Capacity and Protocols
Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
More informationImproved flooding of broadcast messages using extended multipoint relaying
Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationDivide-and-conquer algorithms 1
* 1 Multipliation Divide-and-onquer algorithms 1 The mathematiian Gauss one notied that although the produt of two omplex numbers seems to! involve four real-number multipliations it an in fat be done
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationStable Road Lane Model Based on Clothoids
Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen
More informationOn the Generation of Multiplexer Circuits for Pass Transistor Logic
Preprint from Proeedings of DATE 2, Paris, rane, Marh 2 On the Generation of Multiplexer Ciruits for Pass Transistor Logi Christoph Sholl Bernd Beker Institute of Computer Siene Albert Ludwigs University
More informationBENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS
Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationThe Happy Ending Problem
The Happy Ending Problem Neeldhara Misra STATUTORY WARNING This doument is a draft version 1 Introdution The Happy Ending problem first manifested itself on a typial wintery evening in 1933 These evenings
More informationIntroductory Programming Arrays, sections
Introductory Programming Arrays, sections 7.1-7.4 + 7.6-7.7 Anne Haxthausen a, IMM, DTU 1. What is an array? (section 7.1-2) 2. Array types. (section 7.1-2) 3. How to declare and create an array? (section
More informationReverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis
Reverse Engineering of Assembler Programs: A Model-Based Approah and its Logial Basis Tom Lake and Tim Blanhard, InterGlossa Ltd., Reading, UK Tel: +44 174 561919 email: {Tom.Lake,Tim.Blanhard}@glossa.o.uk
More information8 Instruction Selection
8 Instrution Seletion The IR ode instrutions were designed to do exatly one operation: load/store, add, subtrat, jump, et. The mahine instrutions of a real CPU often perform several of these primitive
More informationCryptol Crib Sheet 1
Cryptol Crib Sheet 1 1 To Use Cryptol: 1. From the linux ommand line: prompt> to get this: Cryptol version 1.8.4, Copyright (C) 2004-2008 Galois, In. www..net Type :? for help Cryptol> 2. To load a soure
More informationMatLab Basics: Data type, Matrices, Graphics
MatLa Basis: Data type, Matries, Graphis 1 Plotting Data 0.8 0.6 0.4 os(t/10) 0.2 0-0.2-0.4-0.6 X: 78 Y: 0.05396-0.8-1 0 10 20 30 40 50 60 70 80 90 100 t Figure y MIT OCW. MatLa logial har NUMERIC ell
More informationBring Your Own Coding Style
Bring Your Own Coding Style Naoto Ogura, Shinsuke Matsumoto, Hideaki Hata and Shinji Kusumoto Graduate Shool of Information Siene and Tehnology, Osaka University, Japan {n-ogura, shinsuke, kusumoto@ist.osaka-u.a.jp
More informationWe don t need no generation - a practical approach to sliding window RLNC
We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,
More informationDirect-Mapped Caches
A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.
More informationConstructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center
Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the
More informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More informationMPhys Final Year Project Dissertation by Andrew Jackson
Development of software for the omputation of the properties of eletrostati eletro-optial devies via both the diret ray traing and paraxial approximation tehniques. MPhys Final Year Projet Dissertation
More informationRS485 Transceiver Component
RS485 Transeiver Component Publiation Date: 2013/3/25 XMOS 2013, All Rights Reserved. RS485 Transeiver Component 2/12 Table of Contents 1 Overview 3 2 Resoure Requirements 4 3 Hardware Platforms 5 3.1
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationInterior-Point Algorithms for Linear-Programming Decoding 0
Interior-Point Algorithms for Linear-Programming Deoding 0 Pasal O. Vontobel Hewlett Pakard Laboratories Palo Alto, CA 94304, USA Email: pasal.vontobel@ieee.org arxiv:080.1369v1 [s.it] 11 Feb 008 Abstrat
More informationTorpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control
orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial
More informationA Unified Subdivision Scheme for Polygonal Modeling
EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.
More informationC 2 C 3 C 1 M S. f e. e f (3,0) (0,1) (2,0) (-1,1) (1,0) (-1,0) (1,-1) (0,-1) (-2,0) (-3,0) (0,-2)
SPECIAL ISSUE OF IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION: MULTI-ROBOT SSTEMS, 00 Distributed reonfiguration of hexagonal metamorphi robots Jennifer E. Walter, Jennifer L. Welh, and Nany M. Amato Abstrat
More informationDetection of RF interference to GPS using day-to-day C/No differences
1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster
More informationCONTROL SYSTEMS ANALYSIS & DESIGN SERVER. F. Morilla*, A. Fernández +, S. Dormido Canto*
CONTROL SYSTEMS ANALYSS & ESGN SERVER F. Morilla*, A. Fernández +, S. ormido Canto* * pto de nformátia y Automátia, UNE, Avda. Senda del Rey 9, 28040 Madrid, Spain. Phone:34-91-3987156, Fax:34-91-3986697,
More informationBackground/Review on Numbers and Computers (lecture)
Bakground/Review on Numbers and Computers (leture) ICS312 Mahine-Level and Systems Programming Henri Casanova (henri@hawaii.edu) Numbers and Computers Throughout this ourse we will use binary and hexadeimal
More informationTitle: Time-Based Tree Graphs for Stabilized Force Structure Representations
Paper for the 8 th International Command & Control Researh & Tehnology Symposium Title: Time-Based Tree Graphs for Stabilized Fore Struture Representations Submitted by: Sam Chamberlain U.S. Army Researh
More informationSeries/1 GA File No i=:: IBM Series/ Battery Backup Unit Description :::5 ~ ~ >-- ffi B~88 ~0 (] II IIIIII
Series/1 I. (.. GA34-0032-0 File No. 51-10 a i=:: 5 Q 1 IBM Series/1 4999 Battery Bakup Unit Desription B88 0 (] o. :::5 >-- ffi "- I II1111111111IIIIII1111111 ---- - - - - ----- --_.- Series/1 «h: ",
More informationBayesian Belief Networks for Data Mining. Harald Steck and Volker Tresp. Siemens AG, Corporate Technology. Information and Communications
Bayesian Belief Networks for Data Mining Harald Stek and Volker Tresp Siemens AG, Corporate Tehnology Information and Communiations 81730 Munih, Germany fharald.stek, Volker.Trespg@mhp.siemens.de Abstrat
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationRobust Dynamic Provable Data Possession
Robust Dynami Provable Data Possession Bo Chen Reza Curtmola Department of Computer Siene New Jersey Institute of Tehnology Newark, USA Email: b47@njit.edu, rix@njit.edu Abstrat Remote Data Cheking (RDC)
More informationCUTTING FORCES AND CONSECUTIVE DEFORMATIONS AT MILLING PARTS WITH THIN WALLS
Proeedings of the International Conferene on Manufaturing Systems ICMaS Vol. 4, 2009, ISSN 1842-3183 University POLITEHNICA of Buharest, Mahine and Manufaturing Systems Department Buharest, Romania CUTTING
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationBoosted Random Forest
Boosted Random Forest Yohei Mishina, Masamitsu suhiya and Hironobu Fujiyoshi Department of Computer Siene, Chubu University, 1200 Matsumoto-ho, Kasugai, Aihi, Japan {mishi, mtdoll}@vision.s.hubu.a.jp,
More informationMethods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems
Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,
More informationDECT Module Installation Manual
DECT Module Installation Manual Rev. 2.0 This manual desribes the DECT module registration method to the HUB and fan airflow settings. In order for the HUB to ommuniate with a ompatible fan, the DECT module
More informationMining Edge-Weighted Call Graphs to Localise Software Bugs
Mining Edge-Weighted Call Graphs to Loalise Software Bugs Frank Eihinger, Klemens Böhm, and Matthias Huer Institute for Program Strutures and Data Organisation (IPD), Universität Karlsruhe (TH), Germany
More informationUplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks
62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More informationDefect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing
Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,
More information