Judul: Pengaruh Konsentrasi Dan Waktu Aplikasi Pupuk Organik Cair Bioton Terhadap Pertumbuhan Dan Produksi Pucuk Teh (Camellia Sinensis (L.) O. Kuntze)
Abstrak: Percobaan ini bertujuan untuk mengetahoi pengaruh konsentrasi dan waktu aplikasi pupuk organik cair (POC) Bioton terhadap pertumbuhan dan produksi pucuk tanaman teh. Percobaan ini dilakukan di Perkebunan Gedeh PTP Nusantara VIII Cianjur, pada bulan Maret 2002 sampai dengan bulan Juni 2002.
Keyword: 

Judul: Pengaruh konsentrasi dan waktu penyemprotan pupuk daun happy GRO terhadap pertumbuhan tanaman teh, Camellia sinensis (L.) O. Kuntze
Abstrak: Percobaan ini dilakukan untuk mengetahui pengaruh pemberian pupuk daun Happy Gro dalam berbagai taraf konsentrasi dan waktu penyemprotan terhadap pertumbuhan tanaman teh (Camellia sinensis (L.) O. Kuntze). Percobaan dilakukan di Kebun Teh Gunung Mas, PTP Nusantara VIII, Cisarua, Bogor, Jawa Barat. Percobaan menggunakan Rancangan Petak Terbagi (RPT) dengan dua faktor. Petak utama adalah pemberian pupuk daun Happy Gro dengan 3 taraf konsentrasi yaitu K₁ = 0.5 ml/l, K₂ = 1 ml/l dan K3 = 1.5 ml/l. Sedangkan sebagai anak petak yaitu waktu penyemprotan masing-masing W₁ = penyemprotan dilakukan sehari setelah pemetikan, W₂ = penyemprotan dilakukan 3 hari setelah pemetikan dan W3 = penyemprotan dilakukan 5 hari setelah pemetikan. Terdapat 9 kombinasi perlakuan dengan 3 ulangan. Setiap satuan percobaan terdiri atas 5 tanaman contoh sehingga terdapat 135 tanaman. Sebagai pembanding digunakan petakan dengan konsentrasi 1.0 ml/l (K2). Tanaman teh dipetik dengan daur 12 hari sekali. Hasil panen kemudian dipisahkan berdasarkan masing-masing petak percobaan. Pucuk yang dipanen kemudian dianalisis. Hasil percobaan menunjukkan bahwa pemberian pupuk daun Happy Gro berpengaruh nyata terhadap beberapa peubah yang diamati seperti jumlah pucuk peko, jumlah pucuk burung, jumlah pucuk total, dan bobot total pucuk. Tetapi tidak berpengaruh nyata terhadap peubah bobot rata-rata pucuk. Waktu penyemprotan hanya berpengaruh terhadap jumlah peko dan jumlah total pucuk pada daur petik ke 6. Interaksi antara konsentrasi pupuk dan waktu penyemprotan tidak berpengaruh terhadap semua peubah pengamatan. Peubah jumlah peko, jumlah burung, jumlah total pucuk, dan bobot total pucuk tertinggi dihasilkan oleh perlakuan pupuk daun Happy Gro dengan konsentrasi 1.5 ml/l. Percobaan juga menujukkan bahwa waktu penyemprotan 1 HSP memberikan hasil rata-rata terendah pada semua daur petik. Sedangkan waktu penyemprotan 3 HSP menunjukkan hasil rata-rata tertinggi hampir pada semua daur petik.
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