Judul: Pengaruh Tingkat Penggenangan dan Naungan Terhadap pertumbuhan Durian (Durio zibethinus L.) pada Media Gambut di Persemaian.
Abstrak: Permasalahan utama lahan gambut adalah kandungan pH yang rendah serta lahannya mudah terbakar saat musim kemarau dan banjir saat musim penghujan. Adanya faktor pembatas tersebut mengakibatkan hanya beberapa jenis tanaman yang toleran pada lahan gambut. Tujuan penelitian ini adalah mengkaji pengaruh perlakuan genangan dan naungan terhadap pertumbuhan durian (Durio zibethinus) pada media dan air gambut. Penelitian ini menggunakan Rancangan Faktorial Acak Lengkap (RAL) dengan 2 faktor perlakuan, yaitu genangan dan naungan. Hasil penelitian ini menunjukkan bahwa interaksi pengaruh genangan dan naungan berpengaruh nyata pada beberapa peubah seperti diameter, berat basah total, berat kering total, nisbah pucuk akar, klorofil dan laju fotosintesis. Durian tumbuh optimal pada naungan 0-30% dengan kondisi tanpa genangan.
Keyword: Durio zibethinus, genangan, laju fotosintesis, naungan

Judul: Pengaruh Komposisi Media Dan Jenis Pupuk Terhadap Pertumbuhan Bibit Durian (Durio zibethinus. Murr) Varietas Monthong
Abstrak: Percobaan ini dilakukan dengan tujuan untuk mencari komposisi media dan jenis pupuk yang dapat meningkatkan peliumbuhan bibit durian. Percobaan dilakukan di Agropromo Center, Departemen Budi Daya Pertanian, pada bulan Februari 2003 sampai Juni 2003. Wilayah ini berada pada elevasi 250 m dpl. Analisis media pada awal dan akhir penelitian dilakukan di Laboratorium Fisika Tanah, Departemen Tanah IPB Percobaan ini 1l1enggunakan rancangan lingkungan acak kelompok yang disusun secara faktorial. Faktor peliama adalah komposisi media dan terdiri dari tiga komposisi berdasarkan volume dengan perbandingan sarna (3 :2: 1) yaitu: (Ml) = arang sekam:tanah:pupuk kandang, (M2) = pasir:tanah:pupuk kandang dan (M3) = kokopit: tanah:pupuk kandang. Faktor yang kedua adalah jenis pupuk yang terdiri dari tiga jenis yang telah disamakan kandungan nitrogennya yaitu: (PI) = NPK 15:15:15 (2.50 g) + NPK 15:15:15 (2.50 g), (P2) = Dekastar 22:8:4 (1.70 g) + NPK 15:15:15 (2.50 g) dan (P3) = Supercote 17:17:17 (2.20 g) + NPK 15: 15: 15 (2.50 g). Setiap percobaan diulang sebanyak 3 kali sehingga didapatkan 27 satuan percobaan. Bahan tanaman yang digunakan adalah bibit durian varietas monthong yang berumur 7 bulan dari okulasi. Bibit tersebut ditana1l1 dalam polybag yang berukuran 6 liter.
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