Judul: Pengaruh pembarian berbagai tarap nitrogen terhadap pertumbuhan vegetatif bambu ampel hijau (Bambusa vulgaris schrader ex wendland) umur 12-20 bulan setelah tanam (BST)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh pemberian berbagai taraf nitrogen terhadap pertumbuhan vegetatif bambu ampel hijau (Bambusa vulgaris Schrader ex Wendland) 12-20 BST. Penelitian dilaksanakan mulai bulan Februari sampai dengan Oktober 1997, di Kebun Percobaan IPB Cikarawang Bogor dengan ketinggian 240 m di atas permukaan laut. Rancangan percobaan yang digunakan adalah Rancangan Acak Kelompok (RAK), terdiri atas empat taraf pemupukan nitrogen dengan empat ulangan. Pupuk nitrogen diberikan dalam bentuk Urea sesuai perlakuan yaitu : 0, 45, 90 dan 135 kg/ha, sedangkan kebutuhan P₂0₅ dan K₂0 diberikan dalam bentuk SP 36 clan KCl dengan dosis masing-masing 150 dan 100 kg/ha. Pemupukan dilaksanakan pada bulan Februari 1997. Pertanaman bambu ampel hijau yang dipupuk berumur 12 BST dengan jarak tanam 6 m x 4 m, dimana pertanaman tersebut telah digunakan untuk penelitian pemupukan sebelumnya (pemupukan tahun pertama) dengan perlakuan taraf nitrogen yang sama (0, 45, 90 dan 135 kg/ha). Pengamatan dilaksanakan pada minggu pertama tiap bulan. Peubah yang diamati terdiri dari jumlah buluh tiap rumpun, diameter buluh (mm), jumlah rehung yang muncul tiap rumpun, dan jumlah rebung total (13-20 BST) yang diperoleh sebagai pemupukan tahun kedua (Februari 1997). Pemanenan contoh rebung dilakukan pada akhir penelitian untuk diarnati panjang, diameter, bobot utuh, dan bobot bersih rebung.
Keyword: 

Judul: Pengaruh Pemupukan Nitrogen dan Pemanenan Rebung pada Bambu Andong (Gigantochloa pseudoarundinacea (Steudel) Widjaja) Umur 38 sampai dengan 46 Bulan SetelahTanam
Abstrak: Penelitian ini bertujuan untuk melihat pengaruh berbagai taraf pemupukan N dan pemanenan rebung pada tanaman bambu andong, serta interaksi antara pemupukan N dengan pemanenan rebung terhadap pertumbuhan bambu andong. Penelitian dilakukan di Kebun Percobaan Bukit Palalangon Darmaga Bogor dengan ketinggian tempat 250 m diatas permukaan laut, dimulai akhir Maret 1998 dan berakhir pada awal bulan Desember 1999. Tanaman bambu yang digunakan adalah tanaman bambu andong (Gigantochloa pseudoarundinacea (Steudel) Widjaja) berurnur 38 BST (Bulan Setelah Tanam) dengan jarak tanam 8 m x 6 m sebanyak 72 rumpun. Rancangan percobaan yang digunakan adalah Rancangan Faktorial dengan rancangan dasar Acak Kelompok (RAK). Faktor pertama adalah taraf pemupukan N (dengan dosis 0,45,90, dan 135 kg N/ha) dan faktor kedua, yakni pemanenan rebung (dipanen 50% setiap rumpun dan tidak dipanen).
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