Judul: Karakteristik telur tetas ayam arab betina hasil inseminasi batan dengan pejantan ayam arab, pelung dan wareng Tangeramh
Abstrak: This research was consucted to study the effect of Arab, Pelung and Wareng Tangerang rootster on characteristic hatched egg of Arab hen resulted from artificial insemination. The amount of hen and male birds that used in this research were 18 Arab hen, 5 Arab roosters, 5 Pelung roosters and 5 Wareng Tangerang roosters. The parameters observed were egg sanitary, egg weight, egg index, fertility, hatchability, day-old-chick weight and viability.
Keyword: 

Judul: Fertility Of Arab Chicken Egg Which Resulted From Artificial Insemination With Diffrent Frequency Of Semen Collection
Abstrak: Ayam Arab yang ada di Indonesia sekarang adalah ayam Arab hasil kawin silang dengan ayam lokal yang menghasilkan produksi telur lebih tinggi dibandingkan dengan ayam lokal lainnya. Ayam Arab yang berkembang di Indonesia ada dua jenis, yaitu ayam Arab Silver dan ayam Arab Merah (Golden Red), tetapi yang lebih dikenal di masyarakat adalah ayam Arab Silver. Peningkatan perkembangbiakan ayam Arab memerlukan suatu cara yang efektif untuk meningkatkan populasinya. Percepatan perkembangan usaha ayam Arab dapat dipacu melalui terobosan teknologi inseminasi buatan (IB). Informasi mengenai fertilitas dan daya tetas telur ayam Arab belum banyak diketahui. Fertilitas telur dipengaruhi oleh kualitas sperma dan intensitas pemerahan atau penampungan semen. Oleh sebab itu, perlu dilakukan penelitian mengenai tingkat frekuensi penampungan semen yang paling optimal. Penelitian ini menggunakan 30 ekor ayam Arab betina berumur 33 minggu yang sedang bertelur dan 9 ekor ayam Arab jantan dewasa yang dipelihara dalam kandang individu. Ayam jantan sebanyak 9 ekor dipelihara selama 9 minggu untuk diambil semennya. Perlakuan pada ayam jantan yaitu frekuensi penampungan semen satu kali (A), dua kali (B), dan tiga kali (C) dalam seminggu. Ayam jantan dikelompokan ke dalam tiga kelompok, masing-masing kelompok terdiri dari tiga ekor untuk satu perlakuan. Ayam betina sebanyak 30 ekor dibagi menjadi tiga kelompok yang masing-masing kelompok terdiri dari 10 ekor betina untuk satu perlakuan. Ayam betina dipelihara selama 7 minggu. Semen dari setiap kelompok perlakuan pejantan diinseminasikan kepada 10 ekor betina. Pengumpulan telur dilakukan setiap hari dan telur diberi tanda berupa tanggal dan kode induk. Telur tetas dibersihkan dan difumigasi sebelum siinkubasi ke dalam mesin penetas (inkubator). Peubah yang diamati adalah durasi fertilitas, daya fertil, mortalitas embrio, daya tetas, dan viabilitas DOC. Hasil penelitian menunjukan bahwa frekuensi penampungan semen sangat berpengaruh (P<0,01) terhadap durasi fertilitas. Perlakuan A berbeda pengaruhnya dengan perlakuan B dan C sedangkan perlakuan B dan C memiliki pengaruh yang sama terhadap durasi fertilitas. Tingkat frekuensi penampungan semen yang paling optimal sehingga menghasilkan fertilitas yang tinggi adalah penempungan semen tiga kali seminggu. Durasi fertilitas pada penelitian ini berkisar antara 7,9-9,6 hari. Frekuensi penampungan semen tidak berpengaruh (P>0,05) terhadap daya fertil, mortalitas embrio, daya tetas, dan viabilitas
Keyword: 

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