Judul: Penguatan Organisasi Karang Taruna dalam Upaya Memberdayakan Generasi Muda (Studi Kasus di Kelurahan Tengah Kec.Cibinong Kab. Bogor)
Abstrak: Generasi muda adalah bagian dari penduduk dunia yang sangat potensial dan memiliki sumbangan teramat besar bagi perkembangan masa depan dunia. Namun permasalahan sosial yang dialami generasi muda pada saat ini tetap menjadi permasalahan yang tidak pernah habis-habisnya dibicarakan. Terutama permasalahan pengangguran, kenakalan remaja dan putus sekolah.
Keyword: 

Judul: Hubungan antara Faktor-Faktor Komunikasi dengan Kinerja Organisasi Karang Taruna.
Abstrak: Karang taruna tumbuh atas kesadaran dan tanggung jawab sosial masyarakat yang diharapkan mampu menanggulangi masalah kesejahteraan sosial melalui program kerjanya. Namun, sering dijumpai kinerja karang taruna tidak lagi optimal, padahal keberlangsungannya masih dibutuhkan sebagai wadah pengembangan jiwa sosial generasi muda. Tujuan utama tulisan ini adalah menganalisis faktor-faktor komunikasi yang berhubungan dengan kinerja karang taruna sebagai organisasi pemuda desa. Berlandaskan teori jaringan komunikasi DeVito serta solidaritas sosial Durkheim dan Johnson, penelitian dilakukan dengan subjek karang taruna di Desa Sukawening, Dramaga, Bogor. Metode yang digunakan adalah pengumpulan data primer melalui sensus dan wawancara dilengkapi data sekunder. Karang Taruna Sukawening memiliki solidaritas sedang dan kinerja yang cenderung tinggi. Melalui uji korelasi Rank Spearman, diperoleh hasil bahwa seluruh faktor komunikasi berhubungan positif dengan kinerja organisasi secara signifikan, menandakan bahwa jika ingin meningkatkan kinerja Karang Taruna Sukawening maka efektivitas komunikasinya perlu ditingkatkan. Umur sebagai faktor internal individu juga berhubungan negatif secara signifikan dengan kinerja organisasi, artinya semakin muda rata-rata umur anggota semakin tinggi kinerjanya. Solidaritas tidak berhubungan dengan kinerja karang taruna secara signifikan.
Keyword: desa, karang taruna, kinerja organisasi, komunikasi, pemuda

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