Judul: Morfologi Sel Darah Merah Itik Manila Yang Dipapar Pada Berbagai Konsentrasi Larutan Nacl Hipotonis
Abstrak: Bentuk sel darah merah dapat dipengaruhi oleh pemberian larutan yang memiliki konsentrasi berbeda. ImageJ dapat dimanfaatkan untuk mengukur perubahan morfologi sel darah merah. Analisis morfologi sel darah merah dilakukan pada 60 sampel darah yang diberi perlakuan NaCl dengan konsentrasi bertingkat (NaCl 0.6%, NaCl 0.7%, NaCl 0.8%, NaCl 0.9%). Sampel natif darah diamati pada menit ke- 2, -4, -6, -8, dan -10. Sel darah merah diamati menggunakan mikroskop dengan perbesaran 40 kali. Data hasil pengamatan diolah menggunakan imageJ untuk menganalisis sirkulariti serta perubahan dimensi. Hasil penelitian memperlihatkan terjadi peningkatan sirkulariti dan nilai dimensi sel darah merah pada konsentrasi 0.6% menit ke-2, konsentrasi 0.7% menit ke-4, dan pada konsentrasi 0.8% pada menit ke-8. Hal ini menggambarkan bahwasanya terjadi perubahan bentuk sel darah merah yang ditandai dengan adanya peningkatan sirkulariti dan dimensi sel darah merah ketika sel darah merah dipapar pada konsentrasi NaCl yang berbeda-beda.
Keyword: ImageJ, Morfologi, NaCl, Sel darah merah, Sirkulariti

Judul: Aplikasi ImageJ untuk Menghitung Perubahan Luas Inti Eritrosit Bebek Akibat Larutan Hipotonis
Abstrak: Pemberian larutan hipotonis dan hipertonis akan mengakibatkan perubahan pada sel darah, seperti perubahan luas inti sel darah merah. Penelitian ini bertujuan mengetahui perubahan luas inti eritrosit akibat pemberian larutan hipotonis secara kuantitatif menggunakan imageJ. Sampel darah diencerkan dengan larutan NaCl konsentrasi 0.6%, 0.7%, 0.8%, dan 0.9%. Sampel darah dibuat preparat ulas dan diwarnai dengan giemsa kemudian diamati di bawah mikroskop dengan perbesaran 920 kali. Gambar eritrosit diambil menggunakan kamera Dino-Eye dan diolah menggunakan imageJ. Hasil penelitian menunjukkan bahwa luas inti eritrosit yang dipapar pada NaCl konsentrasi 0.9% adalah 21.99±2.62 μm2, pada konsentrasi NaCl 0.8% inti eritrosit mengecil menjadi 20.43±2.73 μm2 (p>0.05), pada konsentrasi NaCl 0.7% inti sebesar 17.12±2.70 μm2 (p<0.05), dan pada konsentrasi NaCl 0.6% inti eritrosit menjadi 14.89±2.36 μm2 (p<0.05). Kesimpulan dari penelitian ini adalah pemberian larutan hipotonis terhadap eritrosit bebek mengakibatkan luas inti eritrosit bebek mengecil.
Keyword: Dino-Eye, eritrosit bebek, imageJ, inti eritrosit, larutan hipotonis

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