Judul: Analisis sistem pemasaran hasil produksi perikanan tangkap: studi kasus Kecamatan Tobelo, Kabupaten Halmahera Utara (Master Thesis)
Abstrak: Fish Marketing in North Halmahera District accomplished dominated by one stakeholder (collectors/dibo-dibo). North Halmahera Government hasn’t set a policy for fishery products marketing. So it is need marketing policy strategies for fisheries products in North Halmahera District. Catches of product marketing in North Halmahera District made through several channels, namely 1) marketed directly to collectors (Dibo-dibo) to be marketed directly to the market in Tobelo and 2) marketed directly to collectors (Dibo-dibo) and then marketed seller back to retailers and consumers are distributed to the local market inside and outside of North Halmahera district To determine the price of fisheries products, fishers have no power, absolutely pricing by collectors (Dibo-dibo) without the basic price set by the government.
Keyword: 

Judul: Analisis Strategi Pemasaran Ikan Kopdit Angkara Di Kabupaten Maluku Tenggara
Abstrak: Capture fisheries production capability of high yield should be supported by a proper marketing strategy and the involvement of cooperative. This study aimed to: (1). Identify marketing strategies to market catch fish; (2). Analyze the factors that influence the income of fishermen; and (3). Formulate alternative marketing strategies in the business development process in order to play more important role in the future in Southeast Maluku regency. This study use a sample size of 100 fishermen, selected by nonprobability sampling the members and nonmembers of the Kopdit Angkara. Capital, number of crew, fishing experience, and mileage in the sail, better able to explain the monthly income of the fishermen with outboard motor fleet types, compared to a fleet of fishing boats without engine types. Number of crew in one ship and fishing experience has no significant effect on the income of fishermen fleet type boats without engines. While the fishermen with outboard motor fleet types, working capital and experience fisherman did not have a significant effect on the income of fishermen with outboard motor fleet types. SWOT analysis of Kopdit Angkara formulate a marketing strategy for optimizing the welfare of fishermen. Strategy undertaken by Kopdit Angkara in order to maintain the performance is to achieve market penetration of its product development strategy refinement. By way of optimizing human resource role to improve the marketing of products in the target markets, expand market share with a reliable distribution system and improve the product image in the community.
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