Judul: Pemanfaatan limbah lumpur water treatment plant PT. Krakatau Tirta Industri sebagai bahan baku kompos, Utilization of PT. Krakatau Tirta Industri water treatment plant sludge as compost raw materials
Abstrak: Limbah lumpur atau sludge merupakan sisa hasil proses sedimentasi yang mengendap di dasar unit kolam clarifier. Sludge yang kemudian terkumpul dalam kolam penampung lumpur ini dapat dibuang dengan menggunakan beberapa metode pengolahan. Pengomposan merupakan salah satu metode alternatif dalam pengolahan sludge. Penelitian ini bertujuan untuk memanfaatkan sludge yang berasal dari Water Treatment Plant (WTP) milik PT. Krakatau Tirta Industri (PT. KTI) menjadi kompos dan menganalisa kandungan kompos, kemudian membandingkannya dengan standar mutu kompos menurut SNI 19-7030-2004. Peralatan yang digunakan dalam penelitian ini adalah timbangan gantung pegas, termometer alkohol, pipa pvc, spidol, wadah tempat pengomposan (box kompos), terpal plastik, alat penyiram air, dan plastik. Bahan yang digunakan adalah lumpur sisa pengolahan air WTP milik PT. KTI, jerami, bakteri dekomposer dan kotoran kambing. Penelitian ini dibagi menjadi 3 tahap, yaitu analisis lumpur dan bahan baku kompos, pengomposan, dan analisis kompos. Analisis bahan baku kompos yang terdiri dari jerami, kotoran kambing, dan lumpur dilakukan di laboratorium Balai Penelitian Tanah Indonesia untuk diketahui nilai beberapa parameter seperti pH, kadar air, kandungan organik dan anorganik-nya. Pengomposan menggunakan 2 jenis aktivator, yaitu penggunaan kotoran kambing untuk box 1 dan penggunaan bakteri dekomposer untuk box 2. Perbandingan pada box 1 antara jerami, kotoran kambing, dan lumpur adalah 100 kg:100kg:100kg, sedangkan perbandingan pada box 2 antara jerami, bakteri, dan lumpur adalah 100 kg: 100kg(ml): 90 kg.
Keyword: 

Judul: Analisis Up Take Kandungan Logam Berat dari Kompos Lumpur Water Treatment Plant oleh Tanaman.
Abstrak: Utilization of sludge processing results are very minimal and less noticed by many among the industry. This research aims to identify the feasibility of compost of sludge processing drinking water as a medium for planting, identifying the presence of heavy metals content in the compost that is absorbed in plants, and degrades the contents of heavy metals in sludge by means of fitoremediasi. The method used is the utilization of compost as a medium for planting without WTP mixed soil. On testing using three kinds of different compost WTP. Compost 1 comes from WTP PT. Krakatau Tirta Industry, Cilegon, West Java. Compost 2 comes from WTP PDAM Tirta Pakuan Bogor, West Java. Compost 3 comes from WTP PDAM Tirta Kahuripan Cibinong, West Java. On the third having a lush growth of vegetation and experience the process of degradation the heavy metals. The results of the three trials heavy metal content in plants after harvest showed values above the threshold limit of SNI 7387 in 2009 about The Limit of Heavy Metal Contamination in Food. Composting plant using WTP is not safe for consumption. Degradation of heavy metals in the form of mud at the WTP to harvest heavy metals impaired. This demonstrates the feasibility of the utilization of WTP sludge by composting and application of the growing media. Compost WTP can fertilize the plants, but not for food crops.
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: