Judul: Pengaruh pemupukan nitrogen dan kalium terhadap perkembangan penyakit garis merah bakteri (Bacterial Red Stripe) di rumah kaca
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh 4 pemupukan nitrogen dan kalium terhadap perkembangan penyakit BRS pada tanaman pagi. Percobaan yang dilakukan di rumah kaca ini menggunakan kantong plastik hitam (polybag) dan tanah yang dilumpurkan sebagai media untuk tanaman padi, serta pupuk Urea dan KCl sebagai sumber nitrogen dan kalium. Percobaan ini memakai Rancangan Acak Lengkap Faktorial yang terdiri 2 faktor pupuk (N dan K) dengan masing-masing 4 kombinasi perlakuan. level dosis sehingga memiliki 16 Inokulasi dilakukan dengan metode penyemprotan pada tanaman yang berumur 8 MST dan dilakukan dua kali. Inokulum BRS yang dicampur dalam media campuran kentang dan gula disemprotkan pada seluruh daun tanaman padi. Gejala BRS pada daun terlihat dua minggu setelah inoku- lasi...
Keyword: 

Judul: Inokulasi bakteri penyebab penyakit garis merah (Bacterial red stripe - BRS) asal pada tanaman sorgum, gandum, rumput gajah dan Padi
Abstrak: Penelitian dilaksanakan sejak Januari 1990 sampai dengan Juli 1990 bertempat di rumah kaca dan laboratorium jurusan Hama dan Penyakit Tumbuhan, Fakultas Pertanian IPB. Tujuan penelitian adalah untuk mengetahui apakah patogen Bacterial Red Stripe (BRS) juga dapat menyerang tanaman lain selain padi. Tanaman yang diuji dalam penelitian ini adalah sorgum (Sorghum vulgare P.), gandum (Triticum spp.), rumput gajah (Pennisetum purpureum Schum.) serta padi (Oryza sativa L.). Suspensi bakteri untuk inokulasi diperoleh dengan mencampurkan 100 ml PS (Potato Sukrose gula kentang) ke dalam 10 tabung reaksi agar miring berisi biakan murni bakteri. Suspensi ini lalu diguncang dengan menggunakan mesin pengguncang (shaker) selama 24 jam. Inokulasi dilakukan dengan metode penyemprotan dengan menggunakan sет protan tangan. Tanaman yang telah diinokulasi lalu disungkup dengan sungkupan plastik dan setelah 24 jam sungkup tersebut dilubangi bagian atasnya dengan diameter lubang kira-kira 3-4 cm, masing-masing satu lubang untuk setiap sungkup. Pengamatan mulai dilakukan seminggu setelah inokulasi dan berlanjut pada minggu kedua dan ketiga.
Keyword: BRS) asal pada tanaman sorgum, gandum, rumput gajah dan Padi

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