Judul: Manfaat Agroforestri Bagi Masyarakat di Zona Rehabilitasi Taman Nasional Meru Betiri
Abstrak: Pengelolaan zona rehabilitasi Taman National Meru Betiri (TNMB) menerapkan konsep agroforestri. Penelitian ini bertujuan untuk mengidentifikasi keanekaragaman spesies tanaman agroforestri untuk meningkatkan pendapatan masyarakat zona rehabilitasi TNMB serta mengkaji manfaat ekologi dari sistem agroforestri. Pengumpulan data dilakukan melalui studi literatur, observasi lapang dan wawancara kepada 87 responden dari 17 kelompok tani. Hasil penelitian menunjukkan terdapat 22 spesies tanaman pokok dan 12 spesies tanaman sela di lahan rehabilitasi Desa Curahnongko. Jumlah individu tertinggi dari tanaman pokok adalah nangka (Artocarpus integra) yaitu sebanyak 754 individu. Pendapatan tertinggi adalah dari hasil penjualan tanaman durian (Durio zibethinus). Total pendapatan rata-rata petani dari tanaman agroforestri sekitar Rp 37.937.000 per tahun. Manfaat ekologi dari agroforestri antara lain mengurangi bencana erosi dan banjir, menjadi habitat satwaliar serta mengurangi emisi karbon.
Keyword: pendapatan, tanaman agroforestri, zona rehabilitasi

Judul: Tinjauan Keanekaragaman Tanaman Pokok yang Berguna di Lahan Rehabilitasi untuk Mendukung Kesejahteraan Masyarakat Lokal di Taman Nasional Meru Betiri (Studi Kasus di Resort Wonoasri).
Abstrak: Rehabilitasi merupakan upaya memulihkan fungsi dan kondisi kawasan yang telah rusak melalui kegiatan penanaman, pengayaan jenis, dan pemeliharaan. Kegiatan tersebut melibatkan masyarakat sekitar lahan rehabilitasi. Program rehabilitasi lahan tidak hanya akan mengembalikan fungsi ekologis lahan tetapi juga dapat meningkatkan kesejahteraan masyarakat sekitar dari hasil tanaman di lahan rehabilitasi (tanaman pokok). Saat ini masyarakat sekitar Taman Nasional Meru Betiri (TNMB) belum dapat memperoleh manfaat dari tanaman pokok di lahan rehabilitasi. Oleh karena itu, penelitian ini dilakukan untuk mengkaji potensi keanekaragaman jenis dan manfaat tanaman pokok yang sudah ditanam di zona rehabilitasi dan mengkaji keanekaragaman jenis tumbuhan asli TNMB yang berpotensi dikembangkan di zona rehabilitasi untuk dapat mendukung kesejahteraan masyarakat dan konservasi TNMB.
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