Judul: Pengaruh Stimulasi Dekamon terhadap Pertumbuhan Awal dan Produksi Dua Jenis Bayam Tahun( Bayam Bangkok dan Bayam Taiwan)
Abstrak: Tujuan penelitian adalah mempelajari pengaruh stimulan Dekamon terhadap perturnbuhan awal dan hasil panen dua jenis bayam tahun (bayam Bangkok dan baym Taiwan). Penelitian dilakukan di rumah kaca Agronorni, Fakultas Pertanian Institut Pertanian Eogor mulai awal Oktober sampai akhir Desember 1984. . Rancangan yang digunakan adalah rancangan acak lengkap yang disusun secara faktorial dengan dua faktor yaitu jenis bayam dan konsentrasi Dekamon. Percobaan pertumbuhan awal terdiri atas 10 ulangan, sedangkan percobaan produksi tiga ulangan. Jenis bayam yang digunaka adalah bayam Bangkok atau Amaranthus racilis(i ll) dan bayam Taiwan atau Amaranthus caudatus ( ~ ~ 1K.on sentrasi Dekamon mencakup lima taraf yaitu: 0.00% (Do), 0 . 0 D l , 0.02% (D2), 0.04% (D3), dan 0.06% (D4). Percobaan pertumbuhan awal, penanaman di pot yang berisi campuran tanah dan pupuk kandang sebanyak 1 kg, dengan perbandingan volume 3:1, dan diberi pupuk dasar 0.6 g Urea, 2.2 g TSP dan 0.8 g k' SO 2 4' Percobaan produksi penanaman di pot yang berisi campuran tanah dan pupuk icandang sebanyak 5 kg dengan perbandingan volume 3:l, dan pupuk dasar yang digunakan 2.5 g Urea, 10 g TSP dan 3.8 g K2S04.
Keyword: 

Judul: Penggunaan pupuk mejemuk sebagai sumber hara pada budidaya bayam secara hidroponik dengan tiga cara fertigasi
Abstrak: Penelitian ini bertujuan untuk mempelajari penggunaan pupuk majemuk sebagai sumber hara pada budidaya bayam secara hidroponik dan mengetahui cara fertigasi yang terbaik dalam meningkatkan pertumbuhan dan produksi bayam. Penelitian dilaksanakan di fasilitas hidroponik Parung Farm, Parung, Bogor yang berada pada elevasi 100 m dpl pada bulan Februari 2006 sampai dengan bulan April 2006. Penelitian dilaksanakan dengan menggunakan Rancangan Acak Kelompok (RAK) berupa percobaan faktorial dengan dua faktor. Faktor pertama adalah jenis larutan hara yang terdiri dari larutan hara A (pupuk AB Mix) dan larutan hara B (pupuk majemuk). Faktor kedua adalah cara fertigasi yang terdiri atas tiga cara fertigasi yaitu fertigasi manual (F1), fertigasi terputus-putus (intermittent) dengan pengatur waktu (F2) dan fertigasi terus-menerus (F3). Terdapat enam kombinasi perlakuan yang diulang sebanyak empat kali sehingga ada 24 satuan percobaan. Setiap satuan percobaan terdiri dari 15 tanaman per talang, maka jumlah total tanaman yang ditanam sebanyak 360 tanaman. Untuk pengamatan dipilih secara acak 5 tanaman contoh dalam setiap ulangan sehingga total tanaman yang diamati sebanyak 120 tanaman.
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