Judul: Pengaruh naungan tegakan pohon terhadap pertumbuhan dan produktivitas beberapa tanaman sayuran indigenous
Abstrak: Percobaan ini dilakukan untuk mengetahui pengaruh naungan tegakan pohon terhadap pertumbuhan dan produktivitas beberapa tanaman sayuran indigenous. Percobaan dilaksanakan di Vegetable Garden, University Farm, Darmaga, Bogor mulai Februari 2009 hingga Juni 2009. Penelitian ini menggunakan Rancangan Acak Kelompok (RAK) faktor tunggal dengan 2 taraf naungan : naungan (N1) dan tanpa naungan (N0) dengan 4 ulangan masing-masing untuk 10 spesies tanaman sayuran indigenous sehingga kombinasi perlakuan menghasilkan 80 satuan percobaan pada luasan lahan 600 m2. Ukuran bedeng untuk setiap spesies tanaman sayuran indigenous adalah 5 m x 1.5 m dan jarak antar bedeng 60 cm. Bahan tanaman yang digunakan adalah 10 spesies tanaman sayuran indigenous: Kenikir (Cosmos caudatus), Kemangi (Ocimum americanum), Beluntas (Pluchea indica), Pohpohan (Pilea trinervia), Daun Ginseng (Talinum triangulare), Kedondong Cina (Nothopanax fruticosum), Mangkokan (Nothopanax scutellarium), Terubuk (Saccharum edule), Sambung Nyawa (Gynura procumbens), Katuk (Sauropus androgynus). Benih kenikir dan kemangi disemai pada tray semai selama 3 minggu. Bahan tanaman lainnya diperbanyak dengan cara stek batang. Jarak tanam yang digunakan untuk tanaman beluntas, kenikir, kemangi, poh pohan, terubuk, dan mangkokan adalah 50 cm x 25 cm; jarak tanam untuk tanaman katuk, daun ginseng, sambung nyawa, dan kedondong cina adalah 50 cm x 20 cm.
Keyword: 

Judul: Pengaruh Jarak Tanam Terhadap Produksi Tiga Sayuran Indigenous
Abstrak: The purpose this research was to determine the effect of plant spacing (population) on growth and yield of some indigenous vegetables (kemangi, kenikir, and katuk). The research was conducted at Cikabayan experiment garden in Darmaga, Bogor from April until November 2010. The experiment design was a Randomized Complete Design Group one factor with four treatments plant spacing of population [P1] 25 cm × 13:33 cm (population 300 000 plants/ha), [P2] 25 cm × 16 cm (population 250 000 plants/ha), [P3] 25 cm × 20 cm (population 200 000 plants/ha), and [P4] 25 cm × 26.67 cm (population 150 000 plants/ha), with three replications. Observations included plant height, number of leaves, number of branches, weight yields/plant and weight yield/plot. The result of the experiment showed that plant spacing of kemangi did not influence vegetative growth, weight yields/plant and weight yield/plot. Plant spacing of kenikir influenced number of leaves, number of branches, weigth yields/plant and proned influence weight yield/plot on plan spacing 25 cm × 13:33 cm (population 300 000 plants/ha). Plant spacing of katuk did not influence vegetative growth, weight yields/plant and weight yield/plot.
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