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: Pengaruh pemupukan nitrogen - kalium dan frekuensi penyiraman air terhadap pertumbuhan dan mutu bibit sengon (Parasericnthes falcataria (L) Nielsen)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh pemupukan N-K dan frekuensi penyiraman terhadap pertum- buhan dan mutu bibit sengon. Penelitian ini dilakukan di rumah kaca Jurusan Budi Daya Pertanian IPB, Baranangsiang Bogor dimulai pada bulan Januari 1992 sampai dengan Mei 1992. Penelitian ini menggunakan Rancangan Acak Lengkap sebagai rancangan lingkungan dan disusun secara faktori- al. Faktor pertama adalah frekuensi penyiraman yang ter- diri atas dua taraf yaitu: penyiraman setiap hari (S1) dan penyiraman dua hari sekali (S2). Faktor kedua adalah pemupukan nitrogen-kalium yang terdiri atas empat taraf yaitu: 0 g Urea + 0 g KCl (PO), 0,5 g Urea 0.5 g KC1 (P1), 1 g Urea + 1 g KCl (P2) dan 1.5 g Urea + 1.5 g KC1 (P3). Percobaan dilakukan dengan tiga ulangan. Hasil percobaan menunjukkan bahwa pertumbuhan dan mutu bibit sengon sangat nyata dipengaruhi oleh frekuensi penyiraman air pada semua peubah yang diamati. Pengaruh dosis pupuk juga sangat nyata pada hampir semua peubah yang diamati, kecuali untuk peubah mutu bibit. Pengaruh interaksi kedua faktor perlakuan terlihat nyata pada pe- ubah tinggi tanaman, berat kering (BK) Tajuk dan BK Akar. Penyiraman dua hari sekali menghasilkan pertumbuhan bibit yang lebih rendah dibandingkan dengan penyiraman setiap hari untuk semua peubah yang diamati. Penyiraman dua hari sekali memperlihatkan indeks mutu bibit yang lebih rendah dibandingkan dengan penyiraman setiap hari. Penyiraman setiap hari menyebabkan lebih tingginya evapotranspirasi tanaman dibandingkan dengan bibit yang disiram dua hari sekali. Efisiensi penggunaan air ter- tinggi dicapai pada penyiraman dua hari sekali. Efisien- si penggunaan air tidak berkorelasi positif dengan pertam- bahan BK biomassa bibit sengon. Bibit yang tidak mendapatkan pupuk N-K (PO) menun- jukkan pertumbuhan yang lebih lambat dibandingkan dengan bibit pada pemupukan P1, P2 dan P3. Pertumbuhan bibit dan dicapai pada perlakuan indeks mutu bibit yang terbaik pemupukan 1 g/bibit (P2)…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