Judul: Perbanyakan Tanaman Jarak Pagar (Jatropha curcas L.) dengan Manipulasi Zat Pengatur Tumbuh Dan Eksplan Secara In Vitro
Abstrak: Penelitian ini bertujuan untuk mempelajari pengaruh jenis eksplan dan kombinasi zat pengatur tumbuh terhadap perbanyakan dan pertumbuhan tanaman jarak pagar (Jatropha curcas L.) secara in vitro. Penelitian ini dilaksanakan di Laboratorium Biologi Molekuler dan Seluler Tanaman, Pusat Penelitian Sumberdaya Hayati dan Bioteknologi IPB pada bulan Januari 2006 sampai September 2006. Penelitian terdiri dari empat percobaan: 1) induksi tunas menggunakan dua jenis eksplan, tunas epikotil dan hipokotil yang diberi zat pengatur tumbuh dengan berbagai taraf konsentasi, penanaman eksplan dilakukan ke dalam medium pertunasan yaitu MS yang telah ditambahkan zat pengatur tumbuh (0, 0.05, 0.1 mg/l NAA dan 0, 0.5, 1.0, 2.0 mg/l BAP). 2) Induksi akar menggunakan eksplan tunas pucuk dan penanaman eksplan dilakukan ke dalam medium pengakaran dengan perlakuan (0, 0.5, 1.0, 2.0 mg/l IBA dan 0, 1.0, 2.0 mg/l paclobutrazol). 3a) Induksi kalus menggunakan eksplan hipokotil yang telah ditumbuhkan dalam kondisi in vitro. Percobaan ini menggunakan rancangan lingkungan acak lengkap dengan perlakuan: A = BAP 0 mg/l + 0 NAA mg/l, B=BAP 1.3 mg/l + 0.3 NAA mg/l, C=BAP 2.6 mg/l + 0.6 NAA mg/l, D = BAP 5.2 mg/l + 1.2 NAA mg/l. 3b) Kalus hasil percobaan 3a digunakan sebagai eksplan, disubkultur pada media perlakuan (0, 0.1, 0.2 mg/l IBA dan 0, 0.5, 1.0 mg/l kinetin). Rancangan yang digunakan adalah rancangan perlakuan faktorial disusun dalam rancangan lingkungan acak lengkap. Hasil penelitian menunjukkan bahwa penambahan zat pengatur tumbuh NAA dan BAP berpengaruh terhadap pembentukan tunas pada eksplan tunas epikotil dan hipokotil. Penambahan NAA 0.1 mg/l dan BAP 0.5 mg/l merupakan perlakuan terbaik untuk induksi tunas jarak pagar tetapi multiplikasinya masih rendah. Zat pengatur tumbuh IBA dan paclobutrazol belum mampu meningkatkan pembentukan akar jarak dan konsentrasi IBA 2 mg/l merupakan konsentrasi terbaik untuk pembentukan akar. Penambahan zat pengatur tumbuh BAP dan NAA dapat menginduksi pembentukan kalus dan kombinasi BAP 1.3 mg/l dan NAA 0.3 mg/l merupakan kombinasi terbaik. Penambahan zat pengatur tumbuh IBA dan kinetin belum mampu meregenerasikan kalus dan penambahan IBA 0.2 mg/l dapat meningkatkan pertumbuhan kalus.
Keyword: 

Judul: Studi perbanyakan jarak pagar unggul (Jatropha curcas L.) secara in vitro melalui lintasan organogenesis dan embriogenesis
Abstrak: Penelitian ini bertujuan untuk memperoleh konsentrasi zat pengatur tumbuh dan jenis eksplan yang tepat, yang berpotensi untuk menginduksi organogenesis dan embriogenesis jarak pagar in vitro. Kegiatan penelitian secara keseluruhan terdiri atas tiga percobaan yaitu : (1) organogenesis in vitro pada kotiledon dan hipokotil tanaman jarak pagar; (2) Induksi organogenesis dari stek batang dan daun tanaman jarak pagar, dan (3) Studi perbanyakan masal jarak pagar secara in vitro melalui lintasan embriogenesis somatik.
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