Judul: Analisis Pengaruh Minuman Beroksigen terhadap Komponen Darah dan Kimia Klinik (Studi Kasus : Penderita Penyakit Paru Obstruktif Kronis di Klinik Katili Bogor)
Abstrak: Chronic Obstructive Pulmonary Disease (COPD) is the fourth largest cause of death in the world. COPD is characterized by constriction of airway, thus the flow of oxygen from the lungs is reduced. Lack of oxygen in the body can be fulfilled by consuming oxygenated water. In this study, 10 patients with COPD serve as respondents were given an oxygenated water with a concentration of 100 mg/L, two times a day, each 385 ml for 21 days. The influence of oxygenated water was observed through 13 variables of blood components and clinical chemistry. Hotelling's T2 test on the bootstrap resampling data indicates oxygenated water can increase Hemoglobin, Erythrocytes, Hematocrit and decrease Serum Glutamic Oxaloacetic Transaminase, Serum Glutamic Pyruvic Transaminase, Blood Sugar. It shows that oxygenated water is beneficial for patients with COPD and does not cause oxidative stress.
Keyword: oxygen, hotelling's T2 test, COPD, bootstrap resampling

Judul: Intervensi Air Minum Beroksigen Mempengaruhi Kadar CD4, CD8, dan CD56 Pada Darah Vena Penderita Paru Obstruktif Kronik (PPOK)
Abstrak: Air minum beroksigen sudah lama berkembang di Indonesia. Konsumsi air minum beroksigen dikatakan dapat meningkatkan ketersediaan oksigen dalam tubuh yang ditunjukkan dengan kenaikan saturasi oksigen darah. Telah banyak penelitian yang mempelajari pengaruh air minum beroksigen, namun penelitian tersebut dilakukan pada hewan coba, dan responden yang sehat. Konsumsi air minum beroksigen lebih disarankan kepada individu dengan tingkat aktivitas fisik tinggi, seperti olahragawan atau atlet, yang membutuhkan banyak energi untuk stamina mereka. Belum ada penelitian yang mempelajari pengaruh konsumsi air minum beroksigen bagi penderita paru obstruktif kronik (PPOK). PPOK ialah penyakit paru yang ditandai oleh hambatan aliran udara yang bersifat reversible parsial. Gangguan fungsi paru tersebut menyebabkan kesulitan bernapas dan berkurangnya suplai oksigen. Oleh karena itu, diharapkan dengan pemberian air minum beroksigen dapat menjadi pendamping suplai paru bagi penderita PPOK. Tujuan dari penelitian ini ialah untuk mengevaluasi pengaruh konsumsi air minum beroksigen bagi penderita paru obstruktif kronik terhadap status imun, yaitu CD4, CD8, dan CD56. Intervensi air minum beroksigen dilakukan kepada 16 orang responden terpilih. Intervensi dilakukan dengan mengantarkan air minum beroksigen ke rumah responden selama 21 hari, yaitu 2 botol setiap hari, pada pagi dan sore hari. Setiap botol berisi 385 ml air minum beroksigen dan mengandung 100 ppm oksigen terlarut. Analisis terhadap status imun dilakukan pada sebelum (H0) dan sesudah intervensi (H21) yang diambil dari darah vena responden. Darah vena responden diambil sebanyak 18 ml oleh petugas medis menggunakan venoject dan tabung EDTA steril. Kemudian dianalisis di laboratorium untuk mengetahui perubahan status imun. Analisis status imun dilakukan dengan metode indirect ELISA. Hasil analisis yaitu membandingkan nilai optical density (OD) masing-masing sel imun yang diperoleh dari darah vena sebelum dan sesudah intervensi untuk setiap responden. Hasil analisis menunjukkan bahwa terjadi peningkatan nilai OD dari CD8 dan CD56 secara signifikan (p<0.05), yaitu dengan nilai kenaikan optical density ratarata sebesar 0.571 untuk CD8 dan 0.041 untuk CD56. Selain itu air minum beroksigen juga berpotensi meningkatkan nilai OD dari CD4 namun tidak signifikan (p>0.05), yaitu dengan nilai kenaikan OD rata-rata sebesar 0.001. Peningkatan nilai optical density sel imun menunjukkan peningkatan kadar sel imun. Dengan demikian dapat dikatakan bahwa air minum beroksigen dapat mempengaruhi kadar CD4, CD8, dan CD56 bagi penderita paru obstruktif kronik.
Keyword: CD4, CD8, CD56, COPD, oxygenated water

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