Judul: Karakteristik iklim mikro dan respon tanaman padi gogo pada pola tanam sela dengan tanaman karet
Abstrak: Penelitian ini bertujuan untuk mempelajari iklim mikro di bawah tegakan tanaman karet,serta mengidentifikasi perbedaan respon galur padi gogo yang ditanam sebagai tanaman sela pada berbagai umur tanaman karet dan tingkat naungan paranet. Penelitian ini terdiri dari dua tahap yaitu percobaan I dilakukan pada kebun karet PTP. Nusantara VIII Cikumpay-Purwakarta, dimulai Desember 1997-April 1998, dengan menggunakan berbagai tingkat naungan (umur) tanaman karet. Percobaan II dilakukan pada kebun percobaan Pusat Studi Pemuliaan Tanaman (PSPT) Cikabayan - Darmaga, mulai Juni-Oktober 1998, dengan menggunakan naungan paranet.
Keyword: 

Judul: Keragaan beberapa galur lokal padi gogo di sela tanaman karet muda pada musim kemarau
Abstrak: Padi gogo merupakan salah satu alternatif untuk memenuhi kebutuhan pangan. Pengembangannya diharapkan dapat mendukung peningkatan produksi padi nasional. Sejak tahun 1994/1995 padi gogo mulai dikembangkan di seluruh Indonesia terutama di lahan-lahan perkebunan dan lahan-lahan bukaan baru. Pada lahan tersebut umumnya padi gogo dikembangkan secara tumpangsari. Pengembangan pada ekosistem ini perlu memperhatikan taraf naungan, ketersediaan air, ketersediaan hara dan ketahanan terhadap penyakit bias. Penelitian ini perlu dilakukan untuk mendapatkan material genetik yang mempunyai sifat-sifat unggul yang diharapkan. Material genetik yang diperoleh dapat dijadikan sebagai alternatif tetua dalam pengembangan varietas padi gogo nasional terutama untuk digunakan dalam program tersebut diatas. Penelitian bertujuan untuk menguji keragaan beberapa galur lokal padi gogo Indonesia yang ditanam di sela tanaman karet muda. Penelitian dilakukan pada bulan Maret hingga Agustus 1997 di kebun karet TBM 3 Afdeling III Mandaling PTPN VIII Cibungur Sukabumi. Kebun ini berada pada ketinggian 200-400 m dpl. Rancangan percobaan yang digunakan adalah Rancangan Acak Kelompok satu faktor dengan tiga ulangan. Faktor yang diuji adalah 42 galur padi gogo yang terdiri atas 39 galur lokal dan 3 varietas nasional. Petak percobaan dibuat pada lajur sela tanaman karet yang berjarak 6m yang sebelumnya ditutupi oleh LCC dan gulma. Ukuran petak percobaan adalah 1.1 m x 2.0 m untuk setiap nomor galur.
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