Judul: Pengaruh Pemupukan Nitrogen terhadap Tinggi dan Percabangan Tanaman Teh (Camelia sinensis (L.) O. Kuntze) untuk Pembentukan Bidang Petik.
Abstrak: The objective of this research was to investigate the effect of various dosage of Nitrogen fertilizer on high and branching of tea plant (Camelia sinensis (L.) O. Kuntze). Research was conducted from February until June 2012 at Cikabayan Atas Experimental Station, IPB, Darmaga, Bogor. Experiment consists of one factor, arranged in Randomized Block Design with four replication. The treatments applied were (P0 : 60 kg N/ha; P1 : 120 kg N/ha; P2 : 180 kg N/ha; P3 : 240 kg N/ha). The results showed Nitrogen fertilizer significantly affect plant height in the third week of observation, number of leaves in the ninth until the seventeenth week of observation, the diameter of the stem in the first to the fourth week of observation and sub-branches. P2 treatment (180 kg N / ha) is the best treatment but did not different with P1 treatment. Nitrogen fertilizer did not significantly affect the number of branches, greenness of leaves and a high percentage of plants greater 70 cm.
Keyword: 

Judul: Pengaruh Pupuk Hayati Terhadap Pertumbuhan Dua Klo Tanaman The (Camellia sinesis (L) O. Kuntze) Belum Mengasilkan
Abstrak: Percobaan ini bertujuan untuk mengetahui pengaruh pupuk hayati terhadap pertumbuhan dua k10n tanaman teh belum menghasilkan. Percobaan ini dilakukan mulai bulan Juli sampai dengan bulan November 2000 di Kebun Percobaan Fakultas Pertanian IPB Cikabayan, Darmaga, Bogor. Dalam percobaan ini digunakan Rancangan Petak Terbagi (RPT) dengan 2 faktor perlakuan yang disusun secara faktorial. Sebagai petak utama, jenis k10n yang terdiri atas RB 3 (K1) dan Gambung 5 (K2), sedangkan sebagai anak petak terdiri atas : 6.25 g EMAS + 50 % dosis anjuran pupuk anorganik (d.a.p.a) (PI), 10 ml EN4 + 50 % d.a.p.a (P2), 25 g OST + 50 % d.a.p.a (P3), 20 ml Soils Plus + 50 % d.a.p.a (P4) dan 12.5 g Urea. + 5 g TSP + 5 g KCI (Ps). Dengan demikian terdapat 10 kombinasi perlakuan dan setiap kombinasi perlakuan diulang 3 kali, sehingga seluruhnya terdapat 30 satuan percobaan. Masing-masing satuan percobaan terdiri atas 10 tanaman sehingga jumlah seluruhnya ada 300 tanaman. Peubah yang diamati meliputi tinggi tanaman, jumlah daun, diameter batang, jumlah tunas, panjang tunas, yang diamati setiap dua minggu mulai bulan Agustus sampai dengan bulan November 2000.
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