Judul: Penggunaan kompos eceng gondok (Eichornia crassipes art.) Solms) sebagai alternatif pengganti pupuk kandang pada pembibitan kakao (Theobroma cacao L.)
Abstrak: Percobaan ini bertujuan untuk mempelajari pengaruh kompos eceng gondok sebagai alternatif pengganti pupuk kandang terhadap pertumbuhan bibit kakao, dan menentukan pengaruh dosis pemupukan nitrogen dalam hubungannya dengan penggunaan kompos eceng gondok terhadap pertumbuhan bibit kakao. Percobaan ini dilaksanakan di Kebun Percobaan Jurusan Budi Daya Pertanian IPB Baranangsiang Pebruari hingga September 1994. Bogor, pada bulan Percobaan dilakukan dengan menggunakan Rancangan Acak Lengkap (RAL) dua faktor perlakuan yaitu kompos eceng gondok dan nitrogen dengan enam ulangan. dari : 1) Κο Perlakuan kompos eceng pupuk kandang, 2) K1 gondok terdiri pupuk kandang: kompos eceng gondok (v/v = 1 : 1), 3) K2 = pupuk kandang : kompos eceng gondok (v/v = 1 : 2), 4) K3 = pupuk kandang: kompos eceng gondok (V/V = 14), dan 5) K4 kompos = eceng gondok. Perlakuan nitrogen terdiri dari: 1) No = 0 gurea/bibit, 2) N₁ = 11 g urea/bibit, 3) N2 urea/bibit, dan 4) N3 = 33 g urea/bibit. 22 g = ...
Keyword: 

Judul: Pengaruh pemberian pupuk organik, NPK dan EM4 terhadap pertumbuhan bibit kakao (Theobroma cacao L.)
Abstrak: Percobaan ini bertujuan untuk mengetahui pengaruh pemberian pupuk organik, NPK, dan EM4 terhadap pertumbuhan kakao, serta membandingkan penggunaan berbagai pupuk (organik dan anorganik) . Percobaan dilaksanakan di Kebun Percobaan Institut Pertanian Bogor, yang terletak di Sindangbarang, Kotamadya Bogor. Pelaksanaan percobaan dimulai dari tanggal 28 Juli 1997 sampai 8 Februari 1998. Bahan-bahan yang digunakan pada percobaan adalah benih kakao Upper Amazone Hybrid (UAR), tanah Latosol Sindangbarang, pupuk organik (kotoran ayam, kotoran kambing, kotoran sapi dan kasting), pupuk majemuk NPK (15:15:15), EM₄, "polibag" berukuran 30 cm x 40 cm x 0.08 mm (volume media 10 liter), dan paranet dengan intensitas naungan 75 persen. Pengendalian hama dan penyakit menggunakan Thiodane 35-EC dan Dithane M-45. Alat-alat yang digunakan terdiri atas literan, meteran, jangka sarong, gelas ukur 50 ml, alat penyiram, ember plastik, timbangan elektrik (Ohauss), Leaf Area Metre dan oven. Percobaan dilakukan dengan menggunakan Rancangan Acak Lengkap (RAL) satu faktor yaitu pemupukan. Percobaan terdiri atas 7 perlakuan yaitu A (kontrol), B (kotoran ayam 2.5 liter/bibit atau ¼ dari volume media ), C (kotoran kambing 2.5 liter/bibit atau ¼ <lari volume med;a), D (kotoran sapi 2.5 liter/bibit atau ¼ dari volume media), E (kasting 2.5 liter/bibit atau ¼ dari volume media), F (NPK 22.5 g/bibit) dan G (EM.i 1%). Setiap perlakuan diulang 4 kali, sehingga terdapat 28 satuan percobaan. Setiap satuan percobaan terdiri atas 5 tanaman sehingga seluruhnya berjumlah 140 tanaman. Parameter yang diamati adalah jumlah daun, tinggi tanam,in, diameter batang, !uas daun, bobot basah tajuk, bobot basah akar, bobot kering tajuk dan bobot kering akar.
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