Hidden Words Statistics for Large Patterns

We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern $w$ of length $m$ as a subsequence in a random text of length $n$. The quantity of interest is the number of occurrences of $w$ as a subsequence (i.e., occurring in not necessarily consecutive text locations). This problem finds many applications from intrusion detection, to trace reconstruction, to deletion channel, and to DNA-based storage systems. In all of these applications, the pattern $w$ is of variable length. To the best of our knowledge this problem was only tackled for a fixed length $m=O(1)$. In our main result we prove that for $m=o(n^{1/3})$ the number of subsequence occurrences is normally distributed. In addition, we show that under some constraints on the structure of $w$ the asymptotic normality can be extended to $m=o(\sqrt{n})$. For a special pattern $w$ consisting of the same symbol, we indicate that for $m=o(n)$ the distribution of number of subsequences is either asymptotically normal or asymptotically log normal. After studying some special patterns (e.g., alternating) we conjecture that this dichotomy is true for all patterns. We use Hoeffding's projection method for $U$-statistics to prove our findings.

An enhanced fireworks algorithm to generate prime key for multiple users in fingerprinting domain

This work presents a new method to enhance the performance of fireworks algorithm to generate a prime key for multiple users. A threshold technique in image segmentation is used as one of the major steps. It is used processing the digital image. Some useful algorithms and methods for dividing and sharing an image, including measuring, recognizing, and recognizing, are common. In this research, we proposed a hybrid technique of fireworks and camel herd algorithms (HFCA), where Fireworks are based on 3-dimension (3D) logistic chaotic maps. Both, the Otsu method and the convolution technique are used in the pre-processing image for further analysis. The Otsu is employed to segment the image and find the threshold for each image, and convolution is used to extract the features of the used images. The sample of the images consists of two images of fingerprints taken from the Biometric System Lab (University of Bologna). The performance of the anticipated method is evaluated by using FVC2004 dataset. The results of the work enhanced algorithm, so quick response code (QRcode) is used to generate a stream key by using random text or number, which is a class of symmetric-key algorithm that operates on individual bits or bytes.

Simulation of a Homomorphic Encryption System

Cryptology is defined as the science of making communication incomprehensible to third parties who have no right to read and understand the data or messages. Cryptology consists of two parts, namely, cryptography and cryptanalysis. Cryptography analyzes methods of encrypting messages, and cryptanalysis analyzes methods of decrypting encrypted messages. Encryption is the process of translating plaintext data into something that appears to be random and meaningless. Decryption is the process of converting this random text into plaintext. Cloud computing is the legal transfer of computing services over the Internet. Cloud services let individuals and businesses to use software and hardware resources at remote locations. Widespread use of cloud computing raises the question of whether it is possible to delegate the processing of data without giving access to it. However, homomorphic encryption allows performing computations on encrypted data without decryption. In homomorphic encryption, only the encrypted version of the data is given to the untrusted computer to process. The computer will perform the computation on this encrypted data, without knowing anything on its real value. Finally, it will send back the result, and whoever has the proper deciphering key can decrypt the cryptogram correctly. The decrypted result will be equal to the intended computed value. In this paper, homomorphic encryption and their types are reviewed. Also, a simulation of somewhat homomorphic encryption is examined.

Pengamanan Data File Teks (Word) Menggunakan Algoritma RC4

Data security on computers can provide a protection for our data. Cryptographic techniques are very important techniques in securing data. Cryptography is the science of encryption techniques where the "original text" (plaintext) is encrypted using an encryption key into "random text that is difficult to read" (ciphertext) by someone who does not have a decryption key, one of the modern cryptographic methods developed is the RC4 algorithm. RC4 algorithm (Ron’s Code / Rivest’s Cipher) is one algorithm that can be used to encrypt data so that the original data can only be read by someone who has the encryption key.

USING READING IN DETAIL TECHNIQUE TO IMPROVE STUDENTS’ SKILL IN READING RECOUNT TEXT

In this research, the researcher found the students’ problem in reading comprehension of recount text. The problem was the students still had difficulties to determine generic structure (Orientation, Event, Re-Orientation), social function and language features when they read recount text and did the random text of recount text. The purpose of this research was to improve students’ reading comprehension of recount text at class VIII of MTs Ummi Fatimah Pekanbaru and what factors influence it. This research was Clasroom Action Research (CAR). The number of participants were 19 students. The researcher used test, observation sheets, field notes, and interview to collect the data. The result of this research showed that the students’ average in based score was 71,05, in cycle I was 82,63. The average in cycle I could achieve the passing grade score is 75. It was found that some factors that influence the students’ improvement in reading comprehension on recount text by using Reading in Detail Technique were Reading in Detail Technique facilitating students to know, understand and determine generic structure, and language features of recount text when they applied it with their discussion group. And also the interesting materials of recount text helped students understand better like experience, event, etc. In conclution the use of Reading in Detail Technique can improve reading comprehension of recount text at class VIII of MTs Ummi Fatimah Pekanbaru.

Raymond Farrin – Structure and Quranic Interpretation: A Study of Symmetry and Coherence in Islam’s Holy text

The coherence (nazm) and symmetry of the Quran have remained one of the most debated and discussed topics in the field of Quranic Studies; whether or not the Quranic surah or/and the whole Quran exhibit an organic unity has produced a plethora of books. The book under review seeks to refute the longstanding criticism of disjointedness in the Quran, aiming to illustrate how a better understanding of the Qurans structure will in turn help in our textual interpretation of it (p. xvi). The book draws mainly, among others, on Amin Ahsan Islahi (d. 1997) and Michel Cuypers. According to the former, each Quranic chapter is characterised by a degree of unity or a central theme, Amud, that runs through a whole Surah. The Quran is not therefore a random text, as some believe but one which exhibits a precise structural plan, with a majority of chapters occuring in pairs; one chapter forms a pair with its adjacent chapter; pairs form chapter groups, and finally the chapter groups form the Quran as an organic unity. Cuypers, on the other hand, believes that there is a degree of symmetry among a group of chapters arranged in a concentric order.

Implementasi Algoritma Penjadwalan untuk pengelolaan Big Data dengan Hadoop

<p>Paper ini mengusulkan skema scheduler hadoop pada penyelesaikan tipe job yang sesuai untuk peningkatan kinerja Hadoop. Kesesuaian jenis scheduler dan tipe job yang dikerjakan dapat meningkatkan throughput dan menurunkan waktu rata-rata penyelesaian job. Masalah utama pada eksekusi job adalah ketidaksesuaian antara scheduler dengan tipe job yang dikerjakan. Pada paper ini telah dilakukan pengujian terhadap beberapa algoritma scheduler Hadoop yaitu FIFO, Fair, SARS dan COSHH scheduler dengan beberapa jenis job yang ditangani dalam lingkungan hadoop. Jenis-jenis job yang diujikan adalah word count, random text writer dan grep. Pengujian dilakukan dua skenario, yaitu job homogen (satu jenis) dan heterogen (beberapa jenis job) dikerjakan bersama. Hasil pengujian menunjukan bahwa algoritma SARS cocok digunakan pada penyelesaian job yang sifatnya homogen. Sementara itu algoritma COSHH cocok digunakan pada penyelesaian job gabungan yang heterogen. </p>