Judul: Analisis fungsi hati dan ginjal manusia dengan photometer 4010
Abstrak: Tubuh manusia terdiri dari berbagai organ yang mempunyai perilaku dan fungsi berbeda- beda. Selama hidup organ- organ tersebut mengalami perubahan didalam sel maupun organ- organ pada tubuh manusia antara lain terjadi regenerasi maupun degenerasi yang berbeda- beda. Para pekerja yang bekerja di instalasi nuklir rentan terhadap radiasi, oleh karena itu sebagai pekerja radiasi wajib dilengkapi dengan Alat Pelindung Diri (APD) pekerja radiasi yaitu dosimeter poket, ophron, jas lab, sarung tangan, masker, dan lain-lain untuk mencegah terkena paparan radiasi. namun demikian kemungkinan terjadinya paparan radiasi masih tetap ada. Hati dan ginjal merupakan organ yang mempunyai tingkat kerentanan yang cukup berperan untuk terjadinya perubahan akibat radiasi, sehingga diperlukan cek rutin kesehatan pertahun yang dilakukan pada sub bagian Keselamatan Kerja di P3KRBiN - BATAN.
Keyword: 

Judul: Perancangan Dan Pembuatan Alat Pemantau Detak Jantung Transmission Photoplethysmograph
Abstrak: Detak jantung merupakan indikator yang sangat berguna untuk menunjukkan kondisi kesehatan tubuh terutama jantung. Detak jantung sangat dipengaruhi oleh usia, dan beban kerya yang dilakukan. Ketika usia bertambah, detak jantung akan berkurang. Beban ketja meningkat maka detak jantung juga akan meningkat Timbulnya Detak jantung menunjukkan aktivitas jantung yang mengatur sirkulasi darah di dalam tubuh. Sehingga ketika teIjadi gangguan pada aktivitas jantuflg serta gangguan pada sirkulasi darah di dalam tubuh dapat diketahui dari detak jantung. Penelitian ini akan membuat sebuah alat pemantau detak jantung yang menggunakan metode optik dimana jaringan tubuh akan berperan sebagai filter sinar yang dipancarkan LED ultra merah. LED ultra merah memiliki daya pancaran yang lebih kuat dibanding LED merah biasa. Sinar merah yang dipancarkan dari SlImber cahaya LED, dilewatkan melalui jari tangan dan di baliknya terdapat photodioda yang akan menangkap cahaya yang diteruskan melalui jari tangan. SinyaJ yang ditangkap ini disaring dan dikuatkan
Keyword: 

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm