Judul: Identifikasi dan inventarisasi Eimeria sp. pada ayam (Gallus sp.) di peternakan kokotek desa Air Terjun Kecamatan Lubuk Alung Kabupaten Padang Pariaman
Abstrak: Penelitian ini dilakukan untuk mengetahui jenis Eimeria yang menginfeksi ayam di Peternakan Kokotek Desa Air Terjun, Kecamatan Lubuk Alung, Kabupaten Padang Pariaman. Penelitian ini menggunakan 200 ekor ayam pedaging berumur 2 minggu yang dipelihara dengan sistem litter. Sampel yang diambil adalah dalam bentuk feses, feses dimasukkan ke dalam kantung plastik dan dicampur dengan larutan kalium bikhromat (K2Cr2O7) 2%. Pengambilan sampel dilakukan secara acak dengan jarak pengambilan Im dari setiap sampel yang diambil. Metode yang digunakan untuk menghitung ookista/ml sampel adalah metode pengapungan (flotasi) dengan menggunakan garam jenuh, sentrifuse dan kamar hitung Neubauer. Penelitian ini dilakukan di Laboratorium Protozoologi, Bagian Parasitologi. Identifikasi terhadap ookista Eimeria dilakukan berdasarkan morfologi dari ookista tersebut, yaitu bentuk dan ukuran ookista (panjang dan lebar) serta indeks (panjang/lebar). Untuk menentukan dominasi Eimeria sp. pada setiap minggu pengambilan sampel adalah jumlah ookista satu spesies dalam satu minggu dibagi dengan jumlah keseluruhan ookista dalam satu minggu dikali dengan 100%. Hasil identifikasi sampel berdasarkan bentuk, ukuran dan indeks diperoleh 6 jenis Eimeria yaitu: Eimeria maxima (47,23%), Eimeria necatrix (22,62%), Eimeria brunetti (19,96%), Eimeria tenella (8,65%), kemudian diikuti oleh Eimeria mivati dan Eimeria acervulina dengan persentase masing-masing adalah 1,11% dan 0,44%. Secara keseluruhan Eimeria yang paling dominan ditemukan adalah Eimeria maxima….
Keyword: 

Judul: Identifikasi Ookista Eimeria sp Dalam Saluran Pencernaan Ayam (Gallus gallus) dari Desa Cibeureum Tengah dan Leuwiliang Kabupaten Bogor.
Abstrak: Skripsi ini disusun bertujuan untuk mengidentifikasi dari jenis-jenis Eimeria yang menginfeksi ayam pedaging secara alami yang ditemukan di peternakan ayam pedaging KUD Kurnia di desa Cibeureum Tengah dan Leuwiliang, Kabupaten Bogor. Pengambilan sampel dilakukan setelah ayam berumur 30 hari.
Keyword: 

Judul: Algorithm construction of HLI hash function
Abstrak: Cryptography is a study of mathematical techniques related to aspects of information security regarding on confidentiality, data integrity, entity authentication, and data origin authentication. Data integrity is a service, which is associated with the conversion of data carried out by unauthorized parties. To maintain data integrity, one can use hash functions. An hash function is a computationally efficient function to map an arbitrary length bitstring to a fixed length bitstring called as hash value. The use of hash function in maintaining the information integrity and authentication is in digital signatures, virus protection, and software distribution. Illustration of the hash function in the integrity and authentication of information that is emailed as follow. The sender sends the information and hash value to the recipient. If the hash value of the information is equal to the hash value that is sent by the sender, then information has not been changed. Otherwise the information has been changed. An hash function has two properties, one way and collision resistance. An hash function is called one way if it is computationally infeasible to find any input such that when given any hash value . Meanwhile an hash function is called collision resistant if it is computationally infeasible to find any two inputs where such that . The purpose of this study is to construct a HLI hash function algorithm, to analyze the speed and security of the hash functions as a results of construction. Furthermore, it is to compare it with SWIFFT. Hash function is constructed based on the result of algebraic operations on modular polynomial ringwith . Modular polynomial ring noted as is a set of all polynomials of degree at most with coefficients in . can be represented as a set of integer vector of modulo in dimension . So, it is simple to implement in a computer. In vector operations, is lattice . Furthermore, alattice that is defined from certain polynomial ring is called ideal lattice. HLI hash function is consists of addition and multiplication algorithm in the ring. Addition algorithm consists of sumation operations of modulo and multiplication consists of multiplication operations of modulo . Generally, algorithm of HLI hash function consists of multiplication operations of modulo and addition operations of modulo . However, if the input is binary number then multiplication algorithm only consists of multiplication operation of modulo , so algorithm of HLI hash function consists of multiplication operations of modulo and addtion operations of modulo . An hash function is secured if it has two properties, i.e., one way and collision resistance. HLI hash function hash is one way, it is following the proof of Micciancio. It is has collision resistant because of polynomial is irreducible over and monic. Moreover, it is proved that for every unit vector , the vector is small vector. If the input of hash function is a binary number then HLI hash function only involves addition operations of modulo . So the time that used almost same with SWIFFT. The excellence of HLI hash function is the key size smaller than SWIFFT. This effect on
Keyword: hash function, modular polynomial ring, lattice