Judul: Manajemen Panen Kelapa Sawit (Elaeis Guineensis Jacq.) di Kebun Tambusai PT. Panca Surya Agrindo, First Resources Ltd., Kec. Tambusai, Kabupaten Rokan Hulu, Riau.
Abstrak: The purpose of this internship program was to improve technical and managerial skills on oil palm plantation. The internship was conducted at Tambusai Estate, PT. Panca Surya Agrindo, First Resources Ltd; Tambusai, Rokan Hulu, Riau on 13 February to 12 May 2012. Primary data from field observations devoted to the preparation of fruit harvesting, and other technical and managerial aspects of harvesting, harvesting system of premiums, and production of fresh fruit bunches. Secondary data were obtained from the archives of the company for 5 years. The data were analized by using deskriptive method, percentage (%) and average value. The data and fild observations indicated that there were harvesting management problem needed to be improved. The problem related with the back number of harvester, caused too high harvest capacity of each harvester, and the less accurate of yield prediction. Asno the consequency of the problem was the late of transportation to the mill and the processing of FFB at the mill
Keyword: 

Judul: Pengelolaan Pemanenan Kelapa Sawit (Elaeis guineensis Jacq.) di PT. Aneka Intipersada Pinang Sebatang Estate, Kabupaten Siak , Privinsi Riau
Abstrak: The internship program has been conducted at PT. Aneka Intipersada Pinang Sebatang Estate, Siak, Riau from February 13 to May 13 2012. The purpose of this internship program is to learn oil palm cultivation, especially for oil palm harvesting aspects. The data to be collected consist of primary and secondary data. Generally, harvest port and fruit grade in Unit Pinang Sebatang Estate are good enough with ratio of loses fruit under the standard that has been stated by the company about 1.8% and fruit ripeness average reaching more than 95%. Harvest tools and self protection tools are given by the company and it is used orderly by harvesting labors. The transportation unit capacity are completed with the transportation labor in every unit according to the capacity. The main problem in harvesting is the increasing of harvesting rotation from 7 to 9 days. The absence of worker, freeday, and rain in workday are the main cause of this problem.
Keyword: 

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: