Wyniki wyszukiwania - BazTech

1

Analiza wskaźnika φ pod kątem przydatności jako miary w ocenie złożoności szyfrowania i jakości szyfrogramu w metodzie s-Tech

Bezeg Przemysław, Pacyna Piotr

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2023

|

nr 4

121--124

PL

Artykuł dotyczy szczególnego rodzaju szyfrowania wiadomości, któremu towarzyszy ukrywanie szyfrogramu pod postacią tekstu. W efekcie otrzymujemy szyfrogram w formie tekstu, który jest poprawny stylistycznie i semantycznie, a więc zbliżony do tekstu naturalnego. W toku badań analizujemy metodę szyfrująco-ukrywającą s-Tech, a w szczególności jej wskaźnik φ, który służy do oceny trudności generowania szyfrogramu i do szacowania jakości wynikowego tekstu, to jest stopnia naturalizmu powstającego szyfrogramu. Celem badań jest sprawdzenie użyteczności tej miary jako uniwersalnego wskaźnika złożoności przebiegu szyfrowania i jakości tekstu. Badanie wskaźnika φ odbywa się poprzez manipulację dwoma parametrami systemu: długością n-Gramów w bazie n-Gramowej (w zakresie od n=1 do n=6, oznaczanej też jako LBS) oraz włączając (albo wyłączając) przetwarzanie wstępne. Oceniamy ich łączny wpływ – nie tylko na przebieg szyfrowania, na trudność, lecz również na jakość szyfrogramu. Analiza odbywa się poprzez porównanie wyników dla trzech wariantów preprocessingu: szyfrowanie hybrydowe połączone z kompresją LZW, kompresja SMAZ oraz dla sytuacji referencyjnej, w której tekst jawny w zapisie ASCII jest szyfrowany bez przetwarzania wstępnego.

EN

The paper focuses on a unique encryption method combined with shaping ciphertext as natural text, which is a form of steganography. We analyze the s-Tech encryption method and its φ indicator by evaluating the difficulty of ciphertext generation and the quality of the resulting natural text. The research aims to examine φ as a universal indicator of both encryption complexity and natext quality. The analysis involves three preprocessing variants: hybrid encryption with LZW compression, SMAZ compression, and a reference situation with null preprocessing.

2

The role of word and n-gram frequency analysis in inference of the content of scientific publication

Zdonek Iwona

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2020

|

z. 142

21--31

EN

Purpose: The paper presents an analysis of a scientific publication with regard to the frequency of words and n-grams. The research problem addressed was the question to what extent the text mining analysis of a scientific publication will allow to infer its content. Design/methodology/approach: The main research method is the analysis of tokenized text using word count functions, bigrams, and trigrams in selected sections of a scientific publication. The results of text mining analysis were compared with the classic, non-automated text analysis of the publication. The presented study is a pilot project in the form of a case study. Findings: The proposed method of analyzing a scientific text using an analysis of the frequency of words and n-grams enables inference of the content of the paper with regard to the names of variables involved in the study, the statistical apparatus used and the key literature cited. It should be observed, however, that the discussed method does not make it possible to establish which variables are moderators and which are mediators. Originality/value: In this paper, the text mining technique was used differently in the discussed study than in previous works. The publication was not examined in its entirety, as previous researchers did, but text mining analysis was applied to individual parts of the paper, i.e. the part discussing theoretical foundations of the research and the part presenting the research method, research results, and their discussion. This allowed for obtaining more precise results regarding the content of the publication.

3

Efficient similarity measures for texts matching

Akinwale A., Niewiadomski A.

Journal of Applied Computer Science

|

2015

|

Vol. 23, nr 1

7--28

EN

Calculation of similarity measures of exact matching texts is a critical task in the area of pattern matching that needs a great attention. There are many existing similarity measures in literature but the best methods do not exist for closeness measurement of two strings. The objective of this paper is to explore the grammatical properties and features of generalized n-gram matching technique of similarity measures to find exact text in electronic computer applications. Three new similarity measures have been proposed to improve the performance of generalized n-gram method. The new methods assigned high values of similarity measures and performance to price with low values of running time. The experiment with the new methods demonstrated that they are universal and very useful in words that could be derived from the word list as a group and retrieve relevant medical terms from database . One of the methods achieved best correlation of values for the evaluation of subjective examination.

4

Akinwale A., Niewiadomski A.

Journal of Applied Computer Science

|

2012

|

Vol. 20, nr 2

7--26

EN

The purpose of this study is to explore the grammatical proper ties and features of generalized n-gram matching technique in electronic test at programming languages. N-gram matching technique has been success fully employed in information handling and decision support system dealing with texts but its side effect is size n which tends to be rather large. Two new methods of odd gram and sumsquare gram have been proposed for the improvement of generalized n-gram matching together with the modification of existing methods. While generalized n-grams matching is easy to generate and manage, they do require quadratic time and space complexity and are therefore ill-suited to the proposed and modified methods which work in quadratic in nature. Experiments have been conducted with the two new methods and modified ones using real life programming code assignments as pattern and text matches and the derived results were compared with the existing methods which are among the best in practice. The results obtained experimentally are very positive and suggested that the proposed methods can be successfully applied in electronic test at programming languages.