Judul: Usia Reproduksi Wanita Suku Tengger, Desa Wonokitri, Provinsi Jawa Timur.
Abstrak: Pubertas adalah masa transisi dari masa kanak-kanak ke masa dewasa yang ditandai oleh perubahan kemampuan dan perkembangan reproduksi. Perubahan paling penting dalam pubertas wanita adalah berkembangnya payudara dan menstruasi pertama. Ada dua komponen utama dalam reproduksi wanita yaitu menstruasi pertama (menarche) dan akhir menstruasi (menopause). Menstruasi pertama (menarche) pada wanita menandai terjadinya pubertas sementara itu menopause adalah suatu keadaan saat sudah tidak adanya ovulasi dan siklus menstruasi dalam kurun waktu lebih dari satu tahun. Bervariasinya angka jangka reproduksi antara wanita di berbagai negara dan etnis menyebabkan perlunya informasi lebih banyak tentang jangka reproduksi dari daerah lainnya. Suku Tengger adalah salah satu suku yang tinggal di sekitar Gunung Bromo, Jawa Timur, Indonesia. Penelitian ini bertujuan untuk mengetahui jangka reproduksi wanita suku Tengger. Data dikumpulkan dari hasil wawancara dengan 141 wanita. Semua data dianalisis dengan menggunakan histogram dalam program R 3.4. Jangka reproduksi diperoleh dari saat usia menarke dan usia menopause. Jangka reproduksi wanita suku Tengger adalah 35,9 tahun. Usia rata-rata saat menarke adalah 13,61 tahun. Sedangkan rata-rata usia menopause alami adalah 49,51 tahun.
Keyword: jangka reproduksi, menarke, menopause, pubertas

Judul: Jangka Reproduksi Wanita Suku Baduy, Kabupaten Lebak, Provinsi Banten
Abstrak: Humans grow and develop into a child, adolescent, adult, and aging. Condition who switch from the children phase to teen or young adult phase is called puberty. First menstruation (menarche) in women marking the occurrence of puberty. The women reproductive phase begin with menarche and end at the time of menopause. Menopause is a condition which there is no ovulation and the menstrual cycle. The lead time from puberty until menopause is called the reproductive period of women. Knowing the reproductive period of women is very close with to the nature of women to become pregnant. Baduy tribe was chosen as the comparative with previous studies. Due to, they live outside of alienating themselves from society, the marriage happens his fellow man, not getting an education, and still maintain customs. This study used longitudinal method, the status quo method, and memory method. Data was collected from interviews. The data was processed using the Probit GLM (Generalized Linear Models) in R program. The result showed that menopausal age was 48.64 years, menarche age was 14.97 years (year 1976). The reproductive period was limited by the age of menarche and menopause obtained for 33.67 years.
Keyword: 

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