Judul: Valuasi Ekonomi dan Model Pengendalian Dampak Pencemaran Wilayah Pesisir Studi Kasus Dampak Pencemaran terhadap Budidaya Keranghijau (Perna viridis) di Teluk Jakarta
Abstrak: ADRIANTO AND DEWAYANY SUTRISNO. Waters of Jakarta Bay is one of Indonesia's waters are teeming with various kinds of human activities. Jakarta Bay waters also the last of the water bodies that collect waste from industrial and waste disposal in Jakarta and surrounding areas who dispose of their waste directly or indirectly through the 13 rivers that empty into the Bay of Jakarta. Therefore, the main problem in the waters of Jakarta Bay is the presence of pollution, such as heavy metal pollution. The purpose of this study was to analyze heavy metal ; analyze the economic losses caused by pollution, and develop strategies to control pollution by using green mussels as biofilters. The experiment was conducted in Jakarta Bay coastal region into the North Jakarta in February-December 2012. Economic valuation is done by using the approach effect on production (EOP), as well as economic analysis environment desire to receive compensation (WTA). To get control strategies do impact on the dynamic system approach is based on the actual conditions of the study results and existing theory with the help of Stella version 8 software. The results showed the content of heavy metals Hg and Cd in the water in the Bay of Jakarta in some locations has exceeded a predetermined threshold, so that only Pb is generally not exceed a predetermined threshold. Heavy metals in mussel were high. The value of the economic benefits Jakarta Bay waters by its function as a place of green mussel cultivation of potentially economic-ecological value losses when there is contamination amounting to Rp 5 485 067 304, - per hectare. The total value of the benefits of green mussel farming activities carried out in the Bay of Jakarta is Rp. 35 149 103 520, - The calculation result shows that the willingness to accept the reduced pollution per individual to be associated with the cultivation of mussels, amounting to Rp. 40 632 299 / individual / year. Based on this, the total economic value of the willingness to accept the possibility of loss of revenue due to pollution in the Bay of Jakarta is Rp 63 223 857 870, -per year. Based on the scenarios in dynamic system. the scenario with the increasing number of green mussel chart at 20 % per year, making green mussel production will increase by 50%. In this case the prediction in 2020, the number of charts of 5,375 units, the green mussel production will increase to 385 260 tonnes. In these conditions the expected mercury content decreased to 0.005592 mg / liter, the content of Cd decreased to 0.001807 mg / liter and the concentration of Pb decreased to 0.001601 mg / liter. The existing green mussels in the Bay of Jakarta will be more suitable if used as a purifier. Strategy to increase the amount of green mussels in the waters of Jakarta Bay may be an alternative strategy for the control of heavy metal pollution in Jakarta Bay...dst
Keyword: akumulasi, kerang hijau, logam berat, valuasi ekonomi

Judul: Analisis biaya manfaat lokasi budidaya kerang hijau (Mytilus viridis) di perairan Teluk Jakarta
Abstrak: Wilayah pesisir dan laut Teluk Jakarta selain memiliki potensi pembangunan, juga memiliki ancaman akan kerusakan lingkungan dan sumberdaya alam pesisir. Permasalahan yang terkait dengan tingginya tekanan ekologi di kawasan Teluk Jakarta berupa kerusakan habitat dan pencemaran lingkungan. Hal ini membuat keberadaan budidaya Kerang Hijau (Mytilus viridis) menjadi terancam karena menghadapi kendala akibat pencemaran seperti kegagalan/penurunan produksi dan kualitas produk yang kurang layak untuk dikonsumsi.
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: