Judul: Development Yarn, Nylon, and Cotton-based Microfluidic Device for Hematocrit Assay in Pregnant Ewes Dehydration and Septicemia Models
Abstrak: Mikrofluida merupakan media transpor cairan dalam skala mikro. Perangkat mikrofluida berbasis benang memiliki prinsip kerja kapilaritas. Perangkat mikrofluida berbasis benang telah banyak diterapkan dalam teknologi biomedis untuk membantu perkembangan alat diagnosis. Perangkat mikrofluida berbasis benang rajut, nilon, dan katun dikembangkan untuk menilai hematokrit domba betina bunting. Sampel darah dikoleksi dari masing-masing kelompok domba yaitu jantan (n=3), betina tidak bunting (n=3), betina bunting (n=3). Sampel darah yang telah dikoleksi diberikan tiga perlakuan yaitu peningkatan konsentrasi (model dehidrasi), tanpa perlakuan (model normal), dan pengenceran (model septicemia). Hasil penelitian menunjukkan kondisi dehidrasi memiliki nilai hematokrit yang tinggi dan kondisi septicemia memiliki nilai hematokrit yang rendah. Nilai hematokrit dapat dibaca setelah darah merembes pada benang hingga 2 menit. Nilai hematokrit dengan standar laboratorium memiliki hubungan yang berbanding terbalik dengan panjang rembesan darah pada perangkat mikrofluida. Nilai R 2 menunjukkan kesesuaian hasil hematokrit pada perangkat mikrofluida dengan standar laboratorium yaitu pada benang rajut 0,945, nilon 0,757, dan katun 0,951. Sampel darah yang akan digunakan untuk mendapatkan nilai hematokrit sebaiknya tidak lebih dari 48 jam setelah pengambilan.
Keyword: anemia, ewe, hematocrit, microfluidics, pregnancy

Judul: Development of Cotton-based Microfluide  Device for Assessment of Hematocrit in Pregnant Ewes, Dehydration and  Septicaemia Models
Abstrak: Perubahan metabolik dapat disebabkan oleh berbagai kondisi dan fase fisiologis, seperti perubahan profil darah pada kondisi kebuntingan atau kondisi patologis lainnya seperti septicaemia. Pemeriksaan darah lengkap biasa dilakukan untuk mengetahui status kesehatan hewan atau untuk mendukung diagnosis. Salah satu pemeriksaan darah adalah pemeriksaan kadar hematokrit. Pengembangan alat mikrofluida untuk menilai kadar hematokrit pada penelitian ini dikembangkan menggunakan kain katun berdasarkan panjang rembesan darah. Sebanyak 3 kelompok darah domba (jantan n=2, bunting n=2, dan tidak bunting n=2) dimanipulasi menjadi 3 kondisi yaitu pengenceran, normal, dan peningkatan konsentrasi, kemudian panjang rembesan dan kadar hematokrit. diukur. Pengaruh penyimpanan darah terhadap kadar hematokrit juga diuji dengan menyimpan darah pada hari ke 0, 2, 4, dan 7. Hasil penelitian menunjukkan bahwa terdapat perbedaan panjang rembesan pada masing-masing sampel darah. Jarak terjauh diperoleh pada kondisi pengenceran. Sementara, jarak terpendek diperoleh pada peningkatan konsentrasi. Pengaruh penyimpanan darah terhadap kadar hematokrit menunjukkan penurunan pada hari ke-7 pada pengukuran dengan menggunakan alat mikofluida di semua sampel darah dan hari ke-4 pada tabung mikrokapiler hematokrit pada sampel darah jantan dan tidak bunting. Sementara, pada sampel darah bunting, kadar hematokrit cenderung stabil. Pengembangan alat mikofluida berbasis kain katun mampu mengukur nilai kadar hematokrit sehingga menjadi bahan pertimbangan sebagai alat diagnostik untuk menilai hematokrit., Metabolic changes can be caused by various physiological conditions and phases, such as changes in blood profile in pregnancy or other pathological conditions such as septicemia. Complete blood count is usually done to determine the health status of the animal or to support the diagnosis. One of the blood tests is the examination of hematocrit levels. The development of a microfluidic device to assess the hematocrit level in this research was developed using cotton cloth based on the wicking length of blood. A total of 3 groups of sheep's blood (male n=2, pregnant n=2, and not pregnant n=2) were manipulate in to 3 conditions, namely dilution, normal, and increasing concentration, and then the wicking length and hematocrite level measured. The effect of blood storage on hematocrit levels was also tested by storing blood on days 0, 2, 4, and 7. The results showed that there were differences in the length of wicking in each blood sample. The longest was obtained in the dilution condition. However, the shortest was obtained at increasing concentration. The effect of blood storage on hematocrit levels showed a decrease in day 7 on measured by using the microfluidic device in all blood samples and day 4 on microcapillary hematocrit tubes in male and non-pregnant blood samples. However, in pregnant blood samples, hematocrit levels tended to be stable. The development of a microfluidic device based on cotton cloth is able to measure the value of the hematocrit level so that it becomes a consideration as a diagnostic tool to assess the hematocrit.
Keyword: kain katun, anemia, hematokrit, domba, cotton cloth, anemia, hematocrit, sheep

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