Judul: Studi Patogenesis Infark Jantung Pada Beruang Coklat (Ursus Arctos).
Abstrak: Penelitian ini bertujuan untuk mengetahui patogenesis infark miokardium pada beruang coklat (Ursus arctos) betina berusia 39 tahun dengan pengamatan secara makroskopis dan mikroskopis. Pengamatan mikroskopis dilakukan dengan menggunakan pewarnaan hematoksilin-eosin (HE) dan Masson’s Trichrome (MT). Hasil pemeriksaan makroskopis menunjukkan bahwa secara umum mukosa terlihat pucat. Pengamatan makroskopis lainnya menunjukkan adanya pneumonia interstitial dan edema pulmonum, peradangan kataralis dan hemoragi pada saluran pencernaan, adanya kista dan perdarahan pada ovarium kanan, deplesi pulpa putih pada limpa, kongesti dan nekrosis multifokal pada hati, nefritis interstitial dan infark pada ginjal, serta infark multifokal pada jantung. Pengamatan histopatologi menunjukkan adanya kongesti dan degenerasi hidropis disertai nekrosis multifokal pada hepatosit, deplesi pulpa putih dan splenitis pada limpa, nefritis interstitial kronis disertai infark dan pembentukan kolagen pada ginjal, serta infark multifokal, degenerasi dan vaskulitis pada miokardium. Gambaran histopatologi menggunakan pewarnaan Masson’s Trichrome menunjukkan bahwa beberapa daerah miokardium telah digantikan oleh jaringan fibrosis dan kolagen. Nefritis interstisialis pada ginjal diduga menjadi faktor predisposisi pembentukan iskemik dan infark miokardium.
Keyword: Beruang coklat, infark, makroskopis, mikroskopis, miokardium

Judul: Electrocardiogram of Pigs (Sus scrofa domestica) as Animal Model Candidate of Artificial Myocardial Infarction
Abstrak: Penelitian ini bertujuan mengetahui perubahan aktivitas listrik jantung akibat infark miokardium pada hewan model babi (Sus scrofa domestica) menggunakan elektrokardiografi (EKG). Pengambilan data dilakukan pada tiga ekor babi jantan dengan umur 4-5 bulan. Perekaman data EKG dilakukan sebelum dan setelah prosedur operasi pembuatan infark miokardium pada babi. Parameter yang diamati adalah durasi P, amplitudo P, interval PR, interval QRS, amplitudo R, amplitudo T, interval QT, segmen ST, dan frekuensi denyut jantung yang direkam pada sadapan II. Data yang diperoleh dianalisis menggunakan uji paired sample T test dan dinyatakan dalam nilai rata-rata serta standar deviasi. Hasil rekaman EKG menunjukkan adanya perbedaan nyata pada parameter interval PR, gelombang T, interval QT, segmen ST, dan frekuensi denyut jantung. Hal ini menunjukkan bahwa kondisi infark miokardium mempengaruhi konduksi listrik atau aktivitas kelistrikan jantung.
Keyword: animal model, electrocardiogram, myocardial infarction, Sus scrofa domestica

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