Programinės įrangos testavimas yra kritinė viso kūrimo proceso dalis. Kokybe privalo rūpintis ne vien testuotojai. Programuotojai turi naudoti įvairias kokybės užtikrinimo technikas, tokias kaip statinė kodo analizė (kodo peržiūra) ir vienetų testavimas. Kartais programuotojai praleidžia kodo testavimą arba atlieka tik paviršutinį testavimą, nes tai užimą jų laiką. Automatiniai testavimo įrankiai suteikia galimybes testavimo kaštų sumažinimui. Sukurta daug įvairių testavimo atvejų generavimo technikų naudojant specializuotus įrankius. Testavimo atvejų generavimo tikslas yra pasiekti kuo didesnį kodo padengimą ir rasti netikėtas klaidas. Daugumoje atvejų yra neįmanoma pasiekti visišką kodo padengimą, naudojant vien generuotus testavimo atvejus. Reikalingi testavimo atvejai, parašyti žmogaus. Logiška pakartotinai naudoti testus, kuriais buvo ištestuoti panašūs metodai anksčiau. Šiame darbe analizuojama testų pakartotino panaudojimo problema. Siūlomas sprendimas yra paremtas vienetų testų saugojimu ir pakartotinu panaudojimu lyginant testuojamą metodą ir jau ištestuotą, kuris turi išsaugotus vienetų testus. Siūlomas metodas turėtų būti naudojamas kartu su vienetų testų generavimo įrankiais. / Software testing is critical part in software development. Not only testers are responsible for software quality. Programmers should use quality assurance techniques as code static analysis (code review) and unit testing. Sometimes developers omit testing their code or perform just superficial testing because unit testing consumes development time. Automated unit testing tools provide the way for reducing of testing costs. There are various techniques for generating test cases by using specialized tools. The goal of generation of tests cases is to achieve higher code coverage and expose unexpected errors. In many cases it is impossible to achieve full code coverage by using only generated test cases. Then manual efforts are needed. It is reasonable to reuse unit tests for method similar to that already tested. This work helps to analyse unit test reusability problem. The approach presented is based on unit test storing and reusing by comparing current testing method and method that has saved tests. This method should be used in combination with particular unit test generation tool.

International Telemetering Conference Proceedings / November 04-07, 1991 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Recent advances in acoustic detection and array processing have led to a new, state of the art, Sonobuoy Missile Impact Location System (SMILS). This system was developed for the 4950th Test Wing by E-Systems and the Johns Hopkins University Applied Physics Laboratory to support ballistic missile testing in broad ocean areas. The hardware and software required to perform the SMILS mission were developed in two different areas: 1) The flight system, installed aboard the Advanced Range Instrumentation Aircraft (ARIA), which provides everything necessary to guide the aircraft to the target area of Deep Ocean Transponders (DOTs), deploy sonobuoys, recover signals from the sonobuoys, and to process the recovered signals. The sonobuoy positions and impact locations of reentry vehicles are determined aboard the aircraft in real-time by telemetering the acoustic signals sent from the sonobuoys via Radio Frequency (RF) link to the aircraft. These acoustic signals are also recorded on analog tape in the aircraft. 2) The Post Mission Analysis System (PMAS), located at the 4950th Test Wing, processes the analog tapes recorded by the aircraft to do more sophisticated Processing than that performed on the aircraft, providing higher resolution of impact times and positions. This paper addressees the theory of PMAS operation and the specific approach used to perform automated acoustic detection of both narrow and wide band acoustic signals. It also addressees the processing technique employed to determine sonobuoy navigation and impact scoring.

Cognitive Radios are emerging communication systems which efficiently utilize the unused licensed radio spectrum called spectral holes. They run Spectrum sensing algorithms to identify these spectral holes. These holes need to be identified at very low SNR (<=-20 dB) under multipath fading, unknown channel gains and noise power. Cooperative spectrum sensing which exploits spatial diversity has been found to be particularly effective in this rather daunting endeavor. However despite many recent studies, several open issues need to be addressed for such algorithms. In this thesis we provide some novel cooperative distributed algorithms and study their performance. We develop an energy efficient detector with low detection delay using decentralized sequential hypothesis testing. Our algorithm at the Cognitive Radios employ an asynchronous transmission scheme which takes into account the noise at the fusion center. We have developed a distributed algorithm, DualSPRT, in which Cognitive Radios (secondary users) sequentially collect the observations, make local decisions and send them to the fusion center. The fusion center sequentially processes these received local decisions corrupted by Gaussian noise to arrive at a final decision. Asymptotically, this algorithm is shown to achieve the performance of the optimal centralized test, which does not consider fusion center noise. We also theoretically analyze its probability of error and average detection delay. Even though DualSPRT performs asymptotically well, a modification at the fusion node provides more control over the design of the algorithm parameters which then performs better at the usual operating probabilities of error in Cognitive Radio systems. We also analyze the modified algorithm theoretically. DualSPRT requires full knowledge of channel gains. Thus we extend the algorithm to take care the imperfections in channel gain estimates. We also consider the case when the knowledge about the noise power and channel gain statistic is not available at the Cognitive Radios. This problem is framed as a universal sequential hypothesis testing problem. We use easily implementable universal lossless source codes to propose simple algorithms for such a setup. Asymptotic performance of the algorithm is presented. A cooperative algorithm is also designed for such a scenario. Finally, decentralized multihypothesis sequential tests, which are relevant when the interest is to detect not only the presence of primary users but also their identity among multiple primary users, are also considered. Using the insight gained from binary hypothesis case, two new algorithms are proposed.