Judul: Kecukupan energi metabolis pakan domba garut betina pada fase perrtumbuhan di Desa Sukawargi Kabupaten Garut
Abstrak: Domba Garut merupakan salah satu jenis domba lokal yang mempunyai potensi untuk dikembangkan. Domba Garut memiliki karakteristik yang lebih baik dibandingkan jenis domba lokal lainnya. Keistimewaannya bisa dilihat dari sifat berproduksi yang bisa melahirkan kembar, ukuran rangka lebih besar dan pertambahan bobot badan yang tinggi. Penelitian ini bertujuan untuk mengetahui kecukupan energi metabolis pakan domba Garut betina pada fase pertumbuhan yang biasa diberikan oleh peternak di Desa Sukawargi, Kabupaten Garut. Penelitian ini dilakukan di Desa Sukawargi, Kabupaten Garut dan dilanjutkan di Laboratorium Makanan Ternak Fapet, IPB. Materi yang digunakan adalah enam ekor domba Garut betina pada fase pertumbuhan berumur 5-6 bulan. Ransum yang diamati adalah semua jenis pakan yang biasa diberikan oleh peternak di Desa Sukawargi. Kandang yang digunakan adalah kandang individual yang dilengkapi dengan alat penampung pakan dan feses. Kecukupan energi Metabolis (ME) diukur berdasarkan prediksi UKASTA, ADAS, COSAC (1985). Hasil percobaan menunjukan ME pakan yang biasa diberikan oleh peternak di Desa Sukawargi telah mencukupi, dengan adanya energi untuk hidup pokok dan energi untuk produksi. Nilai ME yang didapatkan sebesar 9.15±0.62 MJ/hari. Energi untuk hidup pokok (EHP) sebesar 3.34±0.43 MJ/hari dan energi yang tersisa untuk produksi sebesar 5.81±0.99 MJ. Energi yang disimpan untuk pertumbuhan (Eg) sebesar 2.28±0.40 MJ dengan pertambahan bobot badan berdasarkan ukuran tubuh sebesar 79.94±14.05 gram/ekor/hari dan pertambahan bobot badan berdasarkan prediksi UKASTA, ADAS, COSAC (1985) sebesar 148.06±26.89 gram/ekor/hari. Terdapat hubungan antara energi yang disimpan untuk pertambahan bobot badan (Eg) dan protein yang dapat dicerna (DCP) dengan pertambahan bobot badan ternak….
Keyword: 

Judul: . Kecukupan Energi Metabolis Pakan Domba Garut Jantan Pada Fase Pertumbuhan di Peternakan Lesan Putra Kecamatan Ciomas Kabupaten Bogor
Abstrak: The content of metabolizable energy (ME) of feed that fed to Garut finisher ram lambs at Lesan Putra Farm, Ciomas, Bogor were measured to study the energy sufficiency of the lambs. Six growth lambs were used in this experiment. The feed are natural grass and soybean meal curd. The trial on feed was 21 days. The faeces were collected everyday using the faeces collection bags that placed under the metabolism cages. The live weight gain (LWG) of the lamb were compared with the LWG that recommendated by UKASTA, ADAS, COSAC (1985) and also with the LWG standard of the Garut finisher ram lamb using t-test. The parameters measured were feed intake, digestibility, metabolizable energy (ME), LWG and energy for gain (Eg). The result showed that the LWG standard for growth Garut lambs was 75.72 gram/day and was not significantly different (P>0.05) with the LWG of Garut lamb 2, 3, 4 and 6; but was significantly different with Garut lamb 1 (P<0.05) and 5 (P<0.01). The LWG rate of the experiment were 73.73±17.40 gram/day, while the LWG based on Eg 2.22±0.21 MJ were 146.06±12.24 gram/day. This result indicated that the lambs ME needs was sufficient, but the use of ME was not efficient. The lamb LWG of the experiment has appropriate with the LWG standard of the Garut finisher ram lamb.
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