I detta examensarbete har en generell metodik skapats för testning av styrsystem för pumpar. Testmetodiken beskrivs med modeller som på ett strukturerat sätt går igenom testningens förberedelse och utförande. Metodiken tillämpas sedan genom en stegvis mall för hur testningen går till praktiskt. En metod för att optimera antalet tester presenteras. Denna metod minskar antalet tester genom att använda de mest prioriterade signalerna som skickas mellan styrsystem och pump. Denna prioritering sker genom en viktning av hur viktig signalen är för systemet. Ett beräkningsschema har skapats i Excel som tar fram den prioriterade testordningen för testaren att följa. / In this thesis, a general test methodology is created for the testing of control system for pumps. The test methodology is described with models that in a structured way help planning the testing preparation and execution. The methodology is then applied through a stepwise template for how to do the testing in practice. A method for optimizing the numbers of tests is presented. This method will reduce the number of test using the signals with the highest priority that are sent between the controller and pump. A calculation scheme in Excel has been created that brings out the prioritized test procedure for the tester to follow.

This master thesis deals with the detection and recognition of faces in the image. The content of this thesis is a description of methods that are used for the face detection and recognition. Method described in detail is the principal component analysis (PCA). This method is subsequently used in the implementation of face recognition in video sequence. In conjunction with the implementation work describes the OpenCV library package, which was used for implementation, specifically the C ++ API. Finally described application tests were done on two different video sequences.

Regression testing of an evolving software system may involve significant challenges. While, there would be a requirement of maximising the probability of finding out if the latest changes to the system has broken some existing feature, it needs to be done as economically as possible. A particularly important class of software systems are API libraries. Such libraries would typically constitute a very important component of many software systems. High quality requirements make it imperative to continually optimise the internal implementation of such libraries without affecting the external interface. Therefore, it is preferred to guide the regression testing by some kind of formal specification of the library. The testing problem comprises of three parts: computation of test data, execution of test, and analysis of test results. Current research mostly focuses on the first part. The objective of test data computation is to maximise the probability of uncovering bugs, and to do it with as few test cases as possible. The problem of test data computation for regression testing is to select a subset of the original test suite running which would suffice to test for bugs probably inserted in the modifications done after the last round of testing. A variant of this problem is that of regression testing of API libraries. The regression testing of an API is usually done by making function calls in such a way that the sequence of function calls thus made suffices a test specification. The test specification in turn embodies some concept of completeness. In this thesis, we focus on the problem of test sequence computation for the regression testing of API libraries. At the heart of this method lies the creation of a state space model of the API library by reverse engineering it by executing the system, with guidance from an formal API specification. Once the state space graph is obtained, it is used to compute test sequences for satisfying some test specification. We analyse the theoretical complexity of the problem of test sequence computation and provide various heuristic algorithms for the same. State space explosion is a classical problem encountered whenever there is an attempt of creating a finite state model of a program. Our method also faces this limitation. We explore a simple and intuitive method of ameliorating this problem – by simply reducing the size of the state vector. We develop the theoretical insights into this method. Also, we present experimental results indicating the practical effectiveness of this method. Finally, we bring all this together into the design and implementation of a tool called Modest.

RealTest is a company located in V¨aster˚as, Sweden, that works with embedded systems and test systems. RealTest had a need for a new test system for one of their products, the MiniTester (MT) mk2 that is used to test Drive Control Units (DCUs) used on trains. The problems that had to be solved were, finding out the most common faults of the product, make the test system modifiable and scalable, have a software running on a Windows PC with a working GUI and test logic and design a hardware component measurement unit to generate and measure signals. The system described in this report is the software parts of the developed MiniTest tester that runs on a Windows PC as well as the hardware design. The programming of the measurement unit and the testing of that unit is not covered by this report. The hardware consist of custom PCBs and Arduino boards. The Windows PC programs implemented a GUI and test logic according to the goals with a few exceptions left for further work. These programs have been evaluated by emulating the hardware. The system is shown to be modifiable in practice by implementation and scalable in theory