Judul: Analisis perdagangan pulp dan kertas koran di Indonesia
Abstrak: Komoditi pulp dan kertas koran merupakan komoditi nonmigas yang poten- sial sebagai sumber dana alternatif dalam menunjang pembiayaan pembangunan, dalam jangka pendek dengan menghemat pemakaian devisa dan jangka panjang sebagai komoditi yang berorientasi ekspor, karena Indonesia mempunyai beberapa keunggulan komparatif untuk memproduksi pulp dan kertas koran. Penelitian ini bertujuan untuk: (1) Menduga model ekonometrika perda- gangan pulp dan kertas koran di Indonesia dan (2) Menganalisis faktor-faktor yang berpengaruh terhadap permintaan domestik, produksi, impor, ekspor dan tingkat harga pulp dan kertas koran di Indonesia. Analisis kuantitatif menggunakan model ekonometrika dengan sistem persamaan simultan dan diduga dengan metode Kuadrat Terkecil Tiga Tahap (Three Stage Least Squares 3 SLS). Menggunakan data sekunder runut waktu (time series), selama periode tahun 1970 hingga 1992. Tanda peubah harga domestik pulp, harga ekspor pulp, harga domestik log kayu, suku bunga pinjaman bank, dan upah sektor industri pulp tidak sesuai menurut kriteria ekonomi dalam persamaan produksi pulp. Produksi pulp Indone- sia dipengaruhi secara nyata oleh harga domestik pulp, harga ekspor pulp, harga domestik log kayu, harga domestik kertas koran, suku bunga pinjaman bank, dan upah sektor industri pulp. Dalam jangka pendek dan jangka panjang produksi pulp Indonesia responsif terhadap perubahan harga domestik pulp, harga domestik log kayu, dan harga domestik kertas koran.
Keyword: 

Judul: Analisis faktor-faktor yang mempengaruhi aliran perdagangan dan strategi pengembangan ekspor kertas indonesia
Abstrak: Industri bubur kertas (pulp) dan kertas (paper) merupakan salah satu hasil dari sektor industri pada komoditi non migas yang memiliki peranan penting dalam perekonomian Indonesia. Industri ini memberikan kontribusi yang cukup besar terhadap devisa negara. Perkembangan industri pulp dan kertas sejak tahun 1990-an cukup pesat. Hal ini dapat dilihat dari kapasitas produksi pulp dan kertas yang terus meningkat. Jika pada tahun 2000 produksi pulp dan kertas masing-masing sebesar 4,08 dan 6,80 juta ton, maka pada tahun 2006 meningkat masing-masing sebesar 39 persen dan 30 persen menjadi 5,6 dan 8,8 juta ton. Dalam kurun waktu yang sama ekspor produk pulp dan kertas juga mengalami peningkatan dari masing-masing 1,3 dan 4,5 juta ton menjadi 2,8 dan 6,4 juta ton.
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