Judul: Blood Metabolites Profile of Composite Sumatera Ewes Fed Flushing Ration
Abstrak: Penelitian ini bertujuan mengevaluasi pengaruh ransum flushing terhadap konsumsi nutrien dan metabolit darah induk domba komposit Sumatera pada fase pra-kawin dan pasca-kawin. Penelitian ini menggunakan 10 ekor domba komposit Sumatera yang telah beranak satu kali (rataan bobot badan 43,41, This research aims to evaluate the effect of flushing ration on nutrient intake and blood metabolites of composite Sumatera ewes at pre-mating and post-mating. This research used 10 composite Sumatera ewes that had given birth once (average body weight 43.41
Keyword: flushing, konsumsi nutrien, pasca-kawin, pra-kawin, reproduksi

Judul: Blood Metabolites of Lamb and Ewes Postpartum with Different Management Flushing Rations
Abstrak: Penelitian bertujuan mengevaluasi kadar metabolit darah anak dan induk domba pasca beranak dengan manajemen pemberian ransum flushing pada fase yang berbeda. Ternak yang digunakan 12 ekor domba betina beranak kedua bobot badan 30,06 ± 6,20 kg dan 18 ekor anak domba bobot lahir 2,49 ± 0,56 kg yang dipelihara bersama induknya sampai umur sapih 60 hari. Penelitian menggunakan Rancangan Acak Kelompok dengan 4 perlakuan dan 3 ulangan. Perlakuan terdiri atas P1 = Tanpa flushing, P2 = Flushing sebelum-setelah kawin, P3 = Flushing sebelum-setelah kawin serta tengah kebuntingan, P4 = Flushing sebelum-setelah kawin, tengah serta akhir kebuntingan. Peubah yang diamati meliputi kadar glukosa, kolesterol, trigliserida dan nitrogen urea plasma. Data dianalisis dengan ANOVA dan dilanjutkan uji lanjut Duncan. Hasil penelitian menunjukan bahwa manajemen flushing yang berbeda tidak berpengaruh nyata terhadap kadar glukosa, kolesterol, trigliserida dan nitrogen urea plasma anak dan induk domba pasca beranak (P>0,05). Dapat disimpulkan bahwa manajemen pemberian ransum flushing pada fase yang berbeda yaitu satu kali (prakawin-awal kebuntingan), dua kali (prakawin-awal dan ditengah kebuntingan), serta tiga kali (prakawin-awal, ditengah dan diakhir kebuntingan) tidak mempengaruhi kadar metabolit darah anak dan induk domba pasca beranak., This study was aimed to evaluate blood metabolites levels of pre-weaning lamb and ewes postpartum with management of flushing rations in the phase different. This research used 12 partus local ewes (body weight 30,06 ± 6,20 kg) and 18 new birth lambs (birth weight 2,49 ± 0,56 kg) kept with their mother until the age of 60 days. A randomized block design with 4 treatments and 3 replications was used in this study. The treatments consisted of P1= without flushing, P2 = flushing before-after mating, P3 = flushing before-after mating, midle of pregnancy, and P4 = flushing before-after mating, midle of pregnancy and end of pregnancy. The levels of blood glucose, cholesterol, triglycerides and BUN were observed. The data were analyzed using ANOVA and followed by Duncan test. Different flushing management had no significant effect on the concentration of blood glucose, cholesterol, triglycerides and BUN of lamb and ewes postpartum (P>0.05). It can be concluded that the management of flushing rations in the phase different, namely one time (pre-mating-early of pregnancy), two times (pre-mating-early and middle of pregnancy) and three time (pre-mating-early, middle and end of pregnancy) does not affect blood metabolites levels of lamb and ewes postpartum.
Keyword: Blood metabolites, local ewes, management flushing, pre-weaning lambs

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