Judul: Pengaruh paclubutrazol, jenis dan letak eksplan terhadap pertumbuhan minimal tanaman kentang (Solamun tuberosum L) secara in vitro
Abstrak: Percobaan ini bertujuan untuk mempelajari pengaruh taraf konsentrasi Paclobutrazol, jenis dan letak eksplan terhadap pertumbuhan minimal kentang secara in vitro. Percobaan ini dilaksanakan di Laboratorium Kultur Jaringan, Jurusan Budi Daya Pertanian. Waktu percobaan sejak awal bulan Januari 1988 sampai akhir bulan Desember 1988. Percobaan terdiri dari tiga faktor yaitu : taraf konsen- trasi Paclobutrazol, jenis dan letak eksplan. Konsentra- si Paclobutrazol terdiri dari lima taraf yaitu: 0, 2, 4, 8, 16 ppm. Jenis eksplan yang digunakan adalah tunas pucuk dan tunas aksilar dari tanaman kentang kultivar Red Pontiac hasil perbanyakan secara in vitro. Eksplan ditanam tegak dan mendatar. Percobaan disusun dengan menggunakan Rancangan Acak Lengkap Faktorial. Pengamatan dilakukan setiap bulan sampai dengan bulan ke enam setelah tanam. Peubah yang diamati adalah: tinggi tanaman, jumlah daun, jumlah akar, jumlah tunas dan perubahan warna daun. Pada akhir pengamatan dilakukan sub kultur ke media perbanyakan. Perlakuan Paclobutrazol dengan konsentrasi 2 ppm akan menghambat pertumbuhan tinggi tanaman serta menghambat pembentukan tunas dan akar, sedangkan jumlah daun tidak terhambat. Perlakuan Paclobutrazol dengan konsentrasi 4 ppm sangat menghambat pertumbuhan tanaman. Tanaman tumbuh seperti kumpulan daun dan tidak terbentuk akar. Perlakuan Paclobutrazol dengan konsentrasi 8 dan 16 ppm sudah bersifat meracuni tanaman (toksik). Jenis dan Letak eksplan tidak begitu berpengaruh dalam pengham- batan pertumbuhan tanaman. Pengaruhnya hanya pada awal pertumbuhan. Pertumbuhan tanaman akan kembali normal setelah disub kultur baik untuk perlakuan Paclobutrazol 2 ppm maupun 4 ppm. Sub kultur untuk perlakuan Paclobutrazol 4 ppm dilakukan 2 sampai 3 kali supaya tanaman kembali tum- buh normal. Pada perlakuan Paclobutrazol 2 ppm, sub kul- tur cukup sekali saja dan tanaman sudah kembali tumbuh normal…
Keyword: 

Judul: Pengaruh ancymidol dan letak eksplan terhadap pertumbuhan minimal dua kultivar tanaman kentang (Solanum tuberosum L.) secara in vitro
Abstrak: Penelitian dilakukan di Laboratorium Kultur Jaringan Jurusan Budi Daya Pertanian, Fakultas Pertanian, Institut Pertanian Bogor dengan suhu 20-25°C dan dilaksanakan mu- lai Januari 1988 sampai dengan Desember 1988. Media perbanyakan (padat) terdiri dari larutan MS yang ditambah 100 mg/1 myo-inositol, 2 mg/l Ca-pantothe- nat, 30 g/l sukrosa, 7 g/l agar dan vitamin. Media per- lakuan dibuat sama dengan media perbanyakan dan ditambah lagi dengan kinetin 1 mg/l serta Ancymidol 0 ppm, 1 ppm, 2 ppm dan 4 ppm. Bahan tanaman yang digunakan adalah tunas pucuk kultivar Kennebec dan Norchip hasil perba- nyakan kultur jaringan. Eksplan diletakkan secara hori- sontal dan tegak. Percobaan ini merupakan percobaan fak- torial dengan Rancangan Acak Lengkap. Pengamatan dilaku- kan 4 minggu sekali mulai 4 minggu setelah perlakuan sampai 28 minggu setelah perlakuan. Peubah yang diamati adalah tinggi tanaman, jumlah daun, jumlah tunas, jumlah akar dan perubahan warna tanaman. Setiap kali pengamatan ...
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