Judul: Potensi usaha peternakan ayam cemani (studi kasus peternakan ayam cemani di Temanggung)
Abstrak: Ayam cemani merupakan jenis ayam lokal yang mempunyai karakteristik tertentu dan berasal dari daerah kedu, kabupaten Temanggung, propinsi Jawa Tengah dan merupakan ayam hias lokal asli indonesia. Populasi ayan cemani saat ini cenderung menurun, karena naiknya biaya produksi serta angka kematian ayam yang cukup tinggi. Data dari dinas peternakan kabupaten Temanggung pada tahun 2002 populasi ayam kedu hanya berjumlah 11.556 ekor dari 1.500.415 ekor ayam buras yang ada, atau hanya sekitar 0,77 persen.
Keyword: 

Judul: Sifat-sifat reproduksi ayam pelung di Kecamatan Cibeber dan Kecamatan Gekbrong Cianjur,Jawa Barat
Abstrak: Ayam Pelung adalah salah satu ayam lokal asli Indonesia yang memiliki keistimewaan pada suara kokoknya, khususnya pada ayam jantan, yang bersuara panjang, merdu dan berirama. Bobot badannya yang besar berpotensi sebagai ayam penghasil daging. Penelitian ini bertujuan mempelajari sifat dan potensi reproduksi ayam Pelung di Kabupaten Cianjur sehingga dapat dijadikan informasi dasar seleksi pada ayam Pelung. Penelitian dilakukan pada awal bulan Juni sampai dengan akhir bulan September 2006, berlokasi di Kecamatan Cibeber dan Kecamatan Gekbrong, Kabupaten Cianjur. Penelitian ini menggunakan ayam Pelung sebanyak 289 ekor yang terdiri dari 40 ekor jantan dewasa, 36 ekor betina dan 73 ekor DOC di Kecamatan Cibeber, 43 ekor jantan dewasa, 38 ekor betina, serta 59 ekor DOC di Kecamatan Gekbrong. Sifat-sifat reproduksi yang diamati dan dianalisis antara lain bobot telur tetas, ukuran telur tetas (panjang dan lebar), indeks telur, bobot tetas, produksi telur dalam satu periode bertelur, daya tetas telur, mortalitas anak, nisbah kelamin dan lama periode bertelur. Data yang diperoleh ditabulasi dan dilakukan analisis statistik, serta disajikan secara deskriptif dan statistik dalam bentuk tabel dengan menggunakan perangkat lunak komputer Minitab V 14.
Keyword: ayam Pelung, sifat-sifat reproduksi, indeks telur, Mortalitas dan penyakit

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm