Judul: Berat badan/tinggi badan, kadar hemoglobin, tekanan darah dan denyut nadi pada remaja
Abstrak: Tujuan umum penelitian ini adalah untuk mengetahui keterkaitan dua indikator status gizi yaitu berat badan/ tinggi badan dan kadar hemoglobin terhadap tekanan darah dan denyut nadi pada remaja putri. Tujuan khususnya ada- lah untuk mengetahui konsumsi zat gizi, berat badan/tinggi badan, kadar hemoglobin, tekanan darah dan denyut nadi, hubungan antara konsumsi zat gizi dengan kadar hemoglobin, hubungan berat badan/tinggi badan dengan kadar hemoglobin, hubungan antara berat badan/tinggi badan dengan tekanan darah, hubungan antara kadar hemoglobin dengan tekanan darah, dan hubungan antara kadar hemoglobin dengan denyut nadi. Penelitian dilaksanakan di SMKK Padang, dari bulan Juli sampai Agustus 1995. Data yang dikumpulkan terdiri dari data primer dan data sekunder. Data konsumsi dikumpulkan dengan metode recall, dan dikonversi menggunakan program food processor. Kadar Hb diukur dengan menggunakan metode Sahli. Sedangkan tekanan darah dan denyut nadi diukur dengan blood pressure digital. Untuk mengetahui hubungan antar variabel yang dilakukan dengan program komputer Microstat digunakan analisis korelasi Spearman.
Keyword: status gizi

Judul: Hubungan antara konsumsi pangan, status gizi dengan tekanan darah
Abstrak: Tujuan penelitian ini adalah untuk mengetahui hubungan antara konsumsi pangan dan status gizi siswa SLTA, mengetahui hubungan antara konsumsi pangan dengan tekanan darah, mengetahui hubungan antara status gizi dengan tekanan darah, dan mengetahui hubungan antara status gizi dengan pen- dapatan keluarga. Penelitian dilakukan di SMA Regina Pacis Bogor pada bulan Juni 1995. Data yang dikumpulkan merupakan data primer yang meliputi identitas keluarga, pendapatan dan uang saku siswa, identitas dan ukuran antropometri responden, riwayat kesehatan orang tua dan siswa, kebiasaan makan dan kebiasaan lain yang berkaitan dengan kesehatan siswa, aktivitas fisik, dan konsumsi pangan siswa. Data ini diperoleh dengan cara wawancara menggunakan kuesioner. Analisis data konsumsi dilaksanakan secara manual. Kecukupan energi dan protein dihitung berdasarkan kecukupan masing-masing individu (Hardinsyah & Martianto, 1989). Tingkat konsumsi lemak, zat besi, vitamin A, dan vitamin C dihitung berdasarkan kecukupan per orang per hari (Muhilal, Jus'at, Husaini, Djalal, & Tarwotjo, 1993). Status gizi siswa dihitung berdasarkan rumus TB/U dan BMI. Analisis hubungan antar peubah digunakan uji regresi berganda dan linier.
Keyword: status gizi

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