Aydin Carus

Trakya University · Department of Computer Engineering

Decision tree (DT)-based machine learning (ML) algorithms are one of the preferred solutions for real-time internet traffic classification in terms of their easy implementation on hardware. However, the rapid increase in today’s newly developed applications and the resulting diversity in internet traffic greatly increases the size of DTs. Therefore...

Traffic classification is the determination of the application types during real-time flow of internet traffic. Machine learning (ML) based classification approaches that can classify internet traffic using statistical properties of flows are of great interest, due to its ability to work under encrypted traffic conditions. In this paper, we propos...

Traffic classification is the determination of the application types during real-time flow of internet traffic. Machine learning (ML) based classification approaches that can classify internet traffic using statistical properties of flows are of great interest, due to its ability to work under encrypted traffic conditions. In this paper, we propose...

Traffic classification is a process which assorts computer network traffic into predefined traffic classes by utilizing packet header information or network packet statistics. Real-time traffic classification is mainly used in network management tasks comprising traffic shaping and flow prioritization as well as in network security applications for...

In this study a new semistatic data compression model that has a fast coding process and that allows compressed pattern matching is introduced. The name of the proposed model is chosen as tagged word-based compression algorithm (TWBCA) since it has a word-based coding and word-based compressed matching algorithm. The model has two phases. In the fi...

We propose a new compression algorithm that compresses plain texts by using a dictionary-based model and a compressed string-matching approach that can be used with the compressed texts produced by this algorithm. The compression algorithm (CAFTS) can reduce the size of the texts to approximately 41% of their original sizes. The presented compresse...

An individual may sometimes feel anxious when a critical event happens. Job interview, wedding, moving in a new city/country can result this occurrence. Examinations taken in school are also that kind of events. Since our handwriting is controlled by brain, it is possible to see clear changes in handwriting style during examinations. In our study,...

A packet classification task incorporated in network firewalls to recognize and sift threats or unauthorized network accesses is accomplished by checking incoming packet headers against a pre-defined filter set. Plenty of solutions to reduce the memory requirement of filter set storage and accommodate packet classification to line rates have been p...

Dynamically updateable and memory-efficient search structures for Internet protocol (IP) lookup have lately attracted a great deal of attention from the researchers. In this paper, we focus on the next-generation IPv6 routing protocol comprising large and sparsely distributed routing tables. The existing data structures either suffer from inefficie...

Our brain and sub consciousness actually form our character as a result of our habits. Handwriting which is the significant part of our personality is unique. It contains so much knowledge about us. It is possible to get a comprehension about an individual mood by examining handwriting. In the industry, some real-world applications are frequently u...

Field Programmable Gate Arrays (FPGAs) satisfying the abundant parallelism and high operating frequency demands are the most promising platform to realize SRAM-based pipelined architectures for high-speed packet classification. Due to the restrictions of the state-of-the-art FPGAs on the number of I/O pins and on-chip memory, larger filter database...

Providing a high operating frequency and abundant parallelism, Field Programmable Gate Arrays (FPGAs) are the most promising base to realize SRAM-based pipelined architectures for high-speed Internet Protocol (IP) lookup. Owing to the restrictions of the state-of-the-art FPGAs on the number of I/O pins and on-chip memory, the existing approaches ca...

SRAM-based pipelined architectures for high-speed IP lookup using Field Programmable Gate Arrays (FPGAs) has recently attracted a great deal of attention from researchers. Due to the limited amount of on-chip memory and the number of I/O pins of FPGAs, compact data structures providing high memory efficiency are in great demand.In IP lookup, a bina...

Memory efficiency with compact data structures for Internet Protocol (IP) lookup has recently regained much interest in the research community. In this paper, we revisit the classic trie-based approach for solving the longest prefix matching (LPM) problem used in IP lookup. Among all existing implementation platforms, Field Programmable Gate Array...

We developed a fast text compression method based on multiple static dictionaries and named this algorithm as STECA (Static Text Compression Algorithm). This algorithm is language dependent because of its static structure; however, it owes its speed to that structure. To evaluate encoding and decoding performance of STECA with different languages,...

In this paper, a new lossless data compression method that is based on digram coding is introduced. This data compression method uses semi-static dictionaries: All of the used characters and most frequently used two character blocks (digrams) in the source are found and inserted into a dictionary in the first pass, compression is performed in the s...

The aim of this work is to provide caption and summary of the latest news that are taken from the particular web sites for PDA and smartphone users. A web content mining application named Cep Gazetecisi is developed for this aim. This application removes unnecessary data in the source HTML file and transfers the clean data to a mobile device. By us...

In this paper, a new approach on dictionary-based lossless compression method is introduced. In our two-pass compression algorithm (SSDC), most frequently used two character blocks (digrams) are found in source file in the first-pass, and they are inserted into free spaces in ASCII table which are unused by the document in the second-pass. In our m...

zetçe İnternet üzerindeki verilerin büyük bir çoğunluğu HTML yapısındadır. HTML, verilerinin gösterilmesine yönelik geliştirilmiş olan bir dil olduğu için bu biçimdeki bir belgeyi işleyerek içindeki gerekli bilgileri elde edebilmek oldukça çaba gerektirmektedir. Bu çalışmada internet üzerinden Web Robotları tarafından indirilen HTML sayfalarının iç...

zetçe Metin işleme konusunda dizgi eşleme önemli bir yere sahiptir. Dizgi eşlemeye yönelik farklı birçok algoritma geliştirilmiştir. Dizgi eşleme algoritmalarında; kullanılan alfabe, varsa algoritmanın ön işlem aşaması ve dizgiyi bulmak için yaptığı karşılaştırma (deneme) sayısı algoritmanın performansına etki eden önemli parametrelerdir. Bu çalışm...

In this study, Word Based String Matching Algorithm named as WordMatch is represented. This algorithm makes pattern matching over compressed natural language text documents with word based text compression algorithm that is developed by us. Since the compression algorithm based on words, only word based string matching can be done on compressed tex...

A new word-based natural language text transform algorithm that improves compression ratio of compression algorithms is presented in this paper. The algorithm, named as KESIDAL, uses word-based static dictionaries. The main criteria while selecting the words for these dictionaries is the gain of these words in compression ratio. It was seen from ou...

The object-oriented programming and distributed computing techniques made significant impact on modern software development over the past ten years. Older generation client/server architectures, such as RPC (Remote Procedure Call), do not have an object-oriented model. In these architectures, the client must be aware of where the server is located...

In this work, a word-rank based crawler which makes the link analyze according to the words of a page is developed to show how the different crawling strategies affects the performance. It was seen from the test results that; word-rank based crawler can eliminate the web pages that includes advertisements and other types of inessential data. Theref...

In this work, we are trying to find the changes in the performance of the lossless compression algorithms when they are used with different natural languages. For this purpose, we prepared 8 different text corpuses which have the same size for every natural language. We choose the most popular dictionary based and statistical based algorithms for m...

In this study, the changes in the performance of the string matching algorithms when they are used with different natural languages are searched. For this purpose, 8 different text corpuses which are the same in size are prepared for 8 different natural languages. 6 different string matching algorithms are used with these corpuses and the searching...

ZET Web kullanım madenciliğine yönelik .NET ortamında geliştirdiğimiz ve "Web Sunucusu Analizcisi -WSA" olarak isimlendirdiğimiz uygulama, web sitesi tasarımcılarına tasarladıkları sitenin kullanımının ve etkinliğinin değerlendirilmesinde yardımcı olacak bilgiler üretir. WSA veri olarak web sunucusu erişim günlük dosyalarını kullanır, bu verilerden...