Judul: Analisis dan Pengendalian Kebisingan pada Proses Penggilingan Padi (Studi Kasus di Penggilingan Beras Kramat, Cianjur, Jawa Barat)
Abstrak: Pascapanen merupakan serangkaian proses kegiatan dari panen sampai di tangan kosumen, salah satu proses pascapanen adalah penggilingan padi. Penggilingan Beras (PB) Kramat merupakan salah satu penggilingan padi yang mempunyai kapasitas 10 ton/hari. Salah satu permasalahan yang ditimbulkan oleh penggilingan padi adalah noise (bising). Bising merupakan suara yang tidak dikehendaki dan dapat mengganggu kosentrasi kerja, bising ditimbulkan oleh engine dan mesin penggilingan. Bising tersebut mempunyai dampak yang tidak baik bagi kesehatan. Pengukuran tingkat kebisingan dengan menggunakan sound level meter. Berdasarkan hasil pengukuran, tingkat kebisingan yang terjadi di ruang penggilingan antara 73.84-94.42 dB(A), ruang polisher sebesar 81.1-97.16 dB(A), ruang grading dan pengemasan 62.36-84.58 dB(A), dan ruang engine utama 88-93.4 dB(A). Batas waktu yang diizinkan oleh KEPMENAKER yaitu 2.7 jam/hari untuk area mesin penyosoh, untuk area polisher 2.22 jam/hari, area paddy cleaning 2.36 jam/hari dan area engine utama 1.34 jam/hari sedangkan untuk area pengumpan gabah dan pengemasan 8 jam/hari. Tingkat daily noise dose pekerja untuk pekerja yang berada di pengemasan kurang dari 1, sehingga masih tergolong aman, sedangkan pekerja yang berada di area engine utama, mesin penyosoh, pengumpan gabah, paddy cleaning dan polisher lebih dari 1 yang berarti berada di luar batas aman, sehingga diperlukan pengendali kebisingan untuk mereduksi kebisingan.
Keyword: ear plug, kebisingan, penggilingan padi

Judul: Analisis Kebisingan dan Dampak Lingkungan pada Proses Penggilingan Padi (Studi Kasus Penggilingan Padi Saluyu Situ Gede, Bogor Barat)
Abstrak: Rice mill process is one of the factors to increase the rice quality. Indonesia is one of the big rice producers in the world, it couldn't be imagined the noise if every single village has the rice mill enterprise. The purpose of this research is to analyse level and noise dissemination pattern in the rice mill, analyze maximum duration in the room based on noise threshold based on labor standard, analyze and measure noise in the surrounding of the rice mill area, as well as control the noise and analyze employee hearing deterioration. Data is collected by doing direct measurement in the field and interview towards 2 respondents. The result obtained is the highest noise in the place that is often passed by rice mill employee in the area near the diesel machine sized 105 dB, in the husker operation area sized 90 dB and in the polisher operation area sized 92 dB. Maximum time limit of being near to the diesel machine is safe and continued based on DEPNAKER RI standard with a noise level of 105 dB is 30 minutes, in husker operation area with a noise level of 90 dB is 4 hours and in polisher operation area with a noise level of 92 dB is 3 hours. Noise measurement result in a resident's house terrace is 65 dB and the noise level in PAUD class room is 58 dB. Technical design for the noise control by using barrier as a sound-damper building is designed for the resident's house and PAUD because the noise passes standard level of the allowed noise. For barrier design that has been made 180 cm high, noise reduction has estimated for 22%. Audiometric test result for 2 employees that work on rice mill is, for the respondent 1 with 45 years old has right ear got a medium deaf and the left ear got serious deaf and respondent 2 with 38 years old has both ears got minor deaf.
Keyword: audiometrict test, environmental noise, room noise, ricemill

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: