Judul: Produktivitas rumput gajah (Pennisetum purpureum) di Peternakan ternak domba sehat caringin Bogor sebagai respon pemupukan organik dan nitrogen
Abstrak: The objective of the experiment was to recognize the effect of the.0rgan.c fertilizer (sheep manure) and the anorganic fertilizer (urea) on grass productivity in T e d Domba Sehat Farm Caringin-Bogor. Factorial Completely Randomize Design consisted of two factors by three replications was used in this experiment. First factor consisted of four level of urea (0, 50, 100, and 150 kgha). Second factor are sheep man= fertilizer (0, 10, 15, and 20 tonha). Data was statistically anahzed usiiig ANOVA. When it indicated a significant effect (P<O.O5), the Least Significant Difference was used. Result of research indicated that organic manure ( 10, 15, and 20 tonha) increased production if compared with urea. The addition of manure fertilizer (10, 15, dan 20 tonlha) gave the same effect as those of urea treatment for raising biomassa production. The k t of manure fertilizer (20 tonha) gave the highest 391.4% dry matter production of grass.
Keyword: 

Judul: Pengaruh pemupukan urea dan tingkat penjarangan terhadap produksi rumput gajah, Pennisetum purpureum Schumach
Abstrak: Peningkatan populasi ternak terutama untuk ternak ruminansia harus diimbangi oleh kecukupan dan ketersediaan hijauan sepanjang tahun. Hijauan potongan yang digunakan sebagai pakan domba di Ternak Domba Sehat diantaranya adalah rumput Gajah (Pennisetum purpureum Schumach). Pengembangan hijauan pakan umumnya dilakukan pada daerah yang tingkat kesuburannya rendah, sehingga untuk dapat memenuhi ketersediaan unsur hara dilakukan berbagai macam usaha. Salah satu usaha yang dilakukan adalah dengan pemupukan urea sehingga dapat menyediakan unsur hara esensial yang dibutuhkan bagi pertumbuhan tanaman. Selain usaha pemupukan dilakukan juga penjarangan dengan mengurangi jumlah anakan sehingga akan mengurangi terjadinya persaingan dalam penggunaan unsur hara, air, radiasi matahari dan ruang tumbuh bagi tanaman. Penelitian ini bertujuan untuk mengetahui pengaruh pupuk urea dengan jumlah pemberian yang berbeda dan tingkat penjarangan serta kombinasinya terhadap produksi rumput Gajah. Penelitian dilaksanakan bulan Juli sampai Desember 2005, bertempat di Ternak Domba Sehat (Dompet Dhuafa Republika), Kecamatan Caringin, Bogor dan Laboratorium Agrostologi, Fakultas Peternakan, Institut Pertanian Bogor. Penelitian menggunakan Rancangan Acak Kelompok dengan pola faktorial yang terdiri dari 2 faktor. Faktor pertama adalah jumlah pemberian pupuk urea yang terdiri dari 4 taraf yaitu 0 (UO), 50 (U1), 100 (U2), dan 150 (U3) kg/ha. Faktor kedua adalah penjarngan yang terdiri dari 4 taraf yaitu tanpa penjarangan (PO), penjarangan 5 (P1), 10 (P2) dan 15 (P3) tanaman/rumpun. Peubah yang diamati selama penelitian antara lain tinggi vertikal rumput, jumlah anakan, diameter batang dan produksi berat kering. Teknik pelaksanaan penelitian meliputi pemetakan, penjarangan, pemupukan dan pemanenan. Hasil penelitian menunjukkan bahwa perlakuan U2 dan U3 mampu meningkatkan pertambahan tinggi vertikal. Rataan jumlah anakan yang lebih bagus diperoleh pada perlakuan P1 namun ketika interaksi terjadi pada panen 3 dan 4 maka perlakuan yang bagus adalah perlakuan PO dengan diberi U1, dan P3 tanpa pemupukan namun P3 lebih bagus menggunakan U2 karena akan meningkatkan produksi berat kering.
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