Judul: Pengaruh pemberian pupuk green giant NPK terhadap pertumbuhan tanaman kelapa sawit (eleis guineensis Jacq.) TBM I
Abstrak: Percobaan dilakukan di KP Cikabayan, Darmaga Bogor dengan ketinggian tempat 260 m dpl danjenis tanah latosol, pada bulan Juni 1997 sampai Februari 1998. Bahan tanaman yang digunakan adalah pertanaman kelapa sawit jenis Tenera (Dura x Psifera) yang berumur 6 bulan di lapang. Pupuk yang digunakan adalah Green Giant NPK, urea 46% N, Rock Phosphate (RP) 60% P2O₅, Murriate of Potash (MOP) 60% K2O, kieserit 26% MgO dan borate 60% B2O3. Percobaan menggunakan Rancangan Acak Kelompok dengan satu faktor, yaitu pemupukan, dengan taraf 350 (P₁), 700 (P2), 1 050 (P₃) gipohon Green Giant NPK dan pupuk standar sebagai kontrol (P₄) ( aplikasi I : Juni 1997 terdiri atas 200 gram urea dan 500 gram RP per pohon; aplikasi II : September 1997 terdiri atas 375 gram urea, 250 gram MOP, 100 gram kieserit dan 30 gram borate per pohon). Parameter yang diamati meliputi tinggi tanaman, jumlah daun dan lingkar bonggol. Hasil penelitian menunjukkan bahwa pemupukan Green Giant NPK berpengaruh terhadap penambahan tinggi tanaman dan lingkar bonggol. Pemupukan berpengaruh terhadap tinggi tanaman pada umur 4 dan 5 Bulan Setelah Aplikasi (BSA) sedangkan terhadap penambahan lingkar bonggol nyata berpengaruh pada umur 1 BSA. Pupuk Green Giant NPK tidak memberikan respon yang berbeda dibandingkan dengan pupuk standar. Dari tiga peubah yang diamati, pupuk standar dapat digantikan dengan Green Giant NPK dengan dosis 350 grm/pohon.
Keyword: 

Judul: Pengaruh Pupuk Green Giant NPK dan Pupuk N, P, K, Mg terhadap Pertumbuhan Bibit Kelapa Sawit (Elaeis guineensis Jacq.) di Pembibitan Utama
Abstrak: Percobaan dilaksanakan di Kebun Percobaan Cikabayan IPB, Darmaga, Bogor dengan ketinggian tempat 260 m di atas permukaan laut dan jenis tanah latosol pada bulan April- November 1998. Bahan tanaman yang digunakan adalah bibit kelapa sawit jenis Tenera (Dura x Psifera) yang berumur empat bulan. Pupuk yang digunakan adalah pupuk Green Giant NPK, Urea 46 % N, TSP 46 % P20S, KCI 50 % K20 dan Kiserit 27 % MgO. Percobaan menggunakan Rancangan Acak Lengkap dengan dua faktor. Faktor pertama adalah pemupukan Green Giant NPK dengan taraf 0 (Go), ISO (GI), 300 (G2) glbibit dan faktor kedua adalah pemupukan N, P, K, Mg dengan taraf 0 (Po), 0.5 (PI), 1 (P2) x dosis rekomendasi. Hasil penelitian menunjukkan bahwa pemupukan Green Giant NPK berpengaruh terhadap tinggi tanaman, jumlah daun, luas daun keempat, bobot basah akar dan tajuk bibit kelapa sawit. Pemberian pupuk Green Giant NPK meningkatkan efisiensi pemupukan N, P, K, Mg. Kombinasi 300 g Green Giant NPK dan pemupukan N, P, K, Mg 0.5 x dosis rekomendasi menghasilkan tinggi tanaman, jumlah daun, luas daun keempat, bobot basah akar dan tajuk yang tertinggi, dan tidak berbeda nyata dengan pemberian pupuk Green Giant NPK 150 g dan pupuk N, P, K, Mg 0.5 x dosis rekomendasi. Pemberian pupuk Green Giant l\TPK 150 g dan pupuk N, P, K, Mg 0.5 x dosis rekomendasi merupakan alternatif pemberian pupuk pada pembibitan utama kelapa sawit karena biayanya lebih murah dan hasilnya lebih baik serta lebih ramah lingkungan daripada penggunaan pupuk N, P, K, Mg standar.
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