Judul: Pengaruh IBA dan NAA terhadap stek aglaonema var. Donna Carmen dengan perendaman
Abstrak: Penelitian yang dilakukan bertujuan untuk mempelajari dan menganalisis pengaruh pemberian zat pengatur tumbuh kombinasi IBA dan NAA terhadap pertumbuhan dan pengakaran stek Aglaonema var Donna Carmen dengan perendaman. Penelitian ini dilaksanakan pada bulan Agustus sampai Oktober 2008. Penelitian dilaksanakan di rumah plastik, University Farm, Fakultas Pertanian, Institut Pertanian Bogor. Rancangan percobaan yang digunakan yaitu rancangan acak lengkap (RAL) satu faktor yaitu faktor kombinasi konsentrasi IBA dan NAA. Penelitian ini terdiri atas 12 perlakuan yaitu 0 ppm NAA +0 ppm IBA sebagai kontrol (P1), 0 ppm NAA + 0.5 ppm IBA (P2), 0 ppm NAA + 1 ppm IBA (P3), 0 ppm NAA + 1.5 ppm IBA (P4), 0.5 ppm NAA + 0 ppm IBA (P5), 0.5 ppm NAA + 0.5 ppm IBA (P6), 0.5 ppm NAA + 1 ppm IBA (P7), 0.5 ppm NAA + 1.5 ppm IBA (P8), 1 ppm NAA + 0 ppm IBA (P9), 1 ppm NAA + 0.5 ppm IBA (P10), 1 ppm NAA + 1 ppm IBA (P11), 1 ppm NAA + 1.5 ppm IBA (P12).
Keyword: 

Judul: Pengaruh zat pengatur tumbuh IBA dan NAA terhadap pertumbuhan stek anyelir (Dianthus caryophyllus L.
Abstrak: Penelitian ini dilaksanakan dengan tujuan untuk mempelajari pengaruh pemberian zat pengatur tumbuh IBA dan NAA terhadap perakaran stek anyelir serta pertumbuhan dan perkembangan selanjutnya. Penelitian dilakukan di kebun PT. Inkarla, Desa Cilember, Kecamatan Cisarua, Kabupaten Bogor. Rancangan percobaan yang digunakan adalah rancangan percobaan faktorial yang disusun berdasarkan rancangan acak lengkap. Perlakuan terdiri dari dua faktor yaitu faktor auksin dan kultivar. Perlakuan auksin terdiri dari 7 taraf yaitu tanpa auksin, 25 ppm NAA, 50 ppm NAA, 75 ppm NAA, 25 ppm IBA, 50 ppm IBA dan 75 ppm IBA. Sedangkan perlakuan kultivar terdiri dari 3 taraf yaitu cv. Calypso, cv. Scania dan cv. White Candy. Auksin diberikan dengan cara perendaman selama 10 menit. Hasil percobaan menunjukkan bahwa pemberian NAA dan IBA berpengaruh nyata terhadap persentase stek hidup, persentase stek berakar dan jumlah akar stek, namun tidak berpengaruh terhadap pertumbuhan dan perkembangan selan- jutnya. Pada peubah persentase stek hidup dan persentase stek berakar, IBA menunjukkan hasil yang lebih baik di ..dst
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