Judul: Pengaruh pemupukan nitrogen terhadap pertumbuhan suplir
Abstrak: Penelitian menggunakan rancangan acak kelompok yang disusun secara faktorial, terdiri dari 90 satuan percobaan. Faktor pertama adalah pupuk, yaitu: 1) 0 mg urea, 2) 30 mg urea, 3) 45 mg urea, 4) 60 mg urea dan 1500 mg dekastar (18-11-10) per pot. Faktor kedua jenis suplir, yaitu: Adiantum peruvianum Kl., A. tenerum Sw. dan A. cuneatum Langsd & Fisch. Penelitian dilakukan di kebun koleksi Budidaya Perta- nian, Faperta, IPB, Baranangsiang, Bogor. Penelitian ini dimulai 20 Nopember 1983 dan berakhir 20 Mei 1984. Pemupukan tidak berpengaruh nyata terhadap calon tang- kai daun, walaupun tanaman dengan pemupukan dekastar mulai minggu ke 15 selalu menunjukkan rata-rata tertinggi. Pe- mupukan berpengaruh nyata pada tangkai daun minggu ke 25, tanaman dengan pemupukan dekastar menunjukkan angka rata- rata tertinggi, berbeda nyata dengan tangkai daun yang di- bentuk tanaman dengan pemupukan 60 mg urea. Pemupukan ti- dak berpengaruh nyata pada tangkai daun lebih dari 15 cm, sedangkan pada tangkai daun kurang dari 15 cm berpengaruh nyata pada minggu ke 7, 11, 17 dan 23, pada minggu tersebut, tanaman dengan pemupukan dekastar menunjukkan angka ter- tinggi....
Keyword: 

Judul: Pengaruh frekuensi penyiraman pada dosis tertentu terhadap pertumbuhan suplir ( Adiantum spp )
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh frekuensi penyiraman pada dosis tertentu terhadap pertumbuhan 3 jenis suplir: Adiantum tenerum Sw, Adiantum cuneatum Langsd. & Fisch, dan Adiantum peruvianum Kl. Penelitian menggunakan rancangan acak lengkap faktorial, terdiri dari 72 satuan percobaan dan 6 ulangan. Faktor pertama adalah penyiraman: 1) 1 hari sekali, 2) 2 hari sekali, 3) 3 hari sekali dan 4) 4 hari sekali, masing- masing diberi 90 ml air/pot. Faktor ke dua adalah jenis suplir: 1) Adiantum tenerum, 2) Adiantum cuneatum dan 3) Adiantum peruvianum. Penelitian dilakukan di kebun koleksi Budi daya Pertanian, Baranangsiang Bogor. Percobaan berlangsung sejak 10 September 1984 sampai 10 Februari 1985. Penyiraman berpengaruh nyata (p = 0.05) terhadap calon, tangkai, tangkai kurang dari 15 cm, tangkai lebih dari 15 cm dan daun pada tangkai kurang dari 15 cm. Dari nilai rata-rata pengamatan ternyata penyiraman 2 hari sekali mempunyai rata-rata tertinggi dibandingkan penyiraman lainnya. Penyiraman tidak berpengaruh nyata terhadap jumlah daun pada tangkai lebih dari 15 cm. Pertumbuhan suplir mulai banyak distimulir pada minggu ke 14...
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