Judul: Revegetasi tanah padas ex borrow pit berdominansi kaolinit dengan Centrosema pubescens Benth. pada tanah kemiringan rendah
Abstrak: Research was conducted at the Simpang Kiri,Tanjung Jabung Timur, Jambi from March until June 2010 and February 2011 to observe land cover. The purpose of the research was to investigate the growth of Centrosema pubescens for revegetation on the slope up to 30% in the ex borrow pit area. Experiments in the field is a observational experiments. The plant media experiment in polybag was arranged in a Randomized Complete Block Design by one factor. The interactions between slope and ground colour was significantly different on all parameters with multivariate analysis. Plant media application did have a significant effect on all parameters.
Keyword: 

Judul: Laju Penutupan Tanah Oleh Pertumbuhan Mucuna bracteata DC. Dan Centrosema pubescens Benth. Pada Ex-Borrow Pit Jabung Timur, Jambi
Abstrak: Kegiatan dilaksanakan di Jabung Timur, Jambi dimulai bulan Maret hingga Juli 2010. Tujuan penelitian adalah untuk mengetahui respon pertumbuhan tanaman Mucuna bracteata pada tiga tingkat populasi dan untuk mengetahui respon pertumbuhan Centrosema pubescens pada dua macam ukuran lubang tanam. Penelitian terdiri dari dua percobaan, dimana masing-masing percobaan menggunakan rancangan acak kelompok satu faktor. Tanaman M. Bracteata diberi perlakuan tingkat populasi tanaman, sedangkan tanaman C. Pubescens diberi perlakuan ukuran lubang tanam. Tingkat populasi tanaman yang digunakan pada percobaan pertama terdiri dari tiga taraf yaitu 715 tanaman/ha, 1 287 tanaman/ha, serta 3 003 tanaman/ha. Ukuran lubang tanam yang digunakan pada percobaan kedua terdiri dari dua taraf yaitu ukuran (30 cm x 60 cm) dan yang hanya ditugal. Hasil penelitian pada percobaan M. Bracteata menunjukkan bahwa ratarata pertumbuhan tanaman M. Bracteata tidak berbeda pada setiap satuan percobaan, akan tetapi jika dilihat berdasarkan kelompok pengamatannya, pertumbuhan tanaman M. Bracteata pada ketiga tingkat perlakuan menunjukkan respon pertumbuhan yang berbeda-beda pada setiap parameter pengamatan. Pertumbuhan tanaman yang menggunakan tingkat populasi 3 003 tanaman/ha memiliki nilai yang lebih tinggi daripada perlakuan tingkat populasi yang lainnya. Percobaan tanaman C. Pubescens menunjukkan bahwa respon tanaman dengan menggunakan ukuran lubang tanam (30 cm x 60 cm) memberikan jumlah populasi yang lebih banyak dibandingkan tanaman yang hanya ditugal, akan tetapi jika dilihat dari bentuk fisiologi daun tanaman C. pubescens terlihat bahwa tanaman yang ditugal memiliki bentuk daun yang lebih lebar dibanding tanaman yang menggunakan ukuran lubang tanam (30 cm x 60 cm).
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