Judul: Potensi Propolis untuk Menurunkan Stres Cekaman Panas pada Burung Puyuh (Coturnix-coturnix Japonica).
Abstrak: Propolis diketahui mempunyai kandungan flavanoid yang tinggi. Flavanoid merupakan zat yang banyak terdapat pada tumbuh-tumbuhan dan mempunyai efek antioksidan dalam melumpuhkan radikal bebas. Kandungan vitamin A, B1 dan B6 pada propolis dapat menstabilkan pelaksanaan metabolisme dalam tubuh sehingga metabolisme berjalan dengan baik dan produksi telur menjadi optimal. Penelitian ini bertujuan untuk mengetahui efektifitas pemberian propolis dengan dosis bertingkat dalam memperbaiki performa burung puyuh yang mengalami stres akibat pemberian cekaman panas. Sebanyak 20 ekor puyuh betina berumur 2 bulan dibagi menjadi 4 kelompok, yaitu kelompok yang hanya diberi suhu panas 35oC dan kelompok yang diberi propolis per oral dengan dosis masing-masing 0.176ml/168gBB, 0.352ml/168gBB dan 0.704ml/168gBB. Hasil penelitian menunjukan bahwa pemberian propolis dapat mempengaruhi kondisi puyuh. Pemberian propolis relatif memberikan pengaruh terhadap rata-rata jumlah leukosit, heterofil, limfosit dan monosit serta menurunkan rasio heterofil-limfosit. Puyuh yang diberi propolis menunjukan peningkatan produksi telur, kualitas telur dan konsumsi pakan.
Keyword: cekaman panas, propolis, puyuh (Coturnix-coturnix Japonica)

Judul: Potensi Propolis Sebagai Imunostimulan pada Burung Puyuh (Coturnix coturnix Japonica) yang Diberi Metilprednisolon
Abstrak: Propolis memiliki kandungan berupa flavonoid, Caffeic Acid Phenethyl Ester (CAPE), protein, vitamin dan mineral yang bermanfaat sebagai antioksidan, antiinflamasi, antibakteri, antitumor, dan imunostimulan. Penelitian ini bertujuan untuk mengetahui pengaruh pemberian propolis terhadap burung puyuh yang mengalami stres oksidatif akibat pemberian metilprednisolon. Penelitian ini menggunakan 25 ekor burung puyuh betina yang berumur 20 minggu dan dibagi menjadi 5 kelompok perlakuan masing-masing 5 ekor yaitu, kelompok M adalah puyuh yang diberi metilprednisolon, kelompok M+P1, M+P2, M+P3 adalah puyuh yang diberi metilprednisolon dan propolis 0.58 mg/168 gram, 1.16 mg/168 gram, 2.32 mg/168 gram, dan kelompok P4 puyuh yang diberi propolis 0.58 mg/168 gram. Pemberian Propolis memberikan pengaruh nyata terhadap konsumsi pakan, bobot badan, produksi telur, kualitas telur, jumlah leukosit, limfosit, dan rasio heterofil/limfosit. Pengaruh yang tidak berbeda nyata terlihat pada jumlah heterofil dan monosit. Berdasarkan hasil penelitian, dapat disimpulkan bahwa pemberian propolis dosis 2.32 mg/168 gram dapat memperbaiki performa burung puyuh akibat stres oksidatif pemberian metilprednisolon.
Keyword: propolis, imunostimulan, metilprednisolon, stres oksidatif.

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