Óíèâåðñàëüíûå àëãîðèòìû ñæàòèÿ äàííûõ:
Ïðåäñêàçàíèå ïî ÷àñòè÷íîìó ñîâïàäåíèþ
(Prediction by Partial Matching, PPM)
>>
Ðóññêèå ìàòåðèàëû |
Àíãëèéñêèå ìàòåðèàëû |
Èñõîäíûå òåêñòû êîìïðåññîðîâ
Ñìîòðèòå òàêæå ìàòåðèàëû:
- Êîíòåêñòíûå ìåòîäû ñæàòèÿ (áåç PPM)
- Àðèôìåòè÷åñêîå ñæàòèå
- Ñæàòèå ñ ïîìîùüþ ãðàììàòè÷åñêèõ ìîäåëåé
- Îáçîðû óíèâåðñàëüíûõ àëãîðèòìîâ ñæàòèÿ äàííûõ
- Êíèãà "Ìåòîäû ñæàòèÿ äàííûõ". Ðàçäåë 1 "Ìåòîäû ñæàòèÿ áåç ïîòåðü"
|
Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ |
|||
| Àâòîðû | Íàçâàíèå | Îïèñàíèå | Ðåéòèíã |
| Øêàðèí Ä.À. | Ïîâûøåíèå ýôôåêòèâíîñòè àëãîðèòìà PPM | Äëÿ àëãîðèòìà PPM ïðåäëîæåíû íîâûå îïðåäåëåíèÿ îáîáùåííûõ ÷àñòîò ñèìâîëîâ è "óõîäîâ", ïîçâîëèâøèå çàìåòíî óâåëè÷èòü ýôôåêòèâíîñòü êîäèðîâàíèÿ (ñæàòèÿ) ðàçëè÷íûõ òèïîâ ðåàëüíûõ äèñêðåòíûõ äàííûõ áåç èñêàæåíèé. Ïðîáëåìû ïåðåäà÷è èíôîðìàöèè, òîì 37, âûï.3, 2001. Ñ44-54. PDF.RAR 96 êáàéò PS.RAR 84 êáàéò |
|
| Ñìèðíîâ Ì. | PPM FAQ | Ââåäåíèå â PPM. Áîëüøå è äîáàâèòü íå÷åãî :) 25.01.2000 HTML 33 êáàéò TXT.RAR 11 êáàéò |
|
| Bell T., Witten I, Cleary J. | Modeling for Text Compression | Ñðåäè ïðî÷åãî, â ýòîì èçâåñòíîì îáçîðå îñíîâíûõ óíèâåðñàëüíûõ àëãîðèòìîâ ñæàòèÿ ðàññìîòðåíû è àëãîðèòìû PPM.
Ïåðåâîä (êòî ïåðåâîäèë?) ñòàòüè èç ACM Computing Surveys, Vol.21, No.4, pp.557-591, Dec. 1989. TXT.RAR 54 êáàéò Îðèãèíàëüíàÿ ñòàòüÿ íà àíãëèéñêîì: PDF.RAR 499 êáàéò |
|
| Øòàðêîâ Å.Ñ., Àáóçîâà È.Â. (ãì...) | Modeling for Text Compression... Òüôó... Ïðèìåíåíèå êîíòåêñòóàëüíîãî ìîäåëèðîâàíèÿ äëÿ ñæàòèÿ èíôîðìàöèè | Êëèíè÷åñêèé ñëó÷àé ïëàãèàòà: ïåðåäðàí îäèí êî îäíîìó êóñîê ðóññêîãî ïåðåâîäà îáçîðà Modeling for Text Compression è îáúÿâëåí ñâîåé ðàáîòîé. ß ðûäàë...
Èçâåñòèÿ Òóëüñêîãî ãîñ. óíèâ. Ñåðèÿ Ìàòåìàòèêà. Ìåõàíèêà. Èíôîðìàòèêà. Òîì 3. Âûïóñê 2. Èíôîðìàòèêà, 1997, Ñ.102-107. PDF.RAR 284 êáàéò |
|
|
>> Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ |
|||
| Cleary J.G., Witten I.H. | Data compression using adaptive coding and partial string matching |
IEEE Transactions on Communications, Vol. 32(4), pp.396-402, April 1984. PDF.RAR 181 êáàéò RTF.RAR 72 êáàéò |
|
| Bunton S. | On-Line Stochastic Processes in Data Compression | Äîêòîðñêàÿ äèññåðòàöèÿ Ñüþçåí Áàíòîí. Îäíî èç íåìíîãèõ ñåðüåçíûõ èññëåäîâàíèé òåõíèê êîíòåêñòíîãî ìîäåëèðîâàíèÿ.
PhD thesis, University of Washington, 1996. PDF.RAR 800 êáàéò PS.RAR 345 êáàéò |
|
| Bunton S. | A Generalization and Improvement to PPM's "Blending" | Îáîáùåíèå âàðèàíòîâ âû÷èñëåíèÿ îöåíîê âåðîÿòíîñòåé ñ ÿâíûì è íåÿâíûì âçâåøèâàíèåì.
Technical Report UW-CSE-97-01-10, Department of Computer Science and Engineering, University of Washington, 1997. PDF.RAR 201 êáàéò PS.RAR 102 êáàéò |
|
| Bunton S. | Semantically Motivated Improvements for PPM Variants | ...This paper explains how to significantly improve the compression performance of any PPM variant (by 5–12%) by combining PPM’s probability estimator, ‘blending’, with information-theoretic state selection. Hazards inherent to this combination are overcome by identifying the distinct semantics of the two approaches and resolving the differences using a dual-frequency update mechanism... Âûæèìêà îñíîâíûõ èäåé èç äèññåðòàöèè. The Computer Journal, Vol. 40, N. 2/3, 1997, pp.77-93. PDF.RAR 154 êáàéò |
|
| Howard P.G. | The design and analysis of efficient lossless data compression systems | Äîêòîðñêàÿ äèññåðòàöèÿ Ïîëà Õîâàðäà.  ÷èñëå ïðî÷åãî ðàññìàòðèâàþòñÿ PPMD è ñïîñîáû óñêîðåíèÿ PPM.
PhD thesis, Brown University, Providence, Rhode Island, 1993. PDF.RAR 595 êáàéò PS.RAR 377 êáàéò |
|
| Bloom C. | Solving the problems of context modeling | Îïèñàíèå PPMZ. Îäíî èç ïåðâûõ îïèñàíèé SEE.
California Institute of Technology, 1996. PDF.RAR 82 êáàéò PS.RAR 41 êáàéò |
|
| Cleary J.G., Teahan W.J. | Unbounded length contexts for PPM | Îäíà èç ìíîãî÷èñëåííûõ ñòàòåé-êëîíîâ î PPM*.
The Computer Journal, Vol. 40, N. 2/3, pp. 67-75. 1997. Ñîäåðæèìîå íèæíåãî êîëîíòèòóëà ñòàòüè ñ÷èòàòü ïðîâîêàöèåé :-) PDF.RAR 203 êáàéò PS.RAR 163 êáàéò |
|
| Hirschberg D.S., Lelewer D.A. | Context modeling for text compression | Îáçîð êëàññè÷åñêèõ àëãîðèòìîâ êîíòåêñòíîãî ìîäåëèðîâàíèÿ; ìîäèôèêàöèè PPM, èñïîëüçóþùèå íåáîëüøîé îáúåì îïåðàòèâíîé ïàìÿòè.
Èç êíèãè: Image and Text Compression /Eds. J. A. Storer, Kluwer Academic Publishers, 1992. PDF.RAR 134 êáàéò PS.RAR 58 êáàéò |
|
| Lelewer D.A., Hirschberg D.S. | An Order-2 Context Model for Data Compression With Reduced Time and Space Requirements. | Èçó÷åíèå õàðàêòåðèñòèê "îáëåã÷åííîé" êîíòåêñòíîé ìîäåëè ñ óðîâíÿìè 2 è 0.
Technical Report N.90-33. PDF.RAR 84 êáàéò PS.RAR 37 êáàéò |
|
| Cleary J.G., Teahan W.J. | Experiments on the zero frequency problem | Èññëåäóåòñÿ îáîñíîâàííîñòü èñïîëüçîâàíèÿ çàêîíà Ëàïëàñà â àïðèîðíûõ ìåòîäàõ îöåíêè âåðîÿòíîñòè óõîäà.
Department of Computer Science, University of Waikato, New Zealand, 1995. PDF.RAR 171 êáàéò PS.RAR 50 êáàéò |
|
| Teahan W.J. | Probability estimation for PPM | Èçó÷åíèå ñïåöèôè÷åñêèõ ïðèåìîâ, ïðèìåíÿþùèõñÿ â PPM, â òîì ÷èñëå: deterministic scaling, recency scaling, èñïîëüçîâàíèå íåñêîëüêèõ ìåòîäîâ âû÷èñëåíèÿ îöåíîê âåðîÿòíîñòåé.
Proceedings of the New Zealand Computer Science Research Students Conference, 1995. University of Waikato, Hamilton, New Zealand. PDF.RAR 43 êáàéò PS.RAR 20 êáàéò |
|
| Moffat A. | Implementing the PPM Data Compression Scheme | Îïèñàíèå PPMC -- êëàññè÷åñêîé ðåàëèçàöèè PPM.
IEEE Transactions on Communications, Vol. 38, No. 11, pp. 1917-1921, Nov. 1990. PDF.RAR 75 êáàéò |
|
| Øêàðèí Ä. | PPM: one step to practicality | Îïèñàíèå PPMII ïî-ðóññêè àíãëèéñêèìè ñëîâàìè :) Ðàñïèñàíà òåõíèêà âòîðè÷íîé îöåíêè âåðîÿòíîñòè ñèìâîëîâ.
Proceedings of the 2002 IEEE Data Compression Conference, Snowbird, Utah, April 2002. PDF.RAR 189 êáàéò PS.RAR 92 êáàéò |
|
| Witten I., Bell T. | The Zero-Frequency Problem: Estimating the Probabilities of Novel Events in Adaptive Text Compression | Àíàëèç ðàçëè÷íûõ ìåòîäîâ àïðèîðíîé îöåíêè âåðîÿòíîñòè íàñòóïëåíèÿ íîâîãî ñîáûòèÿ. Îïèñàíèå ãðóïïû ìåòîäîâ îöåíêè âåðîÿòíîñòè óõîäà äëÿ PPM.
IEEE Transactions on Information Theory, Vol. 37, No. 4, pp.1085-1094, July 1991. PDF.RAR 178 êáàéò |
|
| Langdon G., Rissanen J. | A Double-Adaptive File Compression Algorithm | Àëãîðèòì Double-Adaptive File Compression -- äåäóøêà ïðàêòè÷åñêèõ êîíòåêñòíûõ àëãîðèòìîâ ñæàòèÿ.
IEEE Transactions on Communications, Vol. COM-31, No.11, pp.1253-1255, Nov. 1983. PDF.RAR 60 êáàéò |
|
| Cheney J. | Compressing XML with Multiplexed Hierarchical PPM Models | Íåêèå ïîïûòêè ñæàòü XML. Ðåçóëüòàòû ïåðëþñòðàöèè íå âûçâàëè íàñòîé÷èâîãî æåëàíèÿ îçíàêîìèòüñÿ ñ ýòèì ìàíóñêðèïòîì ïîáëèæå. Êòî áû ïðî÷èòàë è äàë îöåíêó?
Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 27-29, 2001. PDF.RAR 181 êáàéò PS.RAR 88 êáàéò |
|
| Effros M. | PPM Performance with BWT Complexity: A New Method for Lossless Data Compression | Ðåàëèçàöèÿ PPM* ñ ïîìîùüþ ñòðóêòóðû äàííûõ òèïà "ñóôôèêñíîå äåðåâî" äëÿ ïîèñêà êîíòåêñòîâ.
Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 28-30, 2000. PDF.RAR 173 êáàéò |
|
| Yeates S.A. | The Relationship between Hidden Markov Models and Prediction by Partial Matching Models | ...In the past we have studied the use of PPM models to solve the generalised tag-insertion problem. We show that, in general, PPM-based models are a special case of HMMs, with a particular structure, enabling the use of well researched, mature, HMM tools and techniques to solve the tag-insertion problem...
8th Annual New Zealand Engineering and Technology Postgraduate Conference, University of Waikato, August 30-31. PDF.RAR 48 êáàéò PS.RAR 65 êáàéò |
|
| Shtarkov Yu.M., Zotkin D. | Experimental study of some Cleary-Witten algorithm modifications | Ðàññìîòðåíî ïîâåäåíèå PPM ïðè ðàçëè÷íûõ ñïîñîáàõ îöåíêè âåðîÿòíîñòè ñèìâîëîâ.
Proc. 7th Intl. Workshop on Information Theory, St.Petersbourgh, Russia, June 1995, pp. 211-214. PDF.RAR 288 êáàéò |
|
| Aberg J., Shtarkov Y.M., Smeets B.J.M. | Towards Understanding and Improving Escape Probabilities in PPM | Ïðîàíàëèçèðîâàíû ñïîñîáû íåàäàïòèâíîãî è àäàïòèâíîãî îïðåäåëåíèÿ âåðîÿòíîñòè óõîäà äëÿ íåçàìàñêèðîâàííûõ êîíòåêñòîâ. Ïðåäëîæåíî íåñêîëüêî ñòðàòåãèé îöåíêè âåðîÿòíîñòè óõîäà.
Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 25-27, 1997, pp. 22-31. PDF.RAR 440 êáàéò |
|
| Drinic M., Kirovski D., and Potkonjak M. | PPM Model Cleaning | Ìàéêðîñîôòîâñêèå íàéìèòû :-) îòêðûâàþò äëÿ ñåáÿ âîçìîæíîñòè ïî î÷èñòêå ìîäåëè PPM îò íå îñîáî âàæíîé èíôîðìàöèè ñ öåëüþ óëó÷øåíèÿ ñæàòèÿ ïðè îãðàíè÷åíèÿõ íà ïàìÿòü. Ñëåäóåò çàìåòèòü, ÷òî àíàëîãè÷íûå òåõíèêè óæå äàâíî èñïîëüçóþòñÿ âî ìíîãèõ àðõèâàòîðàõ, è çàìåòíîå óëó÷øåíèå -- êàê ó àâòîðîâ ñòàòüè -- âîçìîæíî òîëüêî òîãäà, êîãäà ñàì àëãîðèòì îöåíêè ñëàáûé. Ñàìà ïî ñåáå ñòàòüÿ íàïèñàíà íåïëîõî.
Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 25-27, 2003. PDF.RAR 170 êáàéò |
|
| Aberg J., Shtarkov Y.M. | Text Compression by Context Tree Weighting | The results of an experimental study of different modifications of the context tree weighting algorithm are described. In particular, the combination of this algorithm with the well-known PPM approach is studied. For one of the considered modifications the decrease of the average (for the Calgary Corpus) coding rate is 0.091 bits compared with PPMD.
Proceedings of IEEE Data Compression Conference, March 25-27, 1997, Snowbird, Utah, pp.377-386. PDF.RAR 503 êáàéò |
|
| Aberg J., Shtarkov Y.M., Smeets B.J.M. | Non-Uniform PPM and Context Tree Models | "Non-Uniform" â òîì ñìûñëå, ÷òî ñïîñîáû îöåíêè óõîäà è îáíîâëåíèÿ ÷àñòîò ìîãóò îòëè÷àòüñÿ äëÿ ðàçíûõ êîíòåêñòíûõ ìîäåëåé. Èññåäîâàíû õàðàêòåðèñòèêè ðÿäà ñòàòè÷åñêèõ ìåòîäîâ îöåíêè âåðîÿòíîñòè óõîäà ïîñðåäñòâîì ïîäáîðà íàèëó÷øèõ ïàðàìåòðîâ äëÿ ôàéëîâ Calgary Corpus. Ïðåäëîæåí àïïàðàò äëÿ ïîëó÷åíèÿ òåîðåòèêî-ïðàêòè÷åñêèõ îöåíîê ãðàíèö óëó÷øåíèÿ ñæàòèÿ çà ñ÷åò óòî÷íåíèÿ ïðåäñêàçàíèÿ óõîäîâ. Ìåòîäû ïðåäïîëàãàþò ïîëó÷åíèå îöåíîê ñ ïîìîùüþ CTW è ÿâëÿþòñÿ â íåêîòîðîì ñìûñëå æóëüíè÷åñêèìè.
Proceedings of IEEE Data Compression Conference, March 30 - April 1, 1998, Snowbird, Utah, pp.279-288. PDF.RAR 139 êáàéò |
|
| Horspool R.N., Cormack G.V. | Constructing Word-Based Text Compression Algorithms | Ðàññìîòðåíî 4 àëãîðèòìà ïîñëîâíîãî ñæàòèÿ íà îñíîâå: àäàïòèâíîãî
êîäèðîâàíèÿ ïî Õàôôìàíó, LZW, PPM 1-0, êîíòåêñòíîãî ìîäåëèðîâàíèÿ ïåðâîãî ïîðÿäêà ñ ó÷åòîì
ïðåäïîëàãàåìîé ÷àñòè ðå÷è. Äàþòñÿ ñðàâíèòåëüíûå ðåçóëüòàòû íà íåñêîëüêèõ íåáîëüøèõ ôàéëàõ. Âåñüìà ëþáîïûòíàÿ
ñòàòüÿ, íåñìîòðÿ íà åå âîçðàñò. Áûëî áû èíòåðåñíî ïîñìîòðåòü íà ñîâðåìåííûå ðåàëèçàöèè
ñ áîëåå ñëîæíûìè ñõåìàìè ìîäåëèðîâàíèÿ, èñïîëüçóþùèå áîëüøèé îáúåì ïàìÿòè.
Ñòðàíèöà ïóáëèêàöèé R. Nigel Horspool'à Proceedings of IEEE Data Compression Conference (DCC'92), Snowbird, UT, March 1992, pp. 62-71. PDF.RAR 23 êáàéò |
|
|
>> Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler |
|||
|
>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler |
|||
| Hirvola H. | HA | Èçâåñòíûé DOS-àðõèâàòîð, â êîòîðîì ðåàëèçîâàíû àëãîðèòì òèïà LZ+Ari (ìåòîä ASC) è àëãîðèòì òèïà PPM ñ àïðèîðíûì ñïîñîáîì îöåíêè âåðîÿòíîñòè óõîäà (ìåòîä HSC).
ßçûê: C âåðñèÿ 0.999 beta 59 êáàéò |
|
| Øêàðèí Ä. | PPMd | Ïàêåò PPMd: áèáëèîòåêà ñæàòèÿ íà îñíîâå PPMII è ïðèìåð åå èñïîëüçîâàíèÿ.
Çà ðåàëèçàöèþ -- 5+, çà ñêóäíûå êîììåíòàðèè -- áàëë äîëîé :) ßçûê: C++ âåðñèÿ I ðåâèçèÿ 1 73 êáàéò |
|
| Bloom C. | PPMZ | Èçâåñòíûé ýêñïåðèìåíòàëüíûé êîìïðåññîð PPMZ.
ßçûê: C âåðñèÿ 9.1 93 êáàéò |
|
| Teahan B. | PPM-star | Îðèãèíàëüíàÿ àâòîðñêàÿ ðåàëèçàöèÿ PPM*.
ßçûê: C ñêà÷àòü 12 êáàéò |
|
| Çèãàíøèí Á. | CM | Äîâîëüíî ýêçîòè÷åñêàÿ øòóêà -- ñòàòè÷åñêèé PPM.
ßçûê: C++ ñêà÷àòü 13 êáàéò |
|
| Pachkovsky S. | Pretty Simple Archiver (PSA) | Íåêèé PPM 10-ëåòíåãî âîçðàñòà. Êòî áû ïðîòåñòèðîâàë íà ñòàíäàðòíûõ íàáîðàõ?
ßçûê: C++ âåðñèÿ 0.91a 46 êáàéò |
|
| Ñìèðíîâ Ì. | DummyPPM | Ó÷åáíûé PPMD, ïîðÿäîê ìîäåëè ðàâåí 5. Òåêñò ñíàáæåí êðàòêèìè êîììåíòàðèÿìè íà ðóññêîì ÿçûêå.
ßçûê: Ñ-îáðàçíûé Ñ++ ñêà÷àòü 11 êáàéò |
|
| Ñìèðíîâ Ì. | Dummy | Êîìïðåññîð ñ ìîäåëüþ 1-ãî ïîðÿäêà. Èñïîëüçóåòñÿ â êà÷åñòâå ïðèìåðà â êíèãå "Ìåòîäû ñæàòèÿ äàííûõ"
ßçûê: C++ ñêà÷àòü 2 êáàéò |
|
| Nelson Ì. | COMP-2 |  ñòàòüå "Arithmetic Coding + Statistical Modeling = Data Compression" Íåëüñîí äàåò èñõîäíûé òåêñò PPM-êîìïðåññîðà ñ êîíòåêñòíîé ìîäåëüþ îãðàíè÷åííîãî ïîðÿäêà (ïîðÿäîê çàäàåòñÿ êàê ïàðàìåòð êîìàíäíîé ñòðîêè). Êîä õîðîøî ñòðóêòóðèðîâàí è îïèñàí.
ßçûê: C ñêà÷àòü 67 êáàéò |
|
| Timmermans M. | Bicom | Áèåêòèâíûé PPM*, íè÷åãî îñîáåííî èíòåðåñíîãî â ìîäåëè íåò, çàòî åñòü øèôðàòîð/äåøèôðàòîð, îñíîâàííûé íà ýòàëîííîé ðåàëèçàöèè ñòàíäàðòà êðèïòîãðàôè÷åñêîãî çàêðûòèÿ AES (îíà æå Rijndael).
ßçûê: Ñ++ Ñàéò ïðîåêòà: http://www3.sympatico.ca/mt0000/ bicom/bicom.html ñêà÷àòü 104 êáàéò |
|
| Goldman M. | LZap | Êîìïðåññîð, íàïèñàííûé íà îñíîâå èñõîäíèêîâ èç ñòàòüè Ì.Íåëüñîíà "Arithmetic Coding + Statistical Modeling = Data Compression".
 îïèñàíèè ïî íåêîé ïðè÷èíå óêàçûâàåòñÿ, ÷òî ýòî ðåàëèçàöèÿ DMC. Ñèå ñîìíèòåëüíî -- ÿáëîêî îò ÿáëîíè íåäàëåêî ïàäàåò, òàê ÷òî ïîêà ëåæèò çäåñü. Õîòÿ ñòåïåíü ñæàòèÿ Calgary Corpus õóæå, ÷åì ó bzip2, ÷òî ñòðàííî äëÿ PPM. Ó÷èòûâàÿ ñîìíèòåëüíîå íàèìåíîâàíèå, êàêîå-òî ñïëîøíîå íåäîðàçóìåíèå ïîëó÷àåòñÿ :-)
ßçûê: Ñ 0.20.0 Beta 50 êáàéò |
|
| Jeff Prothero (Cynbe) | pzip | Êîìïðåññîð, íàïèñàííûé íà îñíîâå èñõîäíèêîâ ppmz2. Àâòîðîì ïðîäåëàíà áîëüøàÿ ðàáîòà ïî ïðî÷èñòêå èñõîäíèêîâ è íàïèñàíèþ âíÿòíûõ êîììåíòàðèåâ. Ìîæíî ðåêîìåíäîâàòü äëÿ èçó÷åíèÿ. Íî ñæàòèå è, îñîáåííî, ñêîðîñòü îñòàëèñü ïðèíöèïèàëüíî õóæå, ÷åì ó PPMd, õîòÿ â öåëîì ëó÷øå, ÷åì ó èñõîäíîãî ppmz2. Ïðåäïîëàãàåòñÿ ñáîðêà ïîä Linux, íî ïðîáëåìû ñ ïîðòèðîâàíèåì ìàëîâåðîÿòíû. GPL.
Ñòðàíèöà ïðîåêòà ßçûê: Ñ âåðñèÿ 0.83 47 êáàéò |
|
|
>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler |
|||
| Ôèëèíñêèé À. | Bee |
Îðèãèíàëüíûé àëãîðèòì ñìåøèâàíèÿ êîíòåêñòîâ ðàçíûõ ïîðÿäêîâ, 4-áèòíûé
(ïîëóáàéòîâûé) àëôàâèò, àâòîìàòè÷åñêàÿ îïòèìèçàöèÿ àëãîðèòìà íà çàäàííûõ
íàáîðàõ ôàéëîâ ñ ïîìîùüþ "ìàãè÷åñêèõ êîíñòàíò".
ßçûê: Object Pascal, Delphi 5.x. Ñàéò ïðîåêòà: http://compression.ru/fa/ Èñõîäíèêè Bee 0.7.6 213 êáàéò Äëÿ êîìïèëÿöèè ïîñòðîèòåëÿ "ìàãè÷åñêèõ êîíñòàíò" BeeOpt òðåáóåòñÿ áèáëèîòåêà êîìïîíåíòîâ RxLib 2.75. Èñõîäíèêè Bee 0.6.3 233 êáàéò ( + èñõîäíèêè ïîñòðîèòåëÿ "ìàãè÷åñêèõ êîíñòàíò" BeeOpt + Bee.Exe è BeeOpt.Exe + ôàéë "ìàãè÷åñêèõ êîíñòàíò" Bee.Ini.) |
|
|
>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler | |||
| Krupnik Alexander | THAP |
Ðåçóëüòàò äèçàññåìáëåìèðîâàíèÿ HAP&PAH 3.0 by Harald Feldman.
ßçûê: Assembler. âåðñèÿ 1.02c 23 êáàéò |
|
Ñìîòðèòå òàêæå ìàòåðèàëû:
- Êîíòåêñòíûå ìåòîäû ñæàòèÿ (áåç PPM)
- Àðèôìåòè÷åñêîå ñæàòèå
- Ñæàòèå ñ ïîìîùüþ ãðàììàòè÷åñêèõ ìîäåëåé
- Îáçîðû óíèâåðñàëüíûõ àëãîðèòìîâ ñæàòèÿ äàííûõ
- Êíèãà "Ìåòîäû ñæàòèÿ äàííûõ". Ðàçäåë 1 "Ìåòîäû ñæàòèÿ áåç ïîòåðü"
íàâåðõ