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 A Microfluidic Cotton ClothBased Device for Early Pregnancy Detection from Cattle Milk Samples
Abstrak: Deteksi dini kebuntingan sebagai aspek penting dalam manajemen reproduksi perlu dikembangkan untuk meningkatkan efisiensi reproduksi. Deteksi dini kebuntingan menggunakan reagen tembaga sulfat (CuSO4) sebelumnya belum banyak digunakan dan hanya diuji menggunakan metode tabung standar yang membutuhkan volume sampel dan reagen yang besar. Penelitian ini bertujuan untuk mengembangkan perangkat diagnostik kebuntingan dini pada sapi menggunakan reagen CuSO4 berbasis mikrofluida kain katun dengan indikator jarak panjang cairan. Kain katun dengan dua kali pencucian menghasilkan jarak rembes terjauh dibandingkan dengan tanpa pencucian, pencucian tunggal dan pencucian menggunaan pemutih. Jarak sumbu plasma hamil tua, hamil muda, dan tidak hamil masing-masing adalah 0,74, 1,60, dan 1,90 cm. Selanjutnya, jarak sumbu koagulan hamil tua, hamil muda, dan tidak hamil masing-masing adalah 0,52, 0,80, dan 1,14 cm. Pemberian larutan CuSO4 3% dalam matriks kain katun mampu mendeteksi kehamilan dalam 30 detik. Nilai Limit of Detection (LoD) dan Limit of Quantification (LoQ) plasma susu adalah 0,17 mm dan 0,52 mm. Nilai LoD dan LoQ dari koagulan adalah 0,32 mm dan 0,98 mm., Early detection of pregnancy as an important aspect of reproductive management needs to be developed to improve reproductive efficiency. Early detection of pregnancy using copper sulfate (CuSO4) reagent has not previously been widely used and is only tested using the standard tube method which requires large volumes of samples and reagents. This study aims to develop an early pregnancy diagnostic device in cattle using CuSO4 reagent based on cotton cloth microfluidics with length distance of fluid indicator. Cotton cloth with two washes produced the furthest wicking distance compared to unwashed, single wash and bleach wash. The plasma wicking distance of late pregnant, early pregnant, and non-pregnant were 0.74, 1.60, and 1.90 cm, respectively. Furthermore, the coagulant wicking distance of late pregnant, early pregnant, and non-pregnant were 0.52, 0.80, and 1.14 cm, respectively. The impregnated of 3% CuSO4 solution in cotton cloth matrix able to detect pregnancy in 30 seconds. The Limit of detection (LoD) and Limit of Quantification (LoQ) values of milk plasma were 0.17 mm and 0.52 mm. The LoD and LoQ values of coagulant were 0.32 mm and 0.98 mm.
Keyword: copper sulfate, early pregnancy test, cattle, cotton fabric, microfluidic

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