Judul: Keragaan Konsumsi Pangan dan Kadar Mineral Besi (Fe) dan Seng (Zn) dalam Serum Darah Ibu Hamil
Abstrak: Penelitian ini bertujuan untuk mempelajari keragaan konsumsi pangan dan kadar mineral besi (Fe) dan seng (Zn) dalam serum darah ibu hamil. Secara khusus penelitian ini bertujuan untuk mengetahui karakteristik ibu hamil, menilai konsumsi energi dan zat gizi (protein, Fe, Zn, Cu dan vitamin C), mempelajari konsumsi pangan ibu hamil, dan mengetahui kadar dan status besi (Fe) dan seng (Zn) dalam serum darah ibu hamil.
Keyword: 

Judul: Hubungan Asupan Daging Terhadap Serum Besi, Total Iron Binding Capacity dan Saturasi Transferin Pada Wanita Hamil.
Abstrak: Kehamilan adalah masa pertumbuhan dan perkembangan janin dan terbagi menjadi 3 trimester. Setiap trimester kehamilan kebutuhan nutrisi terutama zat besi mengalami peningkatan yang signifikan. Penelitian ini dilakukan untuk menentukan hubungan antara asupan daging dengan serum besi, Total Iron Binding Capacity (TIBC), dan saturasi transferin pada wanita hamil trimester 2 dan 3. Pola makan daging dibagi menjadi 5 kelompok, yaitu satu kali seminggu, dua kali seminggu, tiga kali seminggu, jarang, dan tidak pernah. Parameter yang digunakan dalam penelitian ini adalah Serum besi, TIBC, dan saturasi transferrin. Metode yang digunakan adalah kolorimetri. Hasil menunjukan rerata kadar serum besi dan saturasi transferrin paling tinggi pada kelompok yang mengkonsumsi daging tiga kali seminggu, yaitu 89.12 μg/dl dan 22.05%, berbeda nyata dengan kelompok yang tidak pernah makan daging yaitu 55,21 μg/dl dan 12.69% (P<0.05). Hasil menunjukan rerata kadar TIBC paling tinggi pada kelompok jarang mengkonsumsi daging yaitu 458.55 μg/dl dan yang paling rendah pada kelompok yang mengkonsumsi daging tiga kali seminggu yaitu 415.75 μg/dl (P>0.05). Hasil penelitian ini menujukan adanya pengaruh asupan daging terhadap kadar serum besi dan saturasi transferin.
Keyword: Daging, kehamilan, saturasi transferin, serum besi, TIBC

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