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: Model of policy implementation development of the use of pesticides on vegetable crops in the province of East Java
Abstrak: The use of pesticides by vegetable farmers is closely related to the policy that has been implemented by the government through Intergrated Pest Management (IPM) program since 1989. However, the fact in the field shows that the use of pesticides for vegetable crops is still high and has caused various negative effects on humans, plant pests and the environment. This study aimed to develop a strategy for policy implementation in the use of pesticides through a system modeling approach. The research was carried out in the main central areas of vegetables (shallots, peppers, cabbages and potatoes) in four regencies including Nganjuk, Kediri, Malang and Problinggo of East Java Province. The respondents were 112 field school of IPM and 112 non- field school of IPM farmers with a method of accidental sampling. There were 12 expert respondents taken from practitioners, bureaucracy and academicians using purposive sampling. The data processing and analysis were assisted by SPSS software, version 16 for Windows, version 2.5 c for powersim modeling system and strategy development with a prospective analysis. The research results showed that the success of policy implementation in pesticide use with indicator 5 (five) appropriate (PP No. 6 / 1995) was categorized inappropriate except for the right target at pest. By using a volume approach to pesticide use, the modeling behavior of a real system in the pesticide use by vegetable farmers was composed of 5 (five) submodels: (1) sub-model of planting area, (2) sub-model of pest attack, (3) sub-model of farmer human resource, (4) sub-model of promotional pressure and (5) sub-model of access to the availability of pesticides. Two factors that acted as input (driver) in the system behavior were found: (1) farmer human resource and (2) the role of officers. Three factors of stakes in the system were: (1) pest attack, (2) support of local government and (3) cross-sector cooperation. Three scenarios were found for the development of policy implementation in pesticide use including (1) pessimistic scenario, (2) moderate scenario, and (3) optimistic scenario. Based on the simulation results of using pesticide on the three scenarios until the year 2025, the final data of pesticides use were obtained as follows: pessimistic scenario was 53.338,7 tons, moderate scenario 32.634,84 tons and optimistic scenario 23.107,84 tons. Priority in the development of policy implementation in the use of pesticides is the empowerment of farmers through education and training, increased role of field officers supported by cross-sector coordination and pest control.
Keyword: policy implementation, pesticides, vegetable crops, East Java, Intergrated Pest Management

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