Judul: Strategi Pengurangan Penggunaan Metil Bromida untuk Karantina dan Pra Pengapalan di Indonesia
Abstrak: Since January 1st, 2008, government of Indonesia set the import and consumption of methyl bromide, only for quarantine and pre shipment purposes. This policy was a consequence of the ratification of the Vienna Convention and Montreal Protocol by the government. The purposes of this study are: (1) conducting a review of national policies related to methyl bromide and its implementation, (2) conducting a requirement analysis of pesticides for quarantine and preshipment purposes, (3) looking for a strategic priority setting policy methyl bromide. This research was conducted in three cities: Jakarta, Surabaya and Makassar, using primary and secondary data. This study used descriptive analysis, trend analysis, and Analytical Hierarchy Process (AHP). The resulted showed that (1). Government policy sets ban on production, import procedures, distribution and use, were not implemented properly; (2). The Government was not successful to reduced methyl bromide consumption through the policy of import quotas. Consumption showed an increasing trend from year to year; (3). The most influence factor on policy was fumigation’s company compliance. A recommended policy strategy is developing monitoring systems of methyl bromide presence which integrated from import, distribution, and use; and coordinated only by one government agency.
Keyword: 

Judul: Kajian Strategi Pencegahan dan Pengendalian Bruselosis di Kalimantan
Abstrak: The strategy of prevention and control of brucellosis has been implemented in Kalimantan and this province of Indonesia has been declare free of brucellosis in 2009. Cattle movement from brucellosis infected areas to Kalimantan poses a high risk of entry and spreading of brucellosis in this island. The purpose of this study is to analyse the strategy of prevention and control of brucellosis in Kalimantan. The study used a descriptive analysis including human resources, policy environment (fund and infrastructure) and policy system. The result of this study proves that AQA has been able to implement, monitor and control animal movement in Kalimantan in preventing new cases of brucellosis. Each AQA involved in sending and receiving cattle has adequate qualified human resources with sufficient knowledge and attitude related with brucellosis although the majority they never have additional training about brucellosis. Most of AQA already have enough funds and infrastructure to implement the strategy. Policy system in controlling cattle movement in relation with prevention of brucellosis has been implemented, but is not fully executed according to OIE. A total of 14 District veterinary services in this study that have a function to control brucellosis does not have enough veterinarian and para-veterinarian to implementing the strategy to control brucellosis in their area. In general, the district veterinary officer have sufficient knowledge and good attitude toward brucellosis, although the majority they never have additional training about brucellosis. Most of district veterinary services do not have funds and infrastructure related with strategy control of brucellosis. And also most of district veterinary services do not implemented yet the strategy of control of brucellosis which is based on the ministry of Agriculture and OIE.
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