Judul: Analisis laporan keuangan parsial PT Kerja Niaga sebagai penyangga dan pemegang stok nasional cengkeh studi kasus di PT Kerta Niaga, Jakarta Barat
Abstrak: Cengkeh merupakan salah satu komoditi penting yang sebagian besar dihasilkan petani dan merupakan salah satu bahan baku bagi industri pabrik rokok kretek. Dengan demikian kelangsungan pengadaan cengkeh dan kemantapan harga cengkeh perlu dijamin. Keadaan harga cengkeh di tingkat petani yang berfluktuasi dan cenderung menurun, akan berakibat buruk terhadap peningkatan pendapatan dan kesejahteraan petani produsen cengkeh. Akibat buruk lain yang ditimbulkan adalah intensif petani kurang untuk meningkatkan produksi cengkeh per hektar.
Keyword: 

Judul: Analisis Dampak Kebijakan Pemerintah Terhadap Penawaran Dan Permintaan Cengkeh Di Indonesia
Abstrak: Cengkeh merupakan salah satu komoditi perkebunan yang penting dan unik, karena Indonesia merupakan negara produsen, konsumen dan sekaligus importir terbesar di dunia. Penggunaan utama komoditi cengkeh adalah sebagai bahan baku dalam industri sigaret kretek, sehingga perkembangan komoditi cengkeh sangat tergantung pada maju mundurnya industri sigaret kretek. Industri sigaret kretek memiliki fungsi sosial-ekonomi yang cukup penting di dalam perekonomian Indonesia, karena industri sigaret kretek mempunyai kaitan ke hilir (forward-linkage) dan kaitan ke hulu (backward-linkage) dari aspek sumber pendapatan negara, lapangan kerja, sumber pendapatan petani cengkeh, dan sektor jasa lainnya. Dengan demikian industri sigaret kretek berkaitan secara langsung dengan sektor pertanian, yang berarti pula merupakan penggerak ekonomi di perkotaan maupun di pedesaan. Permasalahan utama di dalam pasar cengkeh adalah terjadi penurunan harga cengkeh di tingkat petani, dan peningkatan harga cengkeh di tingkat industri sigaret kretek yang disebabkan oleh kebijakan tataniaga cengkeh. Tujuan penelitian ini adalah: (1) menganalisis respon penawaran, permintaan dan harga cengkeh terhadap faktor-faktor ekonomi yang berpengaruh, di tingkat petani cengkeh dan di tingkat industri sigaret kretek, (2) menganalisis dampak kebijakan pemerintah terhadap penawaran, permintaan dan harga cengkeh dan (3) menganalisis dampak kebijakan pemerintah dalam pasar cengkeh terhadap tingkat kesejahteraan produsen dan konsumen cengkeh. Penelitian ini menggunakan model ekonometrika yang merepresentasikan pasar dan proses produksi komoditi cengkeh dalam bentuk persamaan simultan. Model diduga dengan metoda three-stage least squares dan disimulasi untuk berbagai alternatif kebijakan…dst
Keyword: Tanaman Cengkeh, Fungsi Tataniaga, Produksi Cengkeh, Pasar Cengkeh, Kesejahteraan Petani Cengkeh

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