Judul: Karakterisasi Potensi Nitrogen pada Tanah-tanah Masam Menurut Uji Bibit Neubauer untuk Tanaman Padi Gogo
Abstrak: Penelitian ini bertujuan mengevaluasi tingkat ketersediaan nitrogen pada tanah-tanah mineral masam dari 11 lokasi yang berbeda terhadap pertumbuhan padi gogo menurut metode Uji Bibit Neubauer. Penelitian dilaksanakan di Rumah Kaca dan Laboratorium Kimia dan Kesuburan Tanah, Jurusan Tanah, Fakultas Pertanian, Institut Pertanian Bogor. Evaluasi status ketersediaan N-tanah dilakukan berdasarkan pendekatan analisis ragam, metode grafik CateNelson, dan persen produksi relatif. Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap sebagai rancangan lingkungan dan Faktorial sebagai rancangan perlakuan. Perlakuan yang diberikan adalah nitrogen dari bahan organik berupa kotoran sapi dengan empat dosis: (1) NO (tanpa bahan organik), (2) Nl (7.5% BKM), (3)N2 (15% BKM), dan (4)N3 (30% BKM) serta kapur CaCO] dengan dua dosis: (1) CaO (tanpa kapur) dan (2) Cal (taraf pengapuran 2 x Aldd ) sehingga diperoleh 8 kombinasi perlakuan. Hasil penelitian menunjukkan bahwa semua jenis tanah yang digunakan memiliki kadar N-tanah yang tergolong rendah. Hal ini terlihat dari hasil evaluasi status ketersediaan nitrogen berdasarkan pendekatan analisis ragam, metode grafik Cate-Nelson, dan persen produksi relatif yang juga memberikan hasil yang berkesesuaian. Kandllngan N-total tanah sesuai dengan respon tanaman yang ditunjukkan oleh persen prodllksi relatifnya. Nilai kritik tanah-tanah penelitian untuk tanaman padi gogo adalah 0.3 % N-total, yang membatasi peluang untuk meningkatkan respon tanaman terhadap pemupukan nitrogen (N-total < 0.3 %) dan peillang untuk menurunkan respon tanaman (N-total > 0.3 %).
Keyword: 

Judul: Karakterisasi Potensi Nitrogen pada Tanah-tanah Mineral Masam untuk Tanaman Kedelai (Glycine Max (L.) Merr) dengan Menggunakan Metode Uji Bibit Neubauer
Abstrak: Penelitian ini bertujuan untuk melihat karakterisasi potensi nitrogen dalam tanah dengan menggunakan metode uji bibit Neubauer terhadap produksi vegetatif tanaman kedelai varietas Wilis untuk tanah tropika masam pada beberapa lokasi di Indonesia. Percobaan dilakukan di rumah kaca dan laboratorium Jurusan Tanah, Fakultas Pertanian, Institut Pertanian Bogor. Dalam percoban ini digunakan contoh tanah tropika masam dari 11 lokasi terpilih di Indonesia, dengan tanaman uji kedelai varietas Wilis. Bahan Organik (N) yang dicobakan adalah kotoran sapi dan kapur yang dipakai adalah kalsit (CaCO3). Pupuk dasar yang digunakan adalah SP-36 (36 % PzOs) dan KC1 (60 % K20). Percobaan ini merupakan percobaan faktorial yang disusun dalam rancangan acak lengkap. Bahan Organik (N) yang dicobakan terdiri dari 4 taraf, yaitu : NO (tanpa bahan organik), N1 (7.5 % BKM), N2 (15 % BKM), N3 (30 % BKM) dan perlakuan kapur terdiri dari 2 taraf, yaitu : CaO (tanpa kapur) dan Cal (dikapur setara 2 x Al-dd).
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