Judul: Keanekaragaman Parasitoid Pada Perkebunan Tebu (Saccharum Officinarum L.) Di Pt Gmp (Gunung Madu Plantations) Lampung Dan Pt Lpi (Laju Perdana Indah) Sumatera Selatan
Abstrak: Tebu merupakan tanaman yang dapat hidup di iklim tropis dan subtropis. Hama banyak menyerang perkebunan tebu dan dapat menurunkan tingkat produksinya. Pengendalian hama dapat menggunakan musuh alami seperti predator, parasitoid, dan patogen. Parasitoid biasa digunakan dalam mengendalikan hama sebagai musuh alami di perkebunan tebu. Penelitian ini bertujuan mengetahui parasitoid pada pertanaman tebu di perkebunan PT GMP dan PT LPI. Pada masing-masing perkebunan diambil tiga varietas tebu sebagai sampel yaitu tahan, sedang, dan rentan. Parasitoid diambil menggunakan jaring serangga dan separator. Parasitoid juga dikoleksi melalui telur dan larva inang dari lapangan. Parasitoid yang ditemukan adalah Tachinidae (Diptera), Chalcididae, Diapriidae, Evaniidae, Mymaridae, Platygasteridae, Scelionidae, Tetracampidae, dan Trichogrammatidae (Hymenoptera). Telenomus sp. dan Trichogramma spp. merupakan parasitoid telur yang muncul dari telur inang yang dikoleksi. Apanteles flavipes dan Diatraeophaga sp. diperoleh dari larva Chilo spp., sedangkan Stenobracon nicevillei dan Elasmus zehntneri diperoleh dari larva Scirpophaga excerptalis. Indeks keanekaragaman dan sebaran serangga parasitoid tertinggi di PT GMP dan PT LPI didapat pada varietas tahan.
Keyword: Chilo spp., Elasmus zehntneri, indeks keanekaragaman, Scirpophaga excerptalis, Stenobracon nicevillei

Judul: Hama-Hama pada Tanaman Tebu (Saccharum officinarum) di PG Madukismo PT Madubaru Yogyakarta
Abstrak: Tebu (Saccharum officinarum) merupakan salah satu komoditas perkebunan unggulan yang mempunyai peranan penting sebagai bahan baku produksi gula. Budi daya tebu tidak lepas dari serangan organisme pengganggu tanaman (OPT), terutama hama. Informasi mengenai hama spesifik lokasi penting diketahui sebagai rujukan dalam melakukan pengendalian di lokasi tersebut. Penelitian ini bertujuan mengetahui berbagai jenis hama pada tanaman tebu dan intensitas serangan hama utama di PG Madukismo, PT Madubaru, Yogyakarta. Penelitian diawali dengan menentukan tanaman contoh menggunakan metode diagonal. Pengamatan hama dilakukan dalam interval waktu dua minggu sebanyak empat kali meliputi koleksi, identifikasi hama, pencatatan gejala kerusakan yang ditimbulkan, dan menghitung intensitas serangan hama. Tahap identifikasi dilakukan di Laboratorium Invertebrata Hama, Departemen Hama dan Penyakit Tanaman, Fakultas Pertanian, Universitas Gadjah Mada dan Laboratorium Biosistematika Serangga, Departemen Proteksi Tanaman, Fakultas Pertanian, Institut Pertanian Bogor. Hama yang ditemukan menyerang tanaman tebu selama pengamatan, yaitu Lepidiota stigma (Coleoptera: Scarabaeidae), Euchlora viridis (Coleoptera: Scarabaeidae), Chilo sacchariphagus (Lepidoptera: Crambidae), Scirpophaga excerptalis (Lepidoptera: Crambidae), Rattus argentiventer (Rodentia: Muridae), Saccharicoccus sacchari (Hemiptera: Pseudococcidae), Pyrilla perpusilla (Hemiptera: Fulgoridae), dan Valanga nigricornis (Orthoptera: Acrididae). Uret (Lepidiota stigma dan Euchlora viridis) adalah hama yang paling dominan dengan intensitas serangan tertinggi.
Keyword: attack intensity, Lepidiota stigma, Rattus argentiventer

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