Judul: Keanekaragaman Nepenthes, Pola Sebaran dan Serangga Mangsa di Taman Nasional Zamrud Provinsi Riau
Abstrak: Nepenthes merupakan genus dari famili Nepenthaceae yang mempunyai ciri khas berupa organ kantong pada ujung daunnya, organ kantong berfungsi sebagai perangkap serangga yang merupakan sumber nitrogen. Kawasan Taman Nasional di Pulau Sumatera yang menjadi habitat Nepenthes adalah Taman Nasional Zamrud. Tujuan dari penelitian adalah untuk mengidentifikasi keanekaragaman Nepenthes, pola sebaran, serta keanekaragaman serangga mangsa spesies Nepenthes di Taman Nasional Zamrud. Metode yang digunakan pada penelitian ini adalah studi literatur, analisis vegetasi, eksplorasi serta identifikasi ordo serangga mangsa. Berdasarkan hasil analisis vegetasi dan eksplorasi di Taman Nasional Zamrud teridentifikasi 4 spesies Nepenthes yaitu N. ampullaria, N. gracilis, N. mirabilis, dan N. rafflesiana. Vegetasi habitat spesies Nepenthes terdiri dari 68 spesies dari 35 famili dengan famili yang mendominasi adalah Sapotaceae dan Myrtaceae. Pola sebaran spesies Nepenthes di lokasi penelitian adalah mengelompok (clumped). Berdasarkan hasil identifikasi serangga mangsa, ordo yang menjadi mangsa utama Nepenthes adalah ordo Hymenoptera, dengan jumlah individu mencapai 1546 ekor pada total seluruh sampel kantong.
Keyword: habitat, Nepenthes, pola sebaran, serangga mangsa, Taman Nasional Zamrud

Judul: Keanekaragaman, Pola Sebaran, dan Asosiasi Nepenthes di Hutan Kerangas Kabupaten Belitung Timur, Provinsi Kepulauan Bangka-Belitung
Abstrak: Nepenthes merupakan tumbuhan yang unik dan berpotensi sebagai tanaman hias. Namun saat ini populasi Nepenthes di habitat alaminya semakin menurun akibat terjadi konversi lahan dan eksploitasi berlebihan oleh masyarakat. Salah satu habitat Nepenthes yang kini semakin terancam keberadaannya akibat upaya konversi lahan yaitu hutan kerangas. Penelitian mengenai Nepenthes di hutan kerangas khususnya di Kabupaten Belitung Timur umumnya belum banyak dilakukan. Penelitian ini bertujuan untuk mengidentifikasi keanekaragaman, pola sebaran, dan asosiasi Nepenthes di hutan kerangas khususnya di Kabupaten Belitung Timur, Provinsi Kepulauan Bangka-Belitung. Penelitian ini dilakukan pada bulan Juli-Agustus 2011 di tiga tipe hutan kerangas di Kabupaten Belitung Timur yaitu Hutan Kerangas Primer (Rimba), Hutan Kerangas Sekunder (Bebak), Hutan Kerangas Khusus (Padang). Pengambilan data dilakukan dengan analisis vegetasi menggunakan jalur berpetak berukuran 10 m x 100 m yang dibagi lagi menjadi petak ukur 10 m x 10 m, jarak antar jalur 50 m dan sebanyak 10 jalur untuk setiap tipe hutan kerangas. Identifikasi spesies Nepenthes menggunakan buku Nepenthes Kantung Semar yang Unik (Mansur 2006) dan buku panduan lapang Hernawati dan Akhriadi (2006).
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