Judul: Pengaruh penggunaan tepung kertas koran dalam ransum grower (umur 3-4 minggu) untuk mendapatkan pertumbuhan kompensasi pada ayam pedaging
Abstrak: The compensantory growth after livestock went through the limitation on nutrient or the lacking of certain nutrient which followed fed a better diet to increase the growth on the last period. The experiment was conducted to evaluate a compensantory growth technique using newspaper meal in the grower diets on broiler performances.
Keyword: 

Judul: Pengaruh penggunaan tepung kertas koran dalam ransum grower (umur 3-4 minggu) untuk mendapatkan pertumbuhan kompensasi pada ayam pedaging
Abstrak: Pertumbuhan kompensasi merupakan pertumbuhan yang cepat setelah ternak mengalami pembatasan pemberian pakan atau kekurangan zat nutrisi tertentu yang diikuti dengan pemberian makanan yang lebih baik. Pembatasan zat nutrisi untuk mendapatkan pertumbuhan kompensasi bisa dilakukan dengan cara pemberian ransum berserat kasar tinggi. Kertas koran bekas merupakan limbah dengan kandungan serat kasar yang tinggi dan harganya murah. Serat kasar yang tinggi pada kertas koran diharapkan dapat digunakan untuk mendapatkan pertumbuhan kompensasi pada ayam pedaging. Dalam penelitian ini teknik pertumbuhan kompensasi dilakukan dengan pemberian tepung kertas koran pada ransum grower. Penelitian ini bertujuan untuk mengetahui pengaruh teknik pertumbuhan kompensasi dengan menggunakan berbagai taraf tepung kertas koran dalam ransum grower terhadap performa ayam pedaging dan taraf optimum untuk pertumbuhan kompensasi terbaik. Penelitian dilaksanakan pada bulan Maret sampai April 2006 di Laboratorium Lapang Ilmu Nutrisi Unggas, Departemen Ilmu Nutrisi dan Teknologi Pakan, Fakultas Peternakan, Institut Pertanian Bogor. Materi yang digunakan terdiri atas DOC (Day Old Chick) ayam pedaging strain Cobb sebanyak 192 ekor yang dibagi ke dalam 6 perlakuan dan 4 ulangan (8 ekor untuk tiap ulangan). Ayam dipelihara sampai umur 42 hari. Ransum penelitian terdiri atas 6 perlakuan taraf penggunaan tepung kertas koran yaitu: 0%, 5%, 10%, 15%, 20% dan 25%. Rancangan Percobaan yang digunakan adalah Rancangan Acak Lengkap (RAL) dengan 6 perlakuan dan 4 ulangan. Data yang diperoleh dianalisis dengan sidik ragam (Analysis of Variance/ ANOVA) dan jika berbeda nyata dilanjutkan dengan Uji Jarak Duncan. Peubah yang diamati dalam penelitian ini adalah konsumsi ransum, konsumsi protein, konsumsi energi, pertambahan bobot badan, efisiensi penggunaan zat makanan (protein dan energi), konversi ransum. bobot badan akhir dan mortalitas. Hasil yang diperoleh, ternyata penggunaan tepung kertas koran sangat nyata menurunkan konsumsi ransum, konsumsi protein, konsumsi energi, pertambahan bobot badan dan bobot badan akhir, akan tetapi tidak mempengaruhi konversi ransum. Berdasarkan hasil penelitian dapat disimpulkan, bahwa penggunaan tepung kertas koran sebanyak 5% dalam ransum grower bisa digunakan untuk mendapatkan pertumbuhan kompenasi.
Keyword: broiler, performa, pertumbuhan kompensasi

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