Judul: Potensi Produksi dan Keragaman Jenis Hijauan Pakan pada Perkebunan Karet untuk Mendukung Peternakan Sapi di Kecamatan Jaro Kabupaten Tabalong.
Abstrak: Kecamatan Jaro merupakan lokasi yang memiliki populasi ternak sapi paling banyak di Kabupaten Tabalong. Penelitian ini bertujuan untuk mengidentifikasi dan menganalisis keragaman hijauan pakan lokal serta mengetahui penyebaran vegetasi dan produksi hijauan pakan yang diberikan kepada ternak sapi pada perkebunan karet di Kecamatan Jaro Kabupaten Tabalong, Kalimantan Selatan. Penelitian ini menggunakan analisis non parametrik dan uji T. Hasil penelitian menunjukan peternak umumnya menggunakan rumput Pennisetum purpureum, Setaria splendida, dan Ottochloa nodosa sebagai pakan utama ternak. Identifikasi ragam jenis tumbuhan berdasarkan tutupan kanopi terdapat beberapa spesies yang mendominasi yaitu Ottochloa nodosa, Axonopus compressus, dan Eleusine indica (L). Produksi bahan kering berkisar 1.46 - 2.21 ton ha-1 tahun-1 dengan tutupan kanopi 0% - 50% sedangkan pada tutupan kanopi 51% - 100% berkisar 1.60 - 2.10 ton ha-1 tahun-1. Kapasitas tampung perkebunan karet Kecamatan Jaro berkisar 0.76 ST - 1.15 ST
Keyword: kapasitas tampung, produksi bahan kering, perkebunan karet, ragam vegetasi

Judul: Potensi Hijauan Pakan Ternak di Perkebunan Karet Kecamatan Warungkiara Kabupaten Sukabumi pada Musim Penghujan
Abstrak: Perkebunan karet memiliki potensi yang sangat besar untuk memenuhi kebutuhan hijauan pakan ternak ruminansia dengan sistem integrasi karet-ternak. Penelitian ini bertujuan mengetahui potensi hijauan pakan ternak di perkebunan karet Kecamatan Warungkiara Kabupaten Sukabumi pada musim penghujan. Metode yang digunakan dalam penelitian ini adalah observasi langsung di lapang terhadap hijauan yang tumbuh di lahan tanpa naungan dan dengan naungan pohon karet pada musim penghujan. Pengambilan sampel dilakukan pada lahan tanpa naungan, lahan karet 9 tahun, lahan karet 13 tahun dan lahan karet 24 tahun. Data dianalisis menggunakan analisis deskriptif. Variabel yang diamati antara lain intensitas cahaya, suhu, kelembaban, pH tanah, kapasitas tampung, produksi bahan kering hijauan pakan identifikasi hijauan dan keanekaragaman hijauan pakan. Hasil menunjukan terdapat 36 spesies yang berpotensi sebagai hijauan pakan. Spesies yang mendominasi antara lain Ottocloa nodosa (Kunth) Dandy, Asystasia gangetica (L.) T. Anderson, Paspalum conjugatum P.J Bergius, dan Ischaemum timorense Kunth. Produksi bahan kering hijauan yang dihasilkan lahan tanpa naungan pada musim penghujan yaitu 4304,00 kg ha-1, lahan karet umur 9 tahun 2802,67 kg ha-1, lahan karet umur 13 tahun 2498,67 kg ha-1 dan lahan karet umur 24 tahun 2272,00 kg ha-1. Kapasitas tampung lahan tanpa naungan sebesar 3,11 ST ha-1, lahan karet umur 9 tahun 2,03 ST ha-1, lahan karet umur 13 tahun 2,41 ST ha- 1 dan lahan karet umur 24 tahun 2,19 ST ha-1.
Keyword: forage, forage production potential, forage vegetation analysis, rubber plantation

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