Judul: Studi Bahan Setek Dan Media Tanam Pada Pembibitan Tanaman Sambung Nyawa(Gynura Procumbens (Lour.) Merr.)
Abstrak: Penelitian ini bertujuan untuk mengetahui pertumbuban dua jenis bahan setek tanaman sambung nyawa [Gynura procumbens (Lour.) Merr] pada beberapa jenis media pembibitan. Penelitian ini dilaksanakan di Kebun Percobaan Leuwi Kopo Dramaga IPB dari bulan Mei-Juli 2004. Rancangan ·yang digunakan dalam penelitian ini adalah Rancangan Acak Kelompok Faktorial dengan dua faktor. Faktor pertama perlakuan jenis bahan setek yaitu setek pucuk dan setek batang, dan sebagai faktor kedua perlakuan komposisi media tanam yaitu tanah sebagai kontrol, tanah + arang sekan1, tanah + pupuk kandang dan tanah + kompos. Setiap satuan percobaan terdiri dari 3 ulangan dengan 8 kombinasi perlakuan. Sehingga terdapat 24 satuan pecobaan. Masing-masing satu percobaan terdiri dari IO tanaman, sehingga total tanan1an berjumlah 240. Parameter yang diamati dalam penelitian ini meliputi persentase tumbub, tinggi tanaman, jumlah daun, jumlah cabang, bobot basah dan kering tajuk, panjang akar, jmnlah akar dan bobot basah dan kering akar. Perlakuan bahan setek berpengaruh nyata hanya terhadap peubah tinggi tanaman, jumlah daun dan jumlah cabang. Pada 4 MST setek batang rata-rata menghasilkan 2.5 cabang dengan 14.9 daun, nyata lebih banyak dibanding setek pucuk (0.4 cabang dengan 8.9 daun). Untuk peubah tinggi tanaman, setek pucuk rata-rata memiliki .. tinggi tanaman 8.4 cm, nyata lebih tinggi dibanding setek batang (6.9 cm). Pada akhir pengamatan persentase setek hidup setek batang (90.0%) lebih tinggi dibanding setek pucuk (81.7%), walaupm1 secara statistik tidak berbeda nyata. Perlakuan media tanam memberikan pengarub nyata terhadap tinggi tanaman, jumlah daun, jumlah cabang, bobot basah dan kering tajuk, bobot basah dan kering akar dan panjang akar. Penggunaan media tanah + kompos menghasilkan hasil terbaik terhadap semua peubah yang diamati kecuali persentase setek tmnbuh, jumlah daun dan jllllllah akar. Interaksi bahan setek dan media tanam hanya berpengarub nyata terhadap paran1eter jumlah cabang pada 7 dan 8 MST. Pada 8 MST interaksi perlakuan setek pucuk dengan media tanah + kompos rata-rata menghasilkan 7.0 cabang, paling banyak dibandingkan interaksi lainnya. Pembibitan sambm1g nyawa pada penelitian ini dilakukan selama 8 minggu. Berdasarkan hasil pengamatan selama penelitian, pembibitan tanaman sambung nyawa dapat dilakukan 4-6 minggu. Bibit sambung nyawa, baik yang berasal setek pucuk maupun setek batang pada umur tersebut telah mengalami pertumbuban yang cukup baik. Saat 4-6 MST setek batang rata-rata telah menghasilkan 2.5 sampai 2.9 cabang dengan · 14.9 sampai 24.1 daun, sedangkan setek pucuk rata-rata telah mengahasilkan 0.4 sampai 1.5 cabang dengan 8.9 sampai 19 .0 daun.
Keyword: 

Judul: Evaluation of Growth and Production of Sambung Nyawa at Different Harvesting Ages
Abstrak: Penelitian ini bertujuan mengevaluasi pertumbuhan dan produksi sambung nyawa pada umur panen yang berbeda. Penelitian menggunakan Rancangan Acak Kelompok (RAK) dengan 4 kelompok terdiri dari 3 perlakuan. P1= Umur panen 40 hari, P2= Umur panen 50 hari, dan P3= Umur panen 60 hari. Pubah yang diamati meliputi pertumbuhan tanaman (pertumbuhan tinggi, jumlah cabang, dan jumlah daun) dan produksi tanaman (berat segar, berat kering, dan luas daun). Data dianalisis menggunakan ANOVA dan apabila berbeda nyata (p<0,05) akan dilanjut dengan uji Duncan. Hasil penelitian menunjukkan perlakuan perbedaan umur panen mempengaruhi (p<0,05) pertumbuhan tinggi, jumlah daun, berat segar batang, berat segar daun, total biomassa berat segar, berat kering batang, berat kering daun, berat kering pucuk, dan total biomassa berat kering. Perlakuan perbedaan umur panen tidak mempengaruhi (p>0,05) jumlah cabang, luas daun, luas pucuk, dan berat segar pucuk. Hasil penelitian menunjukkan bahwa perlakuan umur panen 60 hari (P3) memberikan hasil terbaik pada pertumbuhan dan produksi biomassa tanaman sambung nyawa., This study aims to evaluate the growth of plant height and plant production with differentharvesting ages. This study used a Randomized Group Design (RAK) with 4 groups consisting of 3 treatments. P1= 40 days harvest age, P2= 50 days harvest age, and P3= 60days harvest age. The variables observed included plant growth (height growth, number of branches, and number of leaves) and plant production (fresh weight, dry weight, and leaf area). Data were analyzed using ANOVA and if significantly different (p<0.05) willbe continued with Duncan test. The results showed that the treatment of different harvestages affected (p<0.05) the growth of height, number of leaves, stem fresh weight, leaf fresh weight, total biomass fresh weight, stem dry weight, leaf dry weight, shoot dry weight, and total biomass dry weight. The treatment of different harvest ages did not affect (p>0.05) the number of branches, leaf area, shoot area, and shoot fresh weight. Theresults showed that the 60-day harvest age treatment (P3) gave the best results on plant growth and plant biomass production.
Keyword: growth, Gynura procumbens, harvesting, harvesting age, production

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