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: Pengaruh cara inokulasi patogen garis merah bakteri (bacterial red stripe/BRS) terhadap timbulnya gejala penyakit pada berbagai stadia tanaman padi varietas IR-64
Abstrak: Tujuan penelitian ini adalah untuk mengetahui hakekat patogen BRS dan stadia tanaman tertentu yang dapat atau mudah diserang oleh patogen tersebut dengan menerapkan empat cara inokulasi. Penelitian ini dilaksanakan di rumah kaca dan laboratorium penyakit Sentra Peramalan Hama dan Penyakit Tanaman Pangan, Jatisari, Karawang, Jawa Barat. Tanaman yang digunakan sebagai tanaman uji adalah padi (Oryza sativa L) varietas IR-64 yang berumur 2, 3, 4, 5, 6, 7, 8, 9, dan 10 minggu. Inokulasi dilakukan dengan cara penyemprotan (spray), tusuk jarum (needle prick), karborundum (carborundum), dan suntik (injection). Setiap perlakuan dilaksanakan dengan tiga ulangan dan dua kon- trol. Isolasi dan reisolasi patogen dilakukan pada media PSA (Potato Sukrose Agar). Sedangkan untuk identifikasi digunakan medium selektif S-PG. Stadia tanaman yang menunjukkan gejala pada metode penyemprotan adalah 5 10 minggu, tusuk jarum adalah 6- 10 minggu, dan karborundum adalah 8 10 minggu. kan pada metode suntik tidak muncul gejala atau bercak penyakit. Gejala yang ditimbulkan tanaman akibat perlakuan inokulasi berbeda. Gejala khas penyakit BRS ditunjukkan oleh tanaman padi yang mendapat perlakuan penyemprotan. Masa inkubasi penyebab penyakit BRS pada tanaman padi dengan umur yang berbeda dengan ketiga cara inokulasi berkisar antara 12 25 hari. Hasil identifikasi isolat penyebab penyakit BRS asal padi adalah Pseudomonas. Spesiesnya belum diketahui.
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