Judul: Partisipasi komunitas kumuh perkotaan di bantaran sungai Ciliwung dalam program pengelolaan sampah organic berbasis komunitas
Abstrak: Program pengelolaan sampah organik merupakan salah satu upaya pemberdayaan yang dilakukan oleh sebuah organisasi masyarakat bernama Ciliwung Merdeka terhadap komunitas marginal di Kota Jakarta. Rangkaian kegiatan dalam program pengelolaan sampah organik melibatkan komunitas kumuh perkotaan di bantaran Sungai Ciliwung dalam mengidentifikasi permasalahan dan potensi yang dimiliki komunitas. Dengan demikian proses pembelajaran yang diterapkan mengarah pada prinsip buttom up. Tujuan penelitian adalah (1) Mengidentifikasi faktor-faktor yang mempengaruhi tingkat partisipasi komunitas kumuh perkotaan terhadap program pengelolaan sampah organik; (2) Mengkaji hubungan antara tingkat kemauan, tingkat kemampuan, dan tingkat kesempatan yang dimiliki komunitas kumuh perkotaan terhadap tingkat partisipasi dalam program pengelolaan sampah organik; dan (3) Mengetahui sampai sejauh mana tingkat partisipasi (tipologi Arnstein) komunitas kumuh perkotaan dalam program pengelolaan sampah organik.
Keyword: 

Judul: Efektivitas Kelembagaan Partisipatoris di Hulu Daerah Aliran Sungai Citarum (Studi Kasus Komunitas Cikapundung Rehabilitation Program dan Komunitas Zero, Kecamatan Coblong, Kota Bandung, Provinsi Jawa Barat)
Abstrak: Upstream watershed is one of the sub-watersheds that serve to maintain the availability of water for the central and downstream region. So that, when damage occurs in that area, it will effect to the middle and lower area of the watershed. The purposes of this study were (1) to determine the stakeholders who involved in the rescue of Citarum watershed upstream, (2) to know the effectiveness of participatory institutions to change attitudes and behavior of society around the Citarum watershed upstream. This study was conducted using a quantitative approach supported by qualitative approach. Meanwhile, the results of this study showed (1) institutional participatory have successfully changed attitudes and behavior of society to not to dispose the household garbage and sewage into the river again (2) participatory institutional not yet managed to change the manner of private parties to not to dispose garbage and industrial waste into the river, and (3) participatory institutions in central are more effective to change society attitudes and behavior to be more concerned for the environment than the existing participatory institutions in the upstream. In generally, the participatory institutions have successfully established collaborative between public, private and government at the sub-watershed upstream
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