Judul: Gambaran Sel Darah Merah Anak Babi (Sus scrofa) Pasca Keadaan Syok Hipovolemik dengan Resusitasi Cairan Kristaloid Normo dan Hipervolemik
Abstrak: Syok merupakan keadaan terjadinya penurunan kemampuan pengangkutan oksigen dan nutrisi ke seluruh jaringan tubuh. Keadaan syok hipovolemik dapat terjadi akibat hilangnya sejumlah besar darah dari dalam tubuh sehingga dapat mempengaruhi variabel sel darah merah pasien. Tujuan dari penelitian ini adalah mengevaluasi gambaran variabel sel darah merah meliputi jumlah sel darah merah, konsentrasi hemoglobin, nilai hematokrit, dan nilai platelet pada anak babi (Sus scrofa) pasca keadaan syok hipovolemik dengan resusitasi cairan kristaloid hipervolemik. Penelitian ini menggunakan sembilan anak babi jantan kastrasi berusia 6–8 minggu. Perlakuan pada babi meliputi pemasangan kateter, induksi syok, resusitasi normovolemik, dan resusitasi hipervolemik. Resusitasi cairan menggunakan cairan kristaloid NaCl 0.9%. Pengambilan sampel darah dilakukan pada saat baseline, pascaresusitasi normovolemik, dan pascaresusitasi hipervolemik. Sampel darah dianalisis menggunakan hematology blood analyzer dan diuji menggunakan T-Paired Sample Test dengan aplikasi SPSS. Hasil evaluasi gambaran sel darah merah anak babi menunjukkan terjadinya anemia pada seluruh babi. Kondisi syok hipovolemik dan resusitasi normo dan hipervolemik menyebabkan penurunan yang signifikan pada seluruh variabel sel darah merah kecuali nilai platelet.
Keyword: kristaloid, hipovolemia, resusitasi cairan, sel darah merah, syok

Judul: Gambaran Parameter Leukosit Anak Babi (Sus scrofa) pada Keadaan Shock Hipovolemik dengan Resusitasi Cairan Kristaloid Normo dan Hipervolemik
Abstrak: Perdarahan yang berat akan menyebabkan shock hipovolemik. Resusitasi cairan dilakukan untuk mengganti volume cairan intravaskular dan meningkatkan curah jantung supaya dapat menggembalikan perfusi jaringan. Penelitian ini bertujuan untuk mengevaluasi gambaran parameter leukosit pada keadaan shock hipovolemik dengan resusitasi cairan kristaloid (NaCl 0.9%) normo dan hipervolemik pada anak babi (Sus scrofa). Sembilan anak babi jantan kastrasi berumur enam hingga sepuluh minggu dengan berat badan 10 kg sampai 20 kg telah digunakan sebagai hewan model shock. Hewan mengalami shock hipovolemik dengan pengambilan darah dari vena jugularis sehingga penurunan mean arterial presurre (MAP) sebanyak 20% dari nilai awal. Setelah shock hipovolemik, resusitasi normovolemik segera dilakukan dan 30 menit kemudian resusitasi hipervolemik dilakukan. Pengambilan sampel darah dilakukan sebanyak tiga kali pada waktu baseline, resusitasi normovolemik dan hipervolemik. Pemeriksaan darah dilakukan dengan menggunakan Erma Hematology Analyzer. Resusitasi cairan kristaloid menggambarkan penurunan yang signifikan pada eosinofil dan monosit serta penurunan yang tidak signifikan pada jumlah leukosit, neutrofil dan limfosit walaupun masih dalam rentang normal.
Keyword: kristaloid, leukosit, NaCl 0.9%, resusitasi cairan, shock hipovolemik

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