Judul: Evaluasi kualitas dan kecernaan biji karet, biji kapuk, kulit singkong, palm kernel meal, dan kopra yang difermentasi oleh Saccharomyces cerevisiae pada pakan juvenil ikan mas Cyprinus carpio
Abstrak: Pakan menjadi sumber energi bagi ikan dimana tepung ikan dan bungkil kedelai sebagai penyumbang protein utamanya. Harga tepung ikan dan bungkil kedelai yang mahal menyebabkan harga pakan menjadi tidak kompetitif, oleh karena itu perlu dicari sumber bahan baku pakan alternatif. Penelitian ini bertujuan mengevaluasi kualitas dan kecernaan bahan baku lokal pakan yang difermentasi. Pada penelitian ini dilakukan uji kecernaan berbagai bahan baku lokal (biji kapuk, kulit singkong, kopra, biji karet dan palm kernel meal) yang difermentasi dengan ikan mas Cyprinus carpio sebagai ikan uji. Penelitian dilaksanakan Februari sampai April 2011 bertempat di Laboratorium Nutrisi Ikan, Departemen Budidaya perairan, Fakultas Perikanan dan Ilmu Kelautan, Institut Pertanian Bogor. Bahan yang diuji telah dalam bentuk tepung dan difermentasi dengan Saccharomyces cerevisiae instan dengan dosis 0,9% w/w selama 24 jam. Setelah itu bahan dikeringkan dan digunakan sebagai campuran pakan uji dengan perbandingan 30% bahan uji dicampur 70% pakan komersil untuk uji kecernaan. Ikan dipelihara selama 30 hari dan pengumpulan feses dilakukan sejak hari ke-6 untuk kemudian diuji di laboratorium. Hasil analisis proksimat menunjukkan bahwa proses fermentasi mampu meningkatkan protein bahan sebesar 16-31%, dan menurunkan serat kasar bahan sebesar 2-31%. Selain itu, fermentasi mampu meningkatkan nilai kecernaan pakan oleh ikan mas yang ditunjukkan oleh meningkatnya kecernaan protein sebanyak 4-12%, kecernaan bahan sebanyak 4-72%, dan kecernaan energi sebesar 4-12%. Sehingga dapat disimpulkan bahwa proses fermentasi mampu meningkatkan kecernaan pakan dengan bahan baku lokal oleh juvenil ikan mas.
Keyword: 

Judul: Evaluasi Kualitas dan Kecernaan Kulit Singkong, Biji Karet, Kopra, Biji Kapuk, dan Palm Kernel Meal Difermentasi Saccharomyces cerevisiae pada Juvenil Ikan Nila Oreochromis
Abstrak: Feed becomes the most expensive factor in freshwater aquaculture production. It often costs from 45% to 85% of total variable expensis, depending on its intensity of culture operation. The high price is caused by materials which used in this operation. The materials availability still rely on imports such as fish meal, soybean meal, and flour. This makes price of feedstuff is not competitive. Therefore, an alternative local’s feedstuffs which could potentially reduce or even replace imported feedstuff composition in diets is needed. However, the low quality of local’s feedstuffs nutrition make it difficult to developed. This low quality caused by high crude fiber content and the presence of anti-nutritional substances factor, so it needs to be processed first by fermentation methods. This study used five treatments, two factors, and one replicates. Fish used in this study were juvenile of nile tilapia Oreochromis niloticus which has weight about 16,26±2,43 grams. Diets given at satiation, three times a day. The feedstuffs used are cassava peel, rubber seed, cottonseed, copra, and (Palm Kernel Meal, PKM). The result of this study showed some enhancements in fish content. The fermentation by Saccharomyces cerevisiae can increase fish (test material) protein around 16,85%-31,11%, decrease crude fiber around 2,46%-31,65%, increase protein digestibility around 0,25%-11,7%, increase digestibility of energy around 4,29%-11,17% (except for digestibilty in the cassava peel) and also increase the digestibility of feedstuffs around 1,37%-61,19% in juvenile of nile tilapia O. niloticus.
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: