Judul: Analisis Pendapatan Usaha Pembenihan dan Pendederan Ikan Nila GMT
Abstrak: The research aimed to identify and analyze the structure of cost, income and business efficiency of GMT tilapia hatchery Buni Sari farm group in Caringin Wetan village, Sukabumi District with the emphasis in the segmentation of business. There are five group with different segmentation of business. Retrieval respondents method used was the method of survey. Results of the research showed cash expenditure was greater than the non-cash expenses. The largest cost component was labor, while the group with smallest production costs was Group C. Based on the income and efficiency of business comparison, the group that attempted more than one stages of hatchery activities showed the trend to get profitability and efficiency of business higher than the group that attempted only one stages of hatchery activity.
Keyword: 

Judul: Analisis kelayakan usaha pembenihan ikan nila GMT (Genetically Male Tilapia) di CV Dejee Fish, Kecamatan Caringin, Kabupaten Sukabumi.
Abstrak: Melihat potensi yang ada CV Dejee Fish melakukan pembukaan usaha baru khusus pembenihan ikan nila GMT (benih unggul) maka perlu dilakukan analisis kelayakan usaha. Tujuan penelitian ini untuk menganalisis kelayakan usaha berdasarkan aspek non finansial dan aspek finansial.Menganalisis pengaruh tingkat perubahaan yang terjadi pada suatu variabel usaha menggunakan switching value. Hasil analisis aspek non finansial yang terdiri dari aspek pasar, aspek teknis, aspek manajemen dan hukum, aspek sosial ekonomi dan budaya, serta aspek lingkungan usaha ini layak untuk dijalankan. Berdasarkan hasil analisis finansial usaha layak dijalankan dengan nilai NPV positif, Net B/C > 1, IRR > discount rate dan Payback Period < umur bisnis. Hasil analisis switching value dilakukan dengan dua perubahan komponen, yaitu penurunan jumlah output dan peningkatan biaya produksi usaha pembenihan nila GMT. Hasilnya adalah batas maksimum perubahan yang masih bisa ditolerir masing-masing sebesar 36.19 persen dan 70.19 persen untuk skenario I (empat macam output). Hasil skenario II (dua macam output) masing-masing sebesar 31.48 persen dan 54.19 persen.
Keyword: Nila GMT, analisis finansial, usaha pembenihan, studi kelayakan

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: