Judul: Prospek meningkatkan pendapatan petani jambu mete ditinjau dari sistem pemasaran mete gelondong : Studi kasus kecamatan Kubu, Kabupaten Karangasem, Propinsi Bali
Abstrak: Salah satu kendala dalam pengembangn jambu mete di Indonesia adalah faktor sosial ekonomi yang menyangkut sistem pemasaran. Harga mete gelondong di tingkat petani di Bali terus meningkat sebesar 20.7% per tahun (nilai rata-rata). Namun apabila dilihat dari nilai nominal, harga tingkat petani di Bali hanya sebesar 57% harga tingkat petani Jawa Timur dan 67% dari harga tingkat peta- ni Sulawesi Tenggara. Hal ini disebabkan oleh (1) perbe- daan sistem pemasaran dan lembaga yang terlibat, (2) jum- lah produksi daerah, (3) perbedaan kualitas dan (4) pusat perdagangan ekspor dan pengolahan. Sehingga perlu diper- hatikan apakah ada peluang untuk dapat meningkatkan penda- patan petani melalui peningkatan harga nete gelondong di tingkat petani. Tujuan dari penelitian ini adalah: 1. Mempelajari saluran, lembaga dan fungsi pemasaran mete gelondong di Bali. 2. Mempelajari marjin pemasaran mete gelondong untuk mengetahui besarnya balas jasa yang diterima oleh setiap lembaga pemasaran yang terlibat dalam pemasaran mete gelondong. 3. Mempelajari struktur pasar mete gelondong di Bali dan pengaruh struktur pasar tersebut terhadap harga mete yang diterima petani. 4. Menpelajari peluang-peluang yang dapat dilakukan untuk neningkatkan harga sete gelondong yang diterima petani.
Keyword: 

Judul: Studi Perencanaan Industri Sari Buah Jambu Mete
Abstrak: Pengembangan jambu mete d i Indonesia dilaksanakan dalam rangka meningkatkan lapangan kerja dan pendapatan petani di lahan beriklim kering, peningkatan ekspor komoditi ja&u mete, s e r t a r e h a b i l i t a s i lahan k r i t i s melalui penghijauan dan konservasi tanah dan a i r d i daerah peka erosi. Oleh karena i t u perkembangan luas areal perkebunan jambu mete meningkat, rata-rata 6.59 % per tahun. Perluasan a r e a l perkebunan tersebut meningkatkan pula produksi jambu mete, rata-rata 6.60% per tahun. Walaupun demikian pemanfaatan h a s i l tanaman jambu mete hanya terbatas pada mete gelondongnya, sedangkan pemanfatan jambunya masih r e l a t i f sedikit bahkan dibuang sebagai limbah.
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