Judul: Tingkat partisipasi komunitas dalam penyelenggaraan Radio Komunitas Citra Utami FM, Desa Cikidang Bayabang, Kecamatan Mande
Abstrak: Radio komunitas adalah radio dari, oleh, dan untuk komunitas, sehingga dalam penyelenggaraannya dibutuhkan partisipasi aktif dari seluruh anggota komunitasnya. Tujuan penelitian ini adalah menganalisis tingkat partisipasi komunitas dan faktor-faktor yang berhubungan dengan tingkat partisipasi komunitas dalam penyelenggaraan Radio Komunitas Citra Utami FM. Penelitian dan proses pengambilan data dilakukan di Desa Cikidang Bayabang dengan pendekatan kuantitatif yang didukung oleh pendekatan kualitatif. Hasil penelitian menunjukkan bahwa tingkat partisipasi komunitas dalam perencanaan penyiaran, pelaksanaan penyiaran, dan evaluasi penyelenggaraan radio komunitas tergolong rendah, sedangkan pada tahap penikmatan hasil siaran tergolong sedang. Secara keseluruhan tingkat partisipasi komunitas tergolong rendah. Hasil pengujian statistik juga menunjukkan bahwa faktor umur, tingkat pendapatan, dan kualitas pemancar berhubungan nyata dengan tingkat partisipasi dalam pelaksanaan penyiaran. Selanjutnya, faktor kesesuaian materi siaran dan pengadaan layanan interaktif berhubungan nyata dengan tingkat partisipasi dalam penikmatan hasil siaran radio komunitas.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, Community radio, Level of participation, Human ecology, Community participation, Rank spearman, Konvergensi media

Judul: Correlation of community participation with community radio’s success (Case: Radio Telekomunikasi Cipta, University of Indonesia)
Abstrak: Radio Komunitas adalah media counter hegemony yang partisipatif, dalam arti bahwa ia menyediakan ruang publik melalui komunikasi horizontal antar peserta berlangsung, yang dapat memberikan informasi yang dibutuhkan suatu komunitas tertentu dan terlepas dari kekuasaan lebih besar yang mengontrolnya dengan paksaan. Tanpa adanya peran aktif dari masyarakat yang terlibat dalam pengelolaannya maka radio komunitas tersebut telah gagal memenuhi tugasnya. Oleh karena itu diperlukan partisipasi masyarakat dalam radio komunitas. Tujuan utama dari penelitian ini adalah untuk menganalisis hubungan partisipasi masyarakat dengan kesuksesan radio komunitas, dengan tujuan spesifik: (1) Menganalisis aspek-aspek pengelolaan program siaran radio komunitas, (2) Menganalisis tingkat partisipasi masyarakat terhadap aspek-aspek pengelolaan radio komunitas, (3) Menganalisis kesuksesan radio komunitas. Metode penyusunan proposal penelitian adalah pendekatan kuantitatif yang didukung dengan data kualitatif dalam melengkapi data. Data-data diolah menggunakan uji korelasi rank spearman dan dilakukan secara random sampling dengan pemberian kuesioner berisi pertanyaan Skala Likert pada 97 khalayak mahasiswa pengikut akun Instagram RTC UI di Universitas Indonesia, Depok, Jawa Barat., Community Radio is a participatory counter hegemony media, in the sense that it provides public space through horizontal communication between participants, which can provide the information needed by a particular community and apart from the greater power that controls it by force. Without the active role of the community involved in its management, the community radio has failed to fulfill its duties. Therefore community participation in community radio is needed. The main objective of this research is to analyze the relationship between community participation and the success of community radio, with specific objectives: (1) Analyzing aspects of community radio broadcast program management, (2) Analyzing the level of community participation in aspects of community radio management, (3) ) Analyze the success of community radio. The method of preparing a research proposal is a quantitative approach that is supported by qualitative data to complement the data. The data will be processed using the Spearman rank correlation test and carried out by random sampling by giving a questionnaire containing Likert Scale questions to 97 followers of RTC UI’s Instagram account which are students at the University of Indonesia, Depok, West Java.
Keyword: community participation, community radio

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