A Dictionary based Efficient Text Compression Technique using Replacement Strategy
|
|
- Ethan West
- 5 years ago
- Views:
Transcription
1 A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, , India Debajyoti Ghosh Department of CSE, UG Student,St. Thomas College of Engineering and Tehnology, Kolkata, , India Piyali Ganguly Department of CSE,UG Student,St. Thomas College of Engineering and Tehnology, Kolkata, , India ABSTRACT The onept of ompression omes from the need to store data using as less spae as possible and to ease transfer of data through a hannel. The proposed algorithm deals with ompression of text files using harater replaement tehnique. For every string of length six, it is ompressed by assigning a single harater to it, maintaining a ditionary. The ditionary is used to deompress the enoded file. This gives a good ompression ratio irrespetive of the ontent of the text file. Keywords Lossless Compression, Charater Replaement, Compression Ratio, 1. INTRODUCTION Data ompression is a tehnique by whih the same amount of data is transmitted by using a smaller number of bits[1,2,3, 4,6]. Data ompression offers an attrative approah to reduing ommuniation osts by using available bandwidth effetively.data ompression tehniques an be divided into two major lasses lossy and lossless. In Lossless data ompression tehnique bits are redued by identifying and eliminating statistial redundany. The main feature of lossless data ompression tehnique is, it onsists of those tehniques whih are able to generate an exat dupliate of the input data stream after a ompress or expand yle. Lossless ompression is possible beause most real world data has statistial redundany. Lossy data ompression onedes a ertain loss of auray in exhange for greatly inreased ompression. Lossy ompression proves effetive when applied to graphis image and digitized voie. In general, data ompression onsists of taking a stream of symbols and transforming them into odes. If the ompression is effetive the resulting stream of odes will be smaller than the original symbols. The deision to output a ertain ode for a ertain symbol or set of symbols based on a model. The model is simply a olletion of data and rules used to proess input symbols and determine whih ode to output. This is a new data ompression algorithm, based on ditionary based text ompression tehnique. The effiieny of that ditionary based text ompression is, it provides good ompression ratio as well as fast deompression mehanism. In this paper the main fous is on ompression of Text data by lossless ompression tehnique. The development of a new algorithm to ompress to ompress and deompress text data having a high ompression ratio.[3] is what this paper primarily deals with the proposed algorithm aims at produing a minimum of 70 % ompression irrespetive of the ontent and the size of the text data. 2. ILLUSTRATIONS 2.1 Algorithm Strategy The proposed algorithm deals with the replaement of string of haraters [4] by a single harater, thus reduing the effetive length of the string. This is done by using printable and non-printable ASCII haraters. As per ASCII standard, the first 256 ASCII haraters are given 1 byte of memory spae. The next group of ASCII haraters, ranging from 256 to 4095, is eah given 2 bytes of memory spae. The next group of ASCII haraters, ranging from 4096 to 65535, is eah given 2 bytes of memory spae. The algorithm is aided by the use of a dynami ditionary [5] whih the algorithm reates. Taking a string of length six from the input file, we divide it into two parts, eah of length three, and put the first part in the row and the seond part in the olumn of the ditionary respetively. At their intersetion, we plae one of those printable or non-printable ASCII haraters. For the next set of string of length six from the input file, we divide it into two parts again and hek the existene of the substrings of length three in the row and olumn of the ditionary to find a math [4].If both the row and olumn entry doesn t math, we insert them in the ditionary and add a new symbol. If only the first substring is mathed with a row entry, we insert the seond substring as a olumn entry and add a new symbol. If the first substring doesn t math any row entry but the seond substring mathes an entry of the olumn then the first substring is entered in the row and a symbol is assigned at their intersetion. If both the substrings mathes a row entry and a olumn entry respetively then no symbol is inserted, the next set of string of length six is taken from the input file. The proess ontinues until the end of file is reahed. Now, sine the harater replaement is done in a fashion that it is one harater against six, and instead of 6 bytes it is now either 1 or 2 bytes, on an average a minimum of 65% ompression is ahieved. Sine it is more unlikely that the frequeny of ourrene of similar 6 onseutive letters will be high, it is broken into two halves, eah of length three and mathing is done for better results. Also the size of the ditionary remains manageable. For example, let us onsider a string: This$is$a$Compression$Algorithm$
2 For our onveniene, we assume that spae is denoted by $. We take the input string, read the first 6 haraters This$i and break it into two substrings of length three eah as: Thi and s$i. We then form the ditionary as per the algorithm and assign a unique harater at their intersetion. Table 1: Formation (1 st step) Thi s$i Proeeding in this manner we form the ditionary until end of string is reahed. Table 2: Formation (2 nd step) s$a Ф $Co Ξ Table 3: Formation (3 rd step) Ess Mpr Table 4: Formation (4 th step) Ion $Al Table 5: Formation (5 th step) Gor Ith Table 6: Formation (6 th step) 234 m$1 After forming the ditionary, the file is ompressed by harater replaement tehnique with the help of the ditionary. After ompression the ompressed file will be: Фξ Using the ditionary we an again generate the original file without any loss of information. Thus the algorithm proposed is lossless. 2.2 Algorithm A text file is taken as input and the following ompression algorithm is used on it to ompress the original file. Steps for Compression: 1. Open the text file. 2. Read the first six haraters of the file. 3. Generate a ditionary with two fields, row and olumn and a third field, symbol, at their intersetion. 4. Divide the string into two parts and plae them in row and olumn respetively. 5. Alloate a symbol/harater value to the field symbol. 6. Read the next sequene of six haraters from the file. 7. Divide the string into two parts and put the parts in two separate string variables, first part and seond part respetively. 8. Compare first part with row and seond part with olumn in the ditionary. 9. If an entry is found in the ditionary, 9.1. If only row value math, make a new olumn entry for the ditionary and put the string in it. Assign a harater to the intersetion of the existing row value and new olumn value If only olumn value math, make a new row entry for the ditionary and put the string in it. Assign a harater to the intersetion of the new row value and existing olumn value. 10. Repeat steps 6 to 9 until end of file is reahed. 11. Store the ditionary in the ompressed file. 12. Rewind to the start of the soure file. 13. Read six haraters from the file and plae the haraters in two string files first part and seond part sequentially 3 haraters eah. 14. Compare first part with row and seond part with olumn in the ditionary. 15. When a math is found, plae symbol value in ompressed file. 16. Repeat steps 13 to 15 till end of file is reahed. After the ompression of the original file is done, the ompressed file is deompressed using the deompression algorithm. The tehnique is lossless beause after deompression the deompressed file will be idential to that of the original file. Steps for Deompression: 1. Open the ompressed file. 2. Reonstrut the ditionary from the stored values in the ompressed file. 3. Read one harater at a time from the ompressed file. 4. Searh the symbol ontents of the ditionary for a math. 5. One a math is obtained, 5.1 Read the row and olumn value at the intersetion where a symbol math has been obtained. 5.2 Plae the row and the olumn strings respetively in the deompressed file. 5.3 Repeat steps 3 to 5 till end of file is reahed. 20
3 2.3 Measuring Compression Performanes Performane measure [1, 4,9] determines whether a ompression tehnique is effiient or not depending upon ertain riteria. Depending on the nature of appliation there are various riteria to measure the performane of ompression algorithms. The two most important fators are time omplexity and spae omplexity. There is always a trade-off between the two. The ompression behavior depends on the ategory of ompression algorithm: lossy or lossless. Following are some measurements to alulate the performanes of lossless algorithms. Compression Ratio: The ratio between size of ompressed file and the size of soure file. size after ompression Compression Ratio = (1) Compression Fator: The inverse of Compression Ratio is the Compression fator. It is the ratio between the size of soure file and the size of ompressed file. Compression Fator = (2) size after ompression It alulates the shrinkage of the soure file as a perentage. ( size after ompression) Perentage = % (3) Based on the above three metris we alulate the ompression performane and effiieny. The smaller the ompression ratio the better would be the performane of the ompression algorithm. Again for better ompression algorithms, the ompression fator must be high. The saving perentage [3, 5, 7, 8 ] gives the idea about the perentage of ompression atually done. Using these parameters we measure the performane and effiieny of our proposed algorithm and ompare it with other standard algorithms. We an show that for the proposed algorithm in ase of worst ase analysis also we get a minimum ompression with saving perentage 70%. For other ases, the saving perentage may reah as high as 80% as well. That is where the proposed algorithm sores more even though there is a trade-off with the spae omplexity that the algorithm faes. 2.4 Calulation For the proposed algorithms, the performane of the same for the worst ase ompression is analyzed here. We take the worst ase analysis where no mathing is found and every time a new entry is inserted in the ditionary. The analysis done is independent of the ontent of the file. 1 st part: For first 256 symbols Size taken up by 1st 256 bytes in the ompressed file: 256*1=256 bytes Original size of the file for those 256 symbols representation: 256 * 6=1536 bytes. Hene, Compression ratio: 256/1536 = ( )/1536 = 83.33%. 2 nd part:for next 3840 symbols Size taken up by symbols from256 to 4095 in the ompressed file: 3840*1=3840 bytes. Size of the symbols from256 to 4095 in the original file: 3840 *6=23040 bytes. Thus, Compression ratio: 3840/23040 = ( )/23040 = 83.33% 3 rd part:for next symbols Size taken up by symbols from4096 to in the ompressed file: 61440*2= bytes. Size of the symbols from 4096 to in the original file: *6= bytes. Thus, Compression ratio: / = ( )/ = 66.67% For alulating the worst ase senario, we have to onsider that all the entries of the ditionary have been filled, i.e. the ditionary ontains all possible entries and every string ombination is present in the file one. In doing so we onsider the total size of the ompressed file with respet to that of the original file. In suh situation, the ompression measure will be as follows: Original file size: (256*6) + (3840*6) + (61440*6) = bytes. Compressed file size: (256*1) + (3840*1) + (61440*2) = bytes. Final Compression ratio: / = ( )/ = 67.7% Thus, in the worst ase analysis we an say that approximately the ompression will be more than that of 65% irrespetive of the ontent of the file. The storage of the ditionary in the ompressed file will inrease the size of the ompressed file affeting the ompression ratio for smaller files. However, in larger files, the ditionary size should beome relatively insignifiant. 2.5 Experimental Results The proposed algorithm when implemented on any arbitrary file size shows ompression ratio and saving fators mathing the one shown in alulation theoretially. The algorithm works on different file sizes irrespetive of the ontent of the file and yields the same results. Sine the deompressed files are rebuild using the ditionary so there is no loss of information and hene the algorithm proves itself to be lossless. The figure below shows the ompression ratio graphially where the plotting is done as original file size vs. the ompressed file size. The ratio between the ompressed file size and the original file size gives the ompression ratio whih an be easily depited from the hart. The experimental 21
4 Compressed size International Journal of Computer Appliations ( ) result shows the saving perentage to be above 70% always. The hart given below displays the stability of the ompression ratio [3, 5] ahieved irrespetive of the file size. We observe that as the file size inreases the saving perentage dereases. But theoretially it is shown that it is always above 70% even if worst ase ompression is done, whih is better than or omparable with existing standard algorithms. The omparison with two of the existing standard algorithm for text ompression is also done in order to ompare the ompression ratio and saving perentage Fig.1. Graph of Original Size vs. Compressed Size A brief analysis of the result of proposed algorithm shows that a stable ompression ratio is ahieved irrespetive of the file size and the ontent of the file. Table 7 shows the original size and size after ompression of the text files taken under onsideration. It also shows a omparative study of the ompression ratio of the existing standard algorithms and the proposed algorithm. The algorithms taken under onsideration are Huffman Enoding and LZW enoding algorithms. [11, 12, 13, 14 ] Name sample1.ja va sample2.ja va sample4.do sample5.do sample6.do sample8.ht m sample9.ht m Plot: Original size vs. Compressed Size Table 7: Comparative study of algorithms Origi-nal Size Original size Compr-essed Size for Proposed Algo-rithm Compressed Size for Winrar Compressi on Compressed Size for Arithmeti Compressi on Table 8: Comparisons of Compression Performane Name Perentage of Proposed Algorithm Perentage of Winrar Compression Perentage of Arithmeti Compression sample1.txt sample2.txt sample4.do sample5.do sample6.do sample8.htm sample9.htm The Compression performane is shown in Table 8 with the help of saving perentage and ompression ratio. The omparative study shows that for the input text files, the saving fator for the proposed algorithm is in the range of 84% approximately whih is higher than that of two existing standard algorithms: Huffman enoding and LZW enoding. The ompression ratios an also be learly depited from the table above. This algorithm gives better result than winrar and arithmeti ompression also. The stable ompression ratio is the area where the proposed algorithm sores over the existing standard algorithms in omparison. 3. CONCLUSION A new algorithm for text ompression has been reommended in this paper, where the key element is the usage of printable and non-printable ASCII haraters to replae strings of haraters. Charater Replaement is the main feature that is highlighted. The reation of a dynami ditionary whih omes in handy while deompressing, is another striking feature whih in turns makes the algorithm a lossless one. The stable ompression ratio and saving fator being more than 70% even in the worst ase analysis makes this algorithm effiient than most of the existing standard algorithms. The omparative study in tabular form supports the argument. The high saving fator ahieved regardless of the file size and the ontent of the file makes this algorithm useful. The basi purposes of data ompression are to redue the file size for storage and for transmission of the same over a hannel. With the ompression ratio ahieved using the proposed algorithm, both the purposes an be served. With proper implementation the spae-time tradeoff an also be handled effetively. The proposed algorithm has an overhead, the ditionary, but in ase of lager files the overhead beomes negligible. The spae omplexity may be redued by seletion of proper data struture. With better implementation tehniques these issues an be handled easily. However, the algorithm is reommended for text ompression beause of its high saving perentage, stable ompression ratio and lossless nature. 4. ACKNOWLEDGEMENT First, we would like to thank Professor Subarna Bhattaharjee, [15] for her valuable advie, provision and onstant enouragement. Her onstant assessments and 22
5 reviews gave us the muh needed theoretial larity. We owe a substantial lot to all the faulty members of the Department of Computer Siene and Engineering and the Department of Information Tehnology. We would also like to thank our friends for tolerantly listening to our explanations. Their reviews and omments were exeptionally helpful. And of ourse, we owe our apability to omplete this projet to our families whose love and enouragement onsumes remained our ornerstone. 5. REFERENCES [1] Debra A. Lelewer and Daniel S. Hirshberg, Data Compression, Journal ACM Computing Surveys (CSUR), Vol. 19 Issue 3, Sept. 1987, pp [2] Khalid Sayood, An Introdution to Data Compression, Aademi Press, [3] David Solomon, Data Compression: The Complete Referene, Springer Publiation, [4] Mark Nelson, The Data Compression Book. [5] Debashis Chakraborty, Sandipan Bera, Anil Kumar Gupta and Soujit Mondal,, Effiient Data Compression using Charater Replaement through Generated Code, IEEE NCETACS 2011, Shillong, India, Marh 4-5,2011,pp 334. [6] Mark Nelson and Jean-Loup Gaily, The Data Compression Book, Seond Edition, M&T Books. [7] Gonzalo Navarro and Mathieu A Raffinot, General Pratial Approah to Pattern Mathing over Ziv-Lempel Compressed Text, Pro. CPM 99, LNCS 1645, Pages [8] M. Atallah and Y. Genin, Pattern mathing text ompression: Algorithmi and empirial results, International Conferene on Data Compression, vol II: pp , Lausanne, [9] Shrusti Porwal, Yashi Chaudhary, Jitendrajoshi, Manish Jain, Data Compression Methodologies for Lossless Data and Comparision between Algorithms, International Journal of Engineering Siene and Innovative Tehnology (IJESIT), Vol. 2 Issue 2, Marh [10] Timothy C. Bell, Text Compression, Prentie Hall Publishers, [11] J.G. Cleary and I.H.Witten, Data Compression using adaptive oding and partial string mathing, IEEE Trans. Commun., Vol. COM-32, no. 4, pp , Apr [12] Pankaj Kumar Ankur Kumar Varshney, Double Huffman Coding,International Journal [13] of Advaned Researh in Computer Siene and Software Engineering, Volume 2, Issue 8, August [14] Nishad PM, R.ManikaChezian, Enhaned LZW (Lempel-Ziv-Welh) Algorithm by Binary Searh with Multiple to Redue Time Complexity for Creation in Enoding and Deoding, International Journal of Advaned Researh in Computer Siene and Engineeering. [15] Dheemanth H N, LZW Data Compression, Amerian Journal of Engineering Researh (AJER), Volume-03, Issue-02, pp [16] S. Bhattaharjee, J. Bhattaharya, U. Raghavendra, D.Saha, P. Pal Chaudhuri, A VLSI arhiteture for ellular automata based parallel data ompression, IEEE-2006,Bangalore, India, Jan IJCA TM : 23
Journal of Computer Engineering and Technology (IJCET), ISSN (Print), International Journal of Computer Engineering
Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
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 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 informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & 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 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 informationDesign of High Speed Mac Unit
Design of High Speed Ma Unit 1 Harish Babu N, 2 Rajeev Pankaj N 1 PG Student, 2 Assistant professor Shools of Eletronis Engineering, VIT University, Vellore -632014, TamilNadu, India. 1 harishharsha72@gmail.om,
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
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 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 informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
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 information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationReduced-Complexity Column-Layered Decoding and. Implementation for LDPC Codes
Redued-Complexity Column-Layered Deoding and Implementation for LDPC Codes Zhiqiang Cui 1, Zhongfeng Wang 2, Senior Member, IEEE, and Xinmiao Zhang 3 1 Qualomm In., San Diego, CA 92121, USA 2 Broadom Corp.,
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
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 informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
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 informationAcoustic Links. Maximizing Channel Utilization for Underwater
Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it
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 informationMultiple-Criteria Decision Analysis: A Novel Rank Aggregation Method
3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr
More informationA scheme for racquet sports video analysis with the combination of audio-visual information
A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy
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 information1 The Knuth-Morris-Pratt Algorithm
5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on
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 informationAustralian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message
ISSN:1991-8178 Australian Journal of Basi and Applied Sienes Journal home page: www.ajbasweb.om A new Divide and Shuffle Based algorithm of Enryption for Text Message Dr. S. Muthusundari R.M.D. Engineering
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 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 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 informationIncremental Mining of Partial Periodic Patterns in Time-series Databases
CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,
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 informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
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 informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More informationGradient based progressive probabilistic Hough transform
Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
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 informationXML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst
XML Stream Proessing Yanlei Diao University of Massahusetts Amherst XML Data Streams XML is the wire format for data exhanged online. Purhase orders http://www.oasis-open.org/ommittees/t_home.php?wg_abbrev=ubl
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 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 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 informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationInternational Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN
International Journal of Advanements in Researh & Tehnology, Volume 3, Issue 3, Marh-204 ISSN 2278-773 47 Phrase Based Doument Retrieving y Comining Suffix Tree index data struture and Boyer- Moore faster
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationNew Channel Allocation Techniques for Power Efficient WiFi Networks
ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationHigh Speed Area Efficient VLSI Architecture for DCT using Proposed CORDIC Algorithm
International Journal of Innovative Researh in Siene, Engineering and Tehnology Website: www.ijirset.om High Speed Area Effiient VLSI Arhiteture for DCT using Proposed CORDIC Algorithm Deepnarayan Sinha
More informationChemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment
hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology
More informationA Hybrid Neuro-Genetic Approach to Short-Term Traffic Volume Prediction
A Hybrid Neuro-Geneti Approah to Short-Term Traffi Volume Predition 1. Introdution Shahriar Afandizadeh 1,*, Jalil Kianfar 2 Reeived: January 2003, Revised: July 2008, Aepted: January 2009 Abstrat: This
More informationA Descriptive Framework for the Multidimensional Medical Data Mining and Representation
Journal of Computer Siene 7 (4): 519-55, 011 ISSN 1549-3636 011 Siene Publiations A Desriptive Framework for the Multidimensional Medial Data Mining and Representation Veeramalai Sankaradass and Kannan
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 informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationTackling IPv6 Address Scalability from the Root
Takling IPv6 Address Salability from the Root Mei Wang Ashish Goel Balaji Prabhakar Stanford University {wmei, ashishg, balaji}@stanford.edu ABSTRACT Internet address alloation shemes have a huge impat
More informationDefinitions Homework. Quine McCluskey Optimal solutions are possible for some large functions Espresso heuristic. Definitions Homework
EECS 33 There be Dragons here http://ziyang.ees.northwestern.edu/ees33/ Teaher: Offie: Email: Phone: L477 Teh dikrp@northwestern.edu 847 467 2298 Today s material might at first appear diffiult Perhaps
More informationRAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,
More informationFacility Location: Distributed Approximation
Faility Loation: Distributed Approximation Thomas Mosibroda Roger Wattenhofer Distributed Computing Group PODC 2005 Where to plae ahes in the Internet? A distributed appliation that has to dynamially plae
More informationDECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Euncheol Kim, Gwan Choi, Mark Yeary *
DECODING OF ARRAY LDPC CODES USING ON-THE FLY COMPUTATION Kiran Gunnam, Weihuang Wang, Eunheol Kim, Gwan Choi, Mark Yeary * Dept. of Eletrial Engineering, Texas A&M University, College Station, TX-77840
More informationA RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL
19th European Signal Proessing Conferene (EUSIPCO 211) Barelona, Spain, August 29 - September 2, 211 A RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL Masashi Okada,
More informationNew Fuzzy Object Segmentation Algorithm for Video Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department
More informationChapter 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 informationThe AMDREL Project in Retrospective
The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
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 informationA Comprehensive Review of Overlapping Community Detection Algorithms for Social Networks
International Journal of Engineering Researh and Appliations (IJERA) ISSN: 2248-9622 National Conferene on Advanes in Engineering and Tehnology (AET- 29th Marh 2014) RESEARCH ARTICLE OPEN ACCESS A Comprehensive
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 informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationModel Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology
The International Arab Journal of Information Tehnology, Vol. 12, No. 6, November 15 519 Model Based Approah for Content Based Image Retrievals Based on Fusion and Relevany Methodology Telu Venkata Madhusudhanarao
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 informationarxiv: v1 [cs.gr] 10 Apr 2015
REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,
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 informationParallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup
Parallelizing Frequent Web Aess Pattern Mining with Partial Enumeration for High Peiyi Tang Markus P. Turkia Department of Computer Siene Department of Computer Siene University of Arkansas at Little Rok
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 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 informationFigure 1. LBP in the field of texture analysis operators.
L MEHODOLOGY he loal inary pattern (L) texture analysis operator is defined as a gray-sale invariant texture measure, derived from a general definition of texture in a loal neighorhood. he urrent form
More informationINTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS
Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal
More informationMulti-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks
Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,
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 informationDoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay
DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at
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 informationParallel Block-Layered Nonbinary QC-LDPC Decoding on GPU
Parallel Blok-Layered Nonbinary QC-LDPC Deoding on GPU Huyen Thi Pham, Sabooh Ajaz and Hanho Lee Department of Information and Communiation Engineering, Inha University, Inheon, 42-751, Korea Abstrat This
More informationtimestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else
3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and
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 informationA Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks
A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,
More informationCell Projection of Convex Polyhedra
Volume Graphis (2003) I. Fujishiro, K. Mueller, A. Kaufman (Editors) Cell Projetion of Convex Polyhedra Stefan Roettger and Thomas Ertl Visualization and Interative Systems Group University of Stuttgart
More informationAn Interactive-Voting Based Map Matching Algorithm
Eleventh International Conferene on Mobile Data Management An Interative-Voting Based Map Mathing Algorithm Jing Yuan* University of Siene and Tehnology of China Hefei, China yuanjing@mail.ust.edu.n Yu
More informationCA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1
Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information.
More informationTransition Detection Using Hilbert Transform and Texture Features
Amerian Journal of Signal Proessing 1, (): 35-4 DOI: 1.593/.asp.1.6 Transition Detetion Using Hilbert Transform and Texture Features G. G. Lashmi Priya *, S. Domni Department of Computer Appliations, National
More informationCluster-based Cooperative Communication with Network Coding in Wireless Networks
Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationNaïve Bayesian Rough Sets Under Fuzziness
IJMSA: Vol. 6, No. 1-2, January-June 2012, pp. 19 25 Serials Publiations ISSN: 0973-6786 Naïve ayesian Rough Sets Under Fuzziness G. GANSAN 1,. KRISHNAVNI 2 T. HYMAVATHI 3 1,2,3 Department of Mathematis,
More informationA Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks
International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 213 A Multi-Head Clustering Algorithm in Vehiular Ad Ho Networks Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao Abstrat Clustering
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 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 informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More information