Judul: Komodifikasi upacara tradisional seren taun dalam pembentukan identitas komunitas: studi kasus Kampung Budaya Sindangbarang, Desa Pasireurih, Kecamatan Tamansari, Kabupaten Bogor, Jawa Barat
Abstrak: Upacara tradisional sebagai salah satu unsur kebudayaan yang dimiliki oleh komunitas merupakan unsur yang dapat menggambarkan sejauh mana komunitas menjaga eksistensi identitasnya. Hal ini dapat dijelaskan bahwa dalam upacara tradisional dimungkinkan akan terlihat seluruh anggota komunitas ikut serta dalam melaksanakan upacara tradisional. Berdasarkan hal tersebut maka penting adanya untuk meneliti upacara tradisional dengan berbagai aspek perubahannya dan komodifikasi budaya dalam hubungannya dengan pembentukan identitas komunitas. Hingga kini Kampung Budaya Sindangbarang memiliki daya tarik tersendiri bukan saja sebagai kampung adat, melainkan juga sebagai salah satu tempat alternatif wisata para wisatawan domestik dan mancanegara.
Keyword: 

Judul: The correlation between local leadership style and community social capital in the seren taun traditional ceremony (case: Sindangbarang cultural village, pasir eurih, Tamansari district, Bogor regency, west java)
Abstrak: Kampung Budaya Sindangbarang adalah sebuah kampung adat tradisional yang terletak di Desa Pasir Eurih, Kabupaten Bogor. Kampung Budaya Sindangbarang mempunyai beragam kegiatan wisata yang ditawarkan, dan di Kampung Budaya ini masih rutin diadakannya upacara Seren Taun yaitu sebuah upacara adat untuk mengungkapkan rasa syukur kepada Yang Mahakuasa atas hasil panen. Penelitian ini bertujuan untuk menganalisis hubungan kepemimpinan lokal terhadap modal sosial masyarakat pada kegiatan upacara Seren Taun di Kampung Budaya Sindangbarang. Metodologi yang digunakan melibatkan teknik survei dengan 50 responden yang dipilih secara simple random sampling. Uji korelasi digunakan untuk menilai hubungan antar variabel yang terlibat dalam penelitian ini. Hasil dari penelitian ini menyimpulkan bahwa terdapat hubungan tingkat kepemimpinan lokal yang signifikan dengan derajat keberfungsian modal sosial masyarakat. Hubungan ini tercipta karena kepemimpinan lokal yang dapat mempertahankan keberadaan upacara Seren Taun melalui pengambilan keputusan dan perencanaan yang tepat., Sindangbarang Cultural Village is a traditional traditional village located in Pasir Eurih Village, Bogor Regency. Sindangbarang Cultural Village has a variety of tourist activities on offer and in this Cultural Village the Seren Taun Ceremony is still regularly held, namely a traditional ceremony to express gratitude to the Almighty for the harvest. This research aims to analyze the correlation between local leadership and community social capital in activities Seren Taun Ceremony at Sindangbarang Cultural Village. This research uses a quantitative approach supported by a qualitative approach. The methodology used involves survey techniques with 50 respondents selected using simple random sampling. The correlation test was used to assess the correlation between the variables involved in this research. The results of this research conclude that there is a positive relationship. This correlation was created because Pangimbuhning Twah was able to maintain the existence of the Seren Taun Ceremony through proper decision making and planning.
Keyword: Social Capital, Local Leadership, Seren Taun Ceremony

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