Judul: Nilai Ekonomi Pengolahan Air Limbah Rumah Tangga di Perumahan Bugel Mas Indah, Kelurahan Bugel, Kecamatan Karawaci, Kota Tangerang
Abstrak: Wastewater that had been processed using Sewage Treatment Plant (STP) can obtain several benefits. This research was conducted to recognize the process and benefits of wastewater treatment, to analyze household’s WTP and its influential factors, and to analyze the feasibility study of the STP. The methods used in this research are qualitative and quantitative descriptive analysis, contingent valuation method, linear regression, and benefit-cost analysis. The benefits of wastewater treatment are reducing wastewater flowrate and pollution, increasing cooperation among citizen, developing knowledge about the usage of wastewater, greening the environment, and reducing household’s expenditure on water using. People can save of IDR 4 920 per month for reusing the wastewater whereas their average WTP to keep its sustainability is about IDR 3 300. The influential factors related to WTP are income rate, length of stay, and also perception about the performance of domestic STP. Furthermore, household’s average WTP value is observed to make the STP proper to be operated based on NPV, Net B/C, and IRR criteria.
Keyword: wastewater, Tangerang city, sewage treatment plant, economic value

Judul: Estimasi Nilai Ekonomi Air bagi Rumah Tangga di Katulampa Kota Bogor.
Abstrak: Kelurahan Katulampa memiliki potensi sumber daya air yang baik. Namun, pemanfaatan air bersih kurang dimanfaatkan secara maksimal. Pertambahan penduduk yang cepat dan pembangunan yang semakin meningkat banyak membawa dampak terhadap sumber daya air, baik kuantitas maupun kualitasnya. Hal ini menyebabkan perlu adanya sistem pengelolaan yang baik dan berkelanjutan untuk sumber daya air agar semakin baik dari segi kualitas maupun kuantitas tanpa adanya dampak bagi lingkungan. Adapun tujuan dari penelitian ini yaitu: mengkaji karakteristik sumber daya air di Kelurahan Katulampa, mengidentifikasi pola pemanfaatan air bersih, mengestimasi besarnya pengeluaran masyarakat untuk konsumsi air bersih, mengestimasi besarnya nilai Willingness to Pay (WTP) masyarakat terhadap air bersih, mengidentifikasi hubungan antara faktor-faktor yang mempengaruhi Willingness to Pay, dan menganalisis persepsi masyarakat terhadap air rembesan yang mengalir di Perumahan Griya Katulampa. Penelitian ini menggunakan metode analisis pengeluaran, metode Contingent Valuation Method (CVM), dan uji korelasi Spearman. Hasil analisis menyatakan bahwa Kelurahan Katulampa memiliki berbagai sumber air bersih, seperti PDAM, sumur, sungai, mata air, dan air rembesan, serta pembelian air mineral yaitu AMDK dan air isi ulang (refill) untuk menunjang kebutuhan sehari-hari. Proporsi alokasi terbesar konsumsi air terhadap penghasilan pada rumah tangga responden Perumahan Griya Katulampa adalah sebesar 1,60%, sedangkan diluar Perumahan Griya Katulampa sebesar 1%. Dugaan nilai rataan WTP terhadap air bersih sebesar Rp 4.414 per meter kubik. Adanya hubungan antara faktor-faktor yang mempengaruhi Willingness To Pay masyarakat yaitu jarak PDAM, jumlah penghasilan, dan jarak sumber air lainnya berupa mata air, air rembesan, dan sungai. Pengelolaan air rembesan dilakukan atas dasar swadaya masyarakat dan masyarakat berharap air rembesan tersebut dikelola lebih baik.
Keyword: Contingent Valuation Method, Pengeluaran, Sumber Daya Air, Uji Spearman, Willingness to Pay

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: