Judul: Evaluasi koro benguk (Mucuna pruprirens) sebagai tanaman revegetasi pasca penambangan batubara Kalimantan Timur
Abstrak: Salah satu faktor yang menyebabkan keberhasilan reklamasi lahan pasca penambangan batubara adalah pemilihan jenis vegetasi yang tepat sehingga efektif dan efisien sesuai dengan kondisi ekologi setempat dalam memperbaiki kualitas tanah pasca penambangan. Tanaman Koro Benguk (Mucuna pruprirens) merupakan tanaman cover crop yang dapat tumbuh dilahan bekas penambangan batubara. Tanaman ini dapat menaikan pH tanah, meningkatkan ketersediaan N dalam tanah dan sebagai tanaman konservasi yang dapat mengurangi erosi tanah. Penanaman koro benguk yang dilakukan pada disposal C1 (baru direklamasi) dan Disposal P ( baru lima 5 tahun direklamasi) bertujuan untuk mengevaluasi pertumbuhan, tanaman Koro Benguk (Mucuna pruprirens), serapan hara dan membandingkan sifat-sifat kimia (pH, KTK, C-Organik) pada kedua disposal tersebut. Penelitian menggunakan analisis secara deskriptif dengan membandingkan data setiap parameter antar perlakuan pada kedua disposal tersebut dengan 6 perlakuan yaitu Kontrol, Kompos NPK 50kg/ha dan TSP 25kg/ha, Pupuk Kandang NPK 50kg/ha dan TSP 25kg/ha, Kapur 100kg/ha pupuk NPK 50kg, TSP 25kg, kapur 150kg/ha NPK 50kg/ha TSP 50kg/ha dan kapur 200kg/ha NPK 50kg/ha TSP 50kg/ha, sebanyak 3 kali ulangan. Penelitian ini dilakukan di areal pasca penambangan Site Binungan operation PT Berau Coal Kalimantan Timur. Untuk analisis tanah dilakukan di Laboratorium Kimia Tanah Universitas Mulawarman dan Laboratorium Kesuburan Tanah Insitut Pertanian Bogor.
Keyword: 

Judul: Evaluasi Keberhasilan Tanaman Revegetasi Lahan Pasca Tambang Batu Bara Pada Blok M1w Pt Jorong Barutama Greston, Kalimantan Selatan
Abstrak: Pasca operasi penambangan perlu dilakukannya kegiatan reklamasi guna memulihkan dan memperbaiki fungsi lahan ke kondisi yang lebih baik dan produktif (P.60/Menhut-II/2009). Penelitian ini bertujuan untuk menganalisis status keberhasilan revegetasi dilihat dari daya tumbuh dan performa tanaman A. mangium di Blok M1W PT Jorong Barutama Greston, memberikan rekomendasi perbaikan lahan dan tanaman, dan mengidentifikasi penyebab ketidakberhasilan revegetasi. Hasil penelitian ini menunjukkan bahwa status keberhasilan revegetasi pada Blok M1W belum dikatakan berhasil karena dilihat dari rata-rata persentase tumbuh dan kesehatan tanaman masih di bawah 80% yaitu sebesar 59.38% dan 50.01%. Perbaikan yang dilakukan adalah melakukan pembenah tanah dan penyulaman menggunakan tanaman yang tahan terhadap tanah masam dan kandungan logam berat tinggi. Penyebab utama ketidakberhasilan revegetasi dikarenakan kondisi tempat tumbuh yang kurang mendukung pertumbuhan tanaman A. mangium dan kurangnya pemeliharaan tanaman. Hal tersebut menjadi penyebab menurunnya keberhasilan tanaman revegetasi. Selain itu, Standar Operasional Prosedur (SOP) kegiatan revegetasi perlu diperbaiki dengan penambahan mengenai kegiatan pemeliharaan tanaman kaitannya dengan pengendalian hama dan penyakit.
Keyword: A. mangium, evaluasi, lahan pasca tambang, revegetasi

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