B Pages:9 Words:2252
This is just a sample.
To get a unique essay
Hire Writer
Type of paper: Essay
University/College: University of Chicago
Download: .pdf, .docx, .epub, .txt

A limited time offer!

Get custom essay sample written according to your requirements

Urgent 3h delivery guaranteed

Order Now

Testing Plan for Video Compression, Decompression and Execution

11.2 ) Video:

Software testing is the of import to accomplish the quality of the package been developed. It is used to look into application faculty or the package that fulfill the demand of the terminal user.

We will write a custom essay sample on Testing Plan for Video Compression, Decompression and Execution specifically for you
for only $13.90/page
Order Now

Testing is related to two other procedures like confirmation and proof.

Confirmation: gives verification specification.

Validation: gives verification necessities.

9.1.1 ) Trial Plan:

Trial program is doing the planning of the overall package. It will run into all the demand for existent clip processing. Quality confidence should be organize by look intoing each and every functionality. Besides trial program includes following

  • Test category to be tested

  • Operation property to be tested

  • Test event

  • Testing environment

  • Test out of scope

  • Trial agenda

9.2 ) Testing Technique:

A Technique has been used are as follows by black box testing and white box testing. It detects the mistake programmed ; keep truth, completeness and scalability of application developed is called testing.

9.2.1 ) BLACK BOX Testing:

A proving which concentrates merely on functional demands of application or package is called as a Black-box testing or behavioural testing. Black-box proving efforts to bring out

  • Inaccurate or omitted maps
  • Interface mistakes
  • Mistakes related to informations constructions or external informations base entree
  • Behavior or public presentation mistakes
  • Low-level formatting and expiration mistakes.

In this thesis:

Black box proving includes acquiring petition from client is proper or non as per client petition waiter acknowledge. Server indexing client requested informations in database. Indexed information is proper or non, directing of byte by byte informations to buffer is maintain the indexing sequence or non. This sort of proving performed in black box testing.

9.2.2 ) WHITE BOX Testing:

White box testing is nil but the complementary to black box proving. The internal execution of application can be tested by this testing.

  • Buffer storage compress informations that acquiring from database, It is relevant or non. If there are losing index than the informations content may be alteration. So, will prove informations compressed in buffer is right indexed or non.
  • Executor extract theoretical account, position and control stage, tested is there are any lost informations or non.
  • Controling informations stored in impermanent memory, after completion of send requested informations to client commanding informations is removed or non.
  • Sending clip informations compressed utilizing Huffman algorithm.
  • Retrieved informations is right or non.
  • Client retrieve informations after 2 clip decompress informations. After decompressed existent informations got by client or non.

9.3 ) Testing Scheme:

Testing is an effectual conductivity of antecedently planned activities. A scheme for package proving must supply adjustment for low-level trials that are necessary to verify that a little unit of application has been right implemented every bit good as high-ranking trials that validate major system maps against client demands. Testing schemes can be classified as follows.

9.3.1 ) Unit of measurement:

Unit of measurement proving considers package constituent or faculty as a smallest testable piece of package. It takes the constituent or faculty of testable package in the application, separate it from the balance of the codification. Then it verifies whether it works as you expect. This type of proving can be done on multiple faculties in analogue. It is white box oriented, as it is used to verify the control flow and informations flow.

9.3.2 ) Integration Testing:

It is a logical extension of faculty or constituent testing. It chiefly focuses on happening defects which chiefly arise because of uniting assorted constituents for proving. Integration proving purposes at constructing a plan construction by taking integrity tested faculties. It conducts trial to uncover mistakes associated with interfacing. Once we have finished with unit proving, following undertaking is to execute incorporate proving. Unit tested faculties are taken and assemble together and execute incorporate proving. In this proving one or more faculties are tested at a clip w.r.t their functionality.

9.3.3 ) SYSTEM Testing:

It verifies the full merchandise, after uniting all package and hardware constituents and validates it harmonizing to original undertaking demands. The chief purpose of system proving is to accomplish a successful execution of the computing machine based system utilizing sequence of trials. In the peculiar each trial may hold different intents but purpose behind all is verify the combination and working of system elements.

9.4 ) Trial Case:

Some conditions or variables which followed by examiner to measure the effectivity of any application or system called as Test instances. It may be a individual measure, or multiple stairss, to guarantee the rightness of an application. A predictable consequence or result is can be shown as follows. Table 9.4 show the trial instance for the proposed system, as table follow by the trial instance name, measure require to acquire expected consequence, expected consequence from the proposed system, an existent how system response and in conclusion comment for trial instance to be base on balls or fail.

Test Case No.

Test Case

Name

Stairss

Expected

Consequence

Actual

Consequence

Remark

Case 1

Client Request

Store informations in server client can bespeak merely for those informations.

Request accept by waiter and acknowledge

Request accepted by waiter and acknowledge to client.

Base on balls

Case 2

Server informations indexing

Server shop informations in database as per client petition database indexing those informations.

Indexing as per the existent sequence of picture file

Indexed picture file to direct informations to buffer as per existent sequence of picture file

Base on balls

Case 3

Buffer acquire informations from database as per indexed

Database send informations to the buffer in bytes

Data infusion in byte format for buffer procedure

Data extracted in byte format and send to buffer

Base on balls

Case 4

Compress informations in buffer

Buffer compacting informations that got from database

Compress Data as per acquiring byte from database

Compressed

Datas that got from database in bytes

Base on balls

Case 5

Extracting theoretical account, position and command portion from tight picture file in bytes

Executor extract theoretical account, position and accountant information and those information shop in array of bytes

Extraction of 3 parts and measure theoretical account and position portion to direct to the client

Extract merely view portion there are no any back land sound consequence

Fail

Case 6

Extracting theoretical account, position and command portion from byte codification of picture file

In executor utilizing FuzzyMVC algorithm to pull out theoretical account, position and command portion

Extract Model, position and command portion from picture file in byte format

Extracted theoretical account, position and accountant

Base on balls

Case 7

Storing control portion informations as a impermanent file

Store Control information from picture in buffer for impermanent

Impermanent storage of control portion and take that storage infinite after completion of dealing

Storing control portion informations as a impermanent file but did non take after dealing completion

Fail

Case 8

Storing control portion informations as a impermanent file

Shop information from picture in buffer for impermanent

Impermanent storage of control portion and take that occupied infinite after completion of client receiving

Storing informations of control file as a impermanent information and take that informations utilizing buffer algorithm

Base on balls

Case 9

Sending extracted theoretical account and position portion to the client

Storing control information from picture file and direct theoretical account and position portion to the client

Send theoretical account and position portion to the client

Sent information continuously to the client

Base on balls

Case 10

Decompress accepted informations

Client need to uncompress informations that got from waiter

GZip algorithm is used for compress and decompress, Decompression of informations

Decompressed informations and got existent consequence without deformation

Base on balls

Table – 9.4: Trial instances

10.1 ) RESULT Analysis:

For ciphering the public presentation of proposed system and besides doing comparative analysis with the consequence been generated from the experimental rating.

  • Compaction Comparison:

Figure – 10.1 ( a ) : Compaction Comparison

RMI Compress Time

Simple compress Time

Array size

0.08

0.082

22

0.082

0.089

45

0.094

0.1

60

0.1

0.11

70

0.110

0.12

75

  • Decompression Comparison:

Figure – 10.1 ( B ) Decompression Comparison

GZIP Decompress Time

Simple Decompress Time

Array Size

0.022

0.022

22

0.023

0.0232

45

0.028

0.03

60

0.052

0.054

70

0.056

0.0585

75

  • Transmission of informations utilizing J2ME RMI ( Between 2 machines )

Figure – 10.1 ( degree Celsius ) : Transmission of Data utilizing J2ME RMI

J2ME RMI ( Between 2 machine )

Simple transmissionthrough IP reference

Array Size

0.63

0.66

22

0.656

0.695

45

0.742

0.776

60

0.793

0.811

70

0.8214

0.841

75

  • Transmission of informations utilizing J2ME RMI ( Using 1 machines ) :

Figure – 10.1 ( vitamin D ) : Data transmittal in individual machine

J2ME RMI ( one machine )

Simple transmittal through socket

Array Size

0.642

0.644

22

0.785

0.789

40

0.831

0.862

60

0.885

0.89

70

0.918

0.934

75

  • Comparison of Proposed System with Current System.

Figure – 10.1 ( vitamin E ) : Proposed system and Youtube comparing

Proposed System Time Taking

YouTube Time Taking

Array Size

1.0021

1.032

22

1.031

1.082

40

1.423

1.48

60

1.602

1.637

80

1.8

1.84

100

1.86

1.89

120

1.92

1.96

140

2.003

2.15

160

2.423

2.501

200

2.654

2.756

220

11.1 ) Main:

H: SCRNSVRSCR1.png

Figure-11.1: Main GUI

11.2 ) Video:

H: SCRNSVRSCR2.png

Figure- 11.2: Video choice

11.3 ) VIDEO PLAYER ( Small size picture ) :

H: SCRNSVRSCR3.png

Figure – 11.3 ( a ) : Small size picture participant

H: SCRNSVRSCR4.png

Figure – 11.3 ( B ) : HD picture participant

11.4 ) AUDIO Choice:

H: SCRNSVRSCR5.png

Figure – 11.4 ( a ) : Audio choice

H: SCRNSVRSCR6.png

Figure – 11.4 ( B ) : Audio Player

  • Decision:

This research proposed an offloading picture compaction, decompression and executing of picture at server side. Compaction utilizing Gzip method is more effectual than any other compression techniques. Gzip usage Quad tree method every bit good as Huffman algorithm to compact the information utilizing this sort of compaction of informations we can state that information is more confidential while directing from waiter to client.

Proposed system usage buffer storage. It will bring informations from database in bytes, compress informations and send to the executor for farther procedure. Buffer storage usage Data buffer algorithm to hive away informations and direct informations as per demand to executor. Executor extract theoretical account, position and command portion from picture file and direct theoretical account and position portion to the requested client and shop control portion as a impermanent information.

This proposed system is more confidential than any other unrecorded cyclosis of picture or any other picture downloader. Proposed system is taking less clip than any other system for unrecorded cyclosis or download. When we are directing theoretical account, position and command portion together to any client at that clip command portion taking more clip to put to death. But, with this proposed system we are covering merely with theoretical account and position portion. System Extract command portion and usage Huffman algorithm at directing clip, it will take less clip than control information send over web.

  • Mentions:
  • RESEARCH / JOURNAL PAPER

1.

[ IEEE CS, 2004 ]

Adaptive Offloading for Pervasive Computing, Published by the IEEE CS and IEEE ComSoc,1536-1268/04/ $ 20.00 © 2004 IEEE

2.

[ CHUEN, 1990 ]

Fuzzy logic in control system: Fuzzy logic accountant – Part I, CHUEN CHIEN, pupil member, IEEE, IEEE dealing on system, MAN and cybernetics, vol.20, NO-2, March / April. 1990

3.

[ NIC, France ]

Transparent and Dynamic Code Offloading for Java Applications, Nicolas Geoffray, Gael Thomas, and BertilFolliotLaboratoired, Informatique de Paris 6 8 herb of grace du Capitaine Scott, 75015 Paris France

4.

[ ALI, 2003 ]

Image Encoding Using Block-Based Transformation Algorithm, Mohammad Ali, BaniYounes and AmanJantan, IAENG International Journal of Computer Science, 35:1, IJCS_35_1_03.

5.

[ BALAKRISHNA, 2013 ]

EMBEDDING OF EXECUTABLE FILE IN ENCRYPTED IMAGE USING LSB MECHANISM, P.Sathish Kumar, Mr. C.BalaKrishnan, International Conference on Information Systems and Computing ( ICISC-2013 ) , INDIA, ISSN 2250-2459 ( Online ) , An ISO 9001:2008 Certified Journal, Volume 3, Particular Issue 1, January 2013

6.

[ JOSHI, IJCET ]

A GENERIC PERFORMANCE EVALUATION MODEL FOR THE FILE SYSTEMS, Farid, SD Joshi, Manjusha Joshi ; International diary of Computer Engineering & A ; Technology ( IJCET ) ,5,1

7.

[ ZHANG, SKYPE ]

Profiling Skype Video Calls: Rate Control and Video Quality, Xinggong Zhang, Yang Xuy, HaoHuy, Yong Liuy, Zongming Guo and Yao Wang.

8.

[ MAKWANA, 2015 ]

Performance Impact Analysis of Application Implemented on Active Storage Framework, Naveenkumar J, Raj Makwana, Prof. S. D. Joshi, Prof. D. M. Thakore ; International Journal of Advanced Research in Computer Science and Software Engineering.

9.

[ MAHESH, 2014 ]

Video Compression Techniques – A Comprehensive Survey, M.Atheeshwari, K.Mahesh, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 1, January 2014 ISSN: 2277 128X.

10.

[ FOX, 1998 ]

Fox et al. , “Adapting to Network and Client Variation Using Active Proxies: Lessons and Positions, ” IEEE Personal Comm. , Aug. 1998, pp. 10–19.

11.

[ NOBLE, 2000 ]

B.D. Noble, “System Support for Mobile, Adaptive Applications, ” IEEE Personal Comm. , Feb. 2000, pp. 44–49.

12.

[ NOBLE, 1997 ]

B.D. Baronial et al. , “Agile Application-Aware Adaptation for Mobility, ” Proc. 16th ACM Symp. Operating Systems Principles ( SOSP 97 ) , ACM Press, 1997, pp. 276–287.

13.

[ LARA, 2001 ]

E. de Lara, D.S. Wallach, and W. Zwaenepoel, “Puppeteer: Component-Based Adaptation for Mobile Computing, ” Proc. 3rdUSENIX Symp. Internet Technologies and Systems ( USITS 01 ) , Usenix Assoc. , 2001, pp. 159–170.

14.

[ X. GU, 2003 ]

X. Gu et al. , “Adaptive Offloading Inference for Delivering Applications in a Permeant Computing Environment, ” Proc. 1st IEEE Int’l Conf. Pervasive Computing and Comm. ( PerCom 03 ) , IEEE CS Press, 2003, pp. 107–114

15.

[ GARAY, 1979 ]

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, W.H. Freeman, 1979.

16.

[ STOER, 1997 ACM ]

M. Stoer and F. Wagner, “A Simple Min- Cut Algorithm, ” J. ACM, July 1997, pp.585–591.

17.

[NAHRSTEDT, 1999 ]

B. Li and K. Nahrstedt, “A Control-Based Middleware Framework for Quality-of-Service Adaptations, ” IEEE J. Selected Areas in Comm. , Sept. 1999, pp. 1632–165.

18.

[ GHOSE, IJCET ]

Gopal Thapa, Kalpana Sharma and M.K.Ghose, “Multi Resolution Motion Estimation Techniques For Video Compression: A Survey” International diary of Computer Engineering & A ; Technology ( IJCET ) , Volume 3, Issue 2, 2012, pp. 399 – 406, ISSN Print: 0976 – 6367, ISSN Online: 0976 – 6375.

19.

[ SOUMYA, 2013 ]

B.K.N.Srinivasa Rao, P.Sowmya, “Architectural Implementation of Video Compression Through Wavelet Transform Coding And Ezw Coding” International diary of Computer Engineering & A ; Technology ( IJCET ) , Volume 3, Issue 3, 2012, pp. 202 – 210, ISSN Print: 0976 – 6367, ISSN Online: 0976 – 6375.

  • Web sites:

1.

hypertext transfer protocol: //en.wikipedia.org/wiki/Computation_offloading

2.

hypertext transfer protocol: //www.oracle.com/technetwork/java/index-jsp-140794.html

3.

hypertext transfer protocol: //cit.srce.unizg.hr/index.php/CIT/article/view/1609

4.

hypertext transfer protocol: //javarevisited.blogspot.in/2013/04/10-reasons-to-learn-java-programming.html

5.

hypertext transfer protocol: //docs.oracle.com/javase/tutorial/java/generics/why.html

6.

hypertext transfer protocol: //jcp.org/en/jsr/detail? id=66

7.

hypertext transfer protocol: //www.deitel.com/articles/java_tutorials/20060422/PlayingVideowithJMF/

  • Books:

1.

BALAGURUSAMY, “Programming with JAVA a primer” , 4th edition ( Mc Graw Hill )

2.

DREAMTECH, M.T.SAVALIYA, “Advance Java Tecnology”

3.

Mark Nelson and Jean-loup Gailly, M & A ; T Books, New York, United States of America, 2nd edition, “The Data Compression Book”

4.

Ross Williams, Kluwer Books, Norwell, United States of America, “Adaptive Data Compression”

  • List OF PUBLICATIONS:

SR. No.

Title of Paper

Name of Writers

Name of the Journal / Publication / Conference

Volume / Issue /Date

Impact Factor

1.

Performance Impact Analysis of Application Implemented on Active Storage Framework

Raj Makwana, NaveenKumar J. , Prof. D.M.Thakore,

Prof. S.D.Joshi

International Journal of Advance Research in Computer Science and Software Engineering

( IJARCSSE )

Volume 5, Issue 2,

28ThursdayFebruary 2015 ISSN: 2277 128X

pp. 550-554,

2.5

2.

Offloading compaction and decompression

logic closer to video files utilizing Remote

Procedure Call

Raj Makwana, NaveenKumar J. , Prof. D.M.Thakore,

Prof. S.D.Joshi

International Journal of computing machine Engineering and Technology

( IJCET )

Volume 6, Issue 3,

30ThursdayMarch 2015, pp. 37-45

ISSN 0976 – 6367 ( Print )

ISSN 0976 – 6375 ( Online )

8.9

Maestro Of Technology Dissertation, 2014-2015Page 1