Judul: Analisis glukosa, zat besi dan hemoglobin dalam darah kerbau di rumah potong hewan Kotamadya Bogor
Abstrak: Hasil analisis kadar glukosa dalam darah kerbau didapat data berkisar antara 53,87 mg/100 ml darah sampai 76,80 mg/100 ml darah. Hasil yang didapat ini masih dalam batas - batas normal diabandingkan data pustaka yang ada (berkisar antara 43,9 mg/100 ml darah sampai 73,3 mg/100 ml darah), bahkan beberapa ekor memperliahatkan kadar glukosa yang tinggi. Tingginya kadar glukosa darah ini mungkin oleh faktor stress (sesuai dengan cara pengambilan sampel), mungkin oleh faktor makanan, mungkin oleh umur, dan beberapa kemungkinan faktor lain.
Keyword: 

Judul: Analisis glukosa, zat besi dan hemoglobin dalam darah kerbau di rumah potong hewan Kotamadya Bogor
Abstrak: Masih sedikitnya penelitian-penelitian dasar ternak kerbau di negara Indonesia ini, maka untuk melengkapi data pustaka yang dalam penelitian ini telah dilakukan analisis glukosa, zat besi dan hemoglobin darah kerbau. Hasil analisis kadar glukosa darah kerbau didapat data berkisar antara 53.87 mg/100 ml darah sampai 76.80 mg/100 ml darah. Hasil yang didapat ini masih dalam batas-batas normal dibanding data pustaka yang ada (berkisar antara 43.9 mg/100 ml sampai 79.3 mg/100 ml darah), bahkan beberapa ekor memperlihatkan kadar glukosa yang tinggi. Tingginya kadar glukosa darah ini mungkin oleh faktor stress (sesuai dengan cara pengambilan sampel), mungkin oleh faktor makanan, mungkin oleh umur, dan beberapa kemungkinan faktor lainnya. Hasil analisis kadar zat besi serum didapatkan berkisar antara 79.43 ug/100 ml sampai 184.10 ug/100 ml serum darah, dan terlihat tinggi jika dibanding dengan kadar besi serum sapi yang ada di pustaka (57 ug/100 ml sampai 162 ug/100 ml serum). Tingginya hasil yang didapat ini mungkin karena destruksi sel darah merah dalam proses pemotongan, dan atau mungkin oleh faktor umur, makanan dan kemungkinan faktor lainnya. Tetapi kadar besi serum yang didapat dibandingkan dengan hasil yang didapat oleh Ratmini (1985), dimana dia mendapatkan data berkisar antara 36.74 ug/100 ml sampai 395 ug/100 ml serum untuk hewan yang tidak menderita fassioliasis, masih dalam batas-batas normal. Kadar hemoglobin yang didapat berkisar antara 11.58 gram/100 ml sampai 18.21 g/100 ml. darah, jika dibanding dengan data yang ada di pustaka (9.99 g/100 ml sampai 13.3 g/100 ml darah), ternyata masih dalam batas-batas normal, namun beberapa ekor terlihat tinggi. Adapun kemungkinan yang dapat mempengaruhi tingginya kadar hemoglobin ini, antara lain; mungkin oleh faktor iklim tropis di Indonesia, mungkin oleh makanan dan faktor lainnya.
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