Judul: Faktor-Faktor yang Memengaruhi Kesadaran (Awareness) UMKM terhadap Dana Pensiun (Studi Kasus pada UMKM Kecamatan Citeureup).
Abstrak: Kepemilikan dana pensiun dapat menjamin kesejahteraan bagi pesertanya ketika mereka sudah mencapai usia pensiun, baik untuk pekerja maupun pemilik usaha. Meskipun demikian, belum semua pelaku usaha maupun pekerja dapat menjangkau dana pensiun, termasuk pelaku UMKM. Rendahnya kepemilikan dana pensiun disebabkan rendahnya literasi dan kesadaran (awareness) para pelaku UMKM akan pentingnya dana pensiun. Oleh karena itu, penelitian ini bertujuan untuk menganalisis kesadaran pelaku UMKM di Kecamatan Citeureup terhadap dana pensiun dan faktor-faktor yang memengaruhinya. Kecamatan Citeureup merupakan daerah yang memiliki jumlah UMKM terbanyak di Kabupaten Bogor. Pengumpulan data penelitian dilakukan dengan memberikan kuesioner kepada sampel penelitian. Sampel yang digunakan berjumlah 62 orang pelaku UMKM di Kecamatan Citeureup, Kabupaten Bogor. Metode yang digunakan dalam penelitian ini adalah analisis deskriptif dan regresi logistik. Hasil penelitian menunjukkan bahwa faktor akses informasi, usia, dan pelaku yang menggeluti bidang usaha makanan berpengaruh positif signifikan terhadap kesadaran pelaku UMKM terhadap dana pensiun.
Keyword: awareness, dana pensiun, regresi logistik, UMKM

Judul: Determinant of the Productive Age Awareness towards Sharia Pension Funds in West Java
Abstrak: Pengembangan dana pensiun syariah di Indonesia dapat dilakukan dengan meningkatkan jumlah pesertanya. Jumlah peserta dana pensiun syariah masih tertinggal jauh dibandingkan dana pensiun konvensional, padahal Indonesia merupakan negara dengan jumlah penduduk muslim terbesar di dunia. Jawa barat merupakan provinsi dengan jumlah penduduk muslim dan usia produktif terbesar di Indonesia sehingga memiliki potensi terhadap pertumbuhan dana pensiun syariah. Penelitian ini bertujuan untuk menganalisis faktor-faktor yang memengaruhi kesadaran masyarakat usia produktif terhadap dana pensiun syariah dengan menggunakan sampel sebanyak 100 responden masyarakat usia produktif di Jawa Barat. Pengambilan data dilakukan dengan penyebaran kuesioner secara online lewat sosial media. Penelitian ini menggunakan metode analisis deskriptif dan regresi logistik dengan software SPSS 26. Hasil penelitian menunjukkan bahwa variabel religiusitas, akses informasi, dan persepsi terhadap dana pensiun berpengaruh positif dan signifikan terhadap kesadaran masyarakat usia produktif akan dana pensiun syariah., The development of sharia pension funds in Indonesia can be done by increasing the number of participants. The number of participants in sharia pension funds is still far behind compared to conventional pension funds, even though Indonesia is the country with the largest Muslim population in the world. West Java is the province with the largest population of Muslims and those of productive age in Indonesia, so it has the potential for growth in sharia pension funds. This research aims to analyze the factors that influence the awareness of people of productive age towards sharia pension funds using a sample of 100 respondents from people of productive age in West Java. Data collection was carried out by distributing questionnaires online via social media. This research uses descriptive analysis and logistic regression methods with SPSS 26 software. The results of the research show that the variables of religiosity, access to information, and perceptions of pension funds have a positive and significant effect on the awareness of people of productive age regarding sharia pension funds.
Keyword: dana pensiun syariah, kesadaran, regresi logistik, usia produktif

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