Judul: Status NPK Tanah dan Karakteristik Vegetasi di Bawah Beberapa Jenis Tegakan Tanaman di UP3J Jonggol
Abstrak: Tujuan dari penelitian ini untuk mengevaluasi status NPK tanah dan karakteristik vegetasi di bawah beberapa jenis tegakan tanaman di UP3J Jonggol. Penelitian ini merupakan penelitian eksploratif dengan menggunakan analisis deskriptif terhadap status NPK tanah dan karakteristik vegetasi di bawah tegakan sorgum, rumput pakchong, dan indigofera, berdasarkan periode produksi tanaman. Hasil penelitian menunjukkan bahwa kondisi tanah pada lahan sorgum, rumput pakchong, dan indigofera di UP3J Jonggol kering sampai bergenang, berwarna coklat (7,5 YR 4/3) sampai coklat kehitaman (7,5 YR 2/1), dan bertekstur liat halus sampai liat berat. Sifat kimia tanah dari ketiga lahan tersebut yaitu memiliki pH dengan kriteria agak asam (5,90 - 6,50) sampai netral (6,60 - 6,65), C-organik sedang sampai tinggi (2,71 - 4,86), nitrogen rendah sampai sedang (0,18% - 0,46%), fosfor sangat rendah sampai tinggi (7,11 - 50,94 ppm), dan kalium sangat rendah sampai rendah (5,66 -18,93 ppm). Terdapat 32 spesies vegetasi di bawah tegakan sorgum, 21 jenis di bawah tegakan rumput pakchong, dan 19 spesies vegetasi di bawah tegakan indigofera selama periode produksi, dengan keanekaragaman jenis vegetasi di bawah tegakan termasuk sedang. Berdasarkan penelitian yang dilakukan dapat disimpulkan bahwa status NPK tanah di unit UP3J Jonggol, pada lahan sorgum dan rumput pakchong termasuk kategori rendah sampai sedang, sedangkan untuk lahan indigofera termasuk kategori sangat rendah sampai sedang. Beberapa spesies vegetasi yang mendominasi di bawah tegakan sorgum yaitu Mimosa pudica L., Commelina diffusa Burm. f., dan Digitaria sanguinalis (L.) Scop. Spesies vegetasi yang mendominasi di bawah tegakan rumput pakchong yaitu Cyperus rotundus L., Eclipta prostrata (L.) L, dan Allium tuberosum Rottler ex Spreng.. Sedangkan di bawah tegakan indigofera di dominasi Digitaria sanguinalis (L.) Scop., dan Ludwigia palustris (L.) Elliot
Keyword: indigofera, karakteristik, NPK tanah, rumput pakchong, sorgum

Judul: Karakteristik dan Pengawetan Hijauan Pakan Gulma di Sekitar Kebun Rumput Odot (Pennisetum purpureum var. Mott Dwarf) di UP3 Jonggol
Abstrak: Penelitian ini dilakukan di Unit Pendidikan dan Penelitian Jonggol, Kabupaten Bogor yang bertujuan untuk mengukur potensi hijauan pakan rumbah dan karakteristiknya di sekitar perkebunan rumput odot UP3J serta kualitas fisik rumbah yang diolah menjadi silase untuk pakan ternak. Metode yang digunakan dalam penelitian ini adalah metode observasi langsung di lapangan dan pengambilan sampel hijauan yang tumbuh di lokasi dan data yang diperoleh diolah menggunakan analisis deskriptif. Variabel yang diamati meliputi intensitas cahaya, suhu, kelembaban, pH tanah, warna tanah, tekstur tanah, identifikasi hijauan, keanekaragaman hijauan pakan, kualitas silase, dan palatabilitas silase. Hasil penelitian menunjukkan bahwa potensi hijauan pakan di sekitar kebun rumput odot UP3J Jonggol terdiri dari 12 spesies hijauan. Kekayaan jenis pada kebun rumput odot tergolong rendah dengan nilai 1,40 namun memiliki kemerataan jenis yang tinggi dengan nilai 0,74. Kebun rumput odot 1 memiliki nilai kapasitas tampung yang lebih besar yakni sebesar 0,93 ST Ha-1 Tahun-1. Rumbah yang diolah menjadi silase memiliki kualitas fisik yang kurang baik sehingga masih belum bisa digunakan untuk ternak.
Keyword: forage, rumbah, silage, UP3J

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