Judul: Pengaruh Letak Pemberian Pupuk NPK terhadap Pertumbuhan Akar Semai Sengon (Paraserianthes falcataria (L.) Nielsen)
Abstrak: Knowledge about setting of the root characteristic is very necessary to avoid competition between forest plants with cropping on agroforestry system. This research aims to determine the effect of fertilizer to the dimensions, depth of the root and growth of seedling roots of sengon corresponding layout fertilizer as agroforestry system simulation. The results showed that the highest of root depth and dimension was found in the plants that have treatment of direction and perpendicular NPK fertilizer to the line and without fertilizer. The growth of plant roots sengon given fertilizer NPK will evolve following the layout of the fertilizer, it showed that the growth of plants roots sengon planted in agroforestry system better than monocultures.
Keyword: P. falcataria, NPK fertilizer, fertilizer layout, roots, agroforestry

Judul: Aplikasi Pupuk Kandang dan NPK pada Respons Pertumbuhan Sengon (Paraserianthes falcataria (L.) Nielsen) di Media Bekas Tambang Kapur.
Abstrak: Kegiatan pertambangan kapur merupakan eksploitasi sumberdaya alam yang berlebihan, sehingga dapat memberikan dampak negatif terhadap lingkungan. Penanaman jenis sengon (Paraserianthes falcataria) dalam kegiatan revegetasi diharapkan dapat memperbaiki ekosistem yang rusak akibat aktivitas penambangan. Penambahan pupuk kandang dan NPK dapat memperbaiki sifat fisik, kimia dan biologi tanah. Tujuan penelitian ini adalah mengkaji pengaruh pemberian pupuk kandang dan NPK terhadap pertumbuhan sengon (Paraserianthes falcataria) pada media bekas tambang kapur Ciampea serta memperoleh informasi mengenai dosis pemberian pupuk kandang dan NPK yang terbaik dalam pertumbuhan semai sengon. Hasil penelitian ini menunjukkan bahwa pemberian pupuk kandang tunggal dan NPK tunggal tidak berpengaruh nyata pada semua parameter seperti tinggi, diameter, berat basah total, berat kering total, nisbah pucuk akar dan jumlah bintil akar. Pengaruh pada interaksi antara pupuk kandang dan NPK hanya berpengaruh nyata pada parameter jumlah bintil akar, untuk parameter lainnya tidak berpengaruh nyata. Perlakuan P1N10, P1N15 dan P2N0 merupakan perlakuan terbaik pada parameter jumlah bintil akar.
Keyword: NPK, Paraserianthes falcataria, pertambangan kapur, pupuk kandang

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