Judul: Role Of The Stakeholders Towards To Ecotourism Development At Teluk Cendrawasih National Park Teluk Wondama Regency West Papua Province
Abstrak: Teluk Cendrawasih National Park (TCNP) is one of nature conservation areas which has a high tourism attraction both in marine or terrestrial. Development of TCNP ecotourism can not be done by only one single institution, but it needs to be supported by every part of other institutions. Role of stakeholders expected to be able to construct a directional and measured ecotourism development based on interest, concern, desire and personal anxiety. The aim of this research is to formulate the role of stakeholders related with the development of ecotourism at TCNP. In order to achieve this aim, there are some following steps that should be done: 1) analyze of stakeholders involvement; 2) analyze of stakeholders needs; 3) analyze of policy/regulation related to ecotourism development at TCNP Teluk Wondama Regency. The results showed that there are 20 (twenty) stakeholders which involved in ecotourism development at TCNP Teluk Wondama Regency. There are two stakeholders as subject position; 14 (fourteen) as key player; three stakeholders as context setter, and YALHIMO as Crowd. Activities dealing, the stakeholder has along with ecotourism development at TCNP. The policy of ecotourism development at TCNP Teluk Wondama Regency has already referred to Centre and West Papua Province Policy also Teluk Wondama Regency Policy. Generally, the identified stakeholder has its own role accord with their main tasks and function, however, ecotourism development program still needs to be synchronized among others stakeholders in order to make it more directionally.
Keyword: 

Judul: The Role of Stakeholders in the Development of Nature Tourism in Mount Ciremai National Park
Abstrak: Pengembangan wisata alam di Taman Nasional Gunung Ciremai (TNGC) membutuhkan adanya dukungan dari berbagai pihak pemangku kepentingan. Kepentingan dan pengaruh masing-masing stakeholders perlu diketahui untuk mengelompokkan menjadi key player, subject, crowd dan contextsetter dan hasil tersebut untuk merumuskan peranan stakeholders. Tujuan penelitian yaitu mengidentifikasi dan menganalisis stakeholder, menentukan dan menganalisis kategori stakeholder serta merumuskan peran stakeholder. Metode yang digunakan yaitu observasi lapang dan wawancara. Stakeholders yang terlibat dalam pengembangan wisata alam yaitu 16 stakeholder meliputi dua desa penyangga, yaitu Desa Pasawahan dan Desa Bantaragung dan dikelompokkan pada pemerintah pusat, pemerintah daerah, swasta, dan masyarakat. Stakeholder yang teridentifikasi masuk dalam tiga kategori antara lain key player, crowd, dan contextsetter. Stakeholders yang berperan sebagai mitra pelaksana wisata alam merupakan kelompok masyarakat. Balai TNGC merupakan stakeholders kunci yang memiliki peran paling penting dalam pengembangan wisata alam., The development of natural tourism in Mount Ciremai National Park (TNGC) requires the support of various stakeholders. The interests and influence of each stakeholder need to be known to group them into key players, subjects, crowds and contextsetters and the results are to formulate the roles of stakeholders. The research objectives are to identify and analyze stakeholders, determine and analyze stakeholder categories and formulate stakeholder roles. The method used is field observation and interviews. The stakeholders involved in the development of nature tourism are 16 stakeholders including two buffer villages, namely Pasawahan Village and Bantaragung Village and are grouped into the central government, local government, private sector, and community. The identified stakeholders fall into three categories, including key players, crowds, and contextsetters. Stakeholders who act as implementing partners for nature tourism are community groups. TNGC Hall is a key stakeholder who has the most important role in the development of nature tourism.
Keyword: Ciremai Mountain National Park, nature tourism, stakeholders

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