Judul: Analyze of Systems Data Communication and Public Information in the Bureau of Meteorology, Climatology, and Geophysics (BMKG) Region III, Denpasar.
Abstrak: Latar belakang penelitian ini adalah pentingnya proses penyampaian suatu informasi sehingga pengolahan data harus diperhatikan. Tujuan dari penelitian ini yaitu menganalisis sistem dan pola komunikasi data dan informasi BMKG III kepada publik serta menganalisis keterkaitan stakeholders dalam kebutuhan akan data dan informasi. Metode yang digunakan untuk menganalisis proses komunikasi data dan informasi publik di BMKG III adalah membandingkan keadaan aktual dengan teori proses komunikasi. Sedangkan metode yang digunakan untuk analisis peran dan kepentingan stakeholders menunjukkan bagaimana tindakan stakeholders terhadap hubungan dengan suatu organisasi. Pelayanan data dan informasi BMKG melalui beberapa tahap diantaranya BMKG memiliki ide untuk menyampaikan pesan meteorologi, klimatologi, dan geofisika. Ide dan gagasan ini diatur dalam UU RI No 31 tentang Meteorologi, Klimatologi, dan Geofisika. Tahap selanjutnya BMKG mengubah ide (data) menjadi informasi. Data yang telah dikumpulkan, diidentifikasi menurut jenis datanya. Penyampaian data dan informasi kepada masyarakat dapat melalui buletin, internet, televisi, ataupun radio. Para pengguna jasa (stakeholders) yang telah mendapatkan informasi dari BMKG dapat memberikan umpan balik berupa laporan penelitian, informasi kunjungan wisatawan, ataupun saran serta kritik terhadap kinerja BMKG. Saat ini BMKG dinilai lemah dalam memberikan layanan informasi kepada masyarakat. Hal ini disebabkan kurang memadainya peralatan dan kurang inovatif dalam memperluas jangkauan masyarakat.
Keyword: 

Judul: Design and Development of Web-based Meteorological Data Dissemination Information System at Meteorological Research and Education Station, IPB University
Abstrak: Sistem informasi diseminasi adalah salah satu cara yang mudah dan efektif menyebarkan data meteorologi kepada pengguna. Penelitian ini bertujuan merancang dan mengembangkan sistem informasi diseminasi data meteorologi pada Stasiun Meteorologi Riset dan Pendidikan, IPB University berbasis web. Metode pengembangan sistem menggunakan System Development Life Cycle (SDLC) dengan model waterfall. Tahapan SDLC, diawali analisis kebutuhan sistem dan pengguna, merancang desain konseptual dan fisik, implementasi dan instalasi sistem, pengujian dan evaluasi sistem, dan prosedur pemeliharaan. Penelitian ini menghasilkan sistem yang dapat memberikan akses data meteorologi dengan berbagai konfigurasi dan menampilkan data real-time dalam bentuk dashboard. Sistem diimplementasikan dalam bentuk website yang dibangun menggunakan framework Laravel. Fungsi akses data dilakukan dengan memproses request dari pengguna menggunakan query builder dan merespon dalam bentuk output file *.xlsx dan *.csv. Fungsi monitoring menampilkan data dari database dengan menggunakan query builder berupa tampilan dashboard dengan grafik yang berubah secara real-time. Pengujian sistem dengan metode System Usability Scale (SUS) menghasilkan nilai sebesar 80,83 dengan grade B atau excellent yang menunjukkan sistem dapat diterima oleh pengguna. Evaluasi untuk pengembangan sistem memerlukan analisis dengan cakupan pengguna yang lebih beragam., Dissemination information system is one of the easy and effective ways to distribute meteorological data to users. This research aims to design and develop a web-based meteorological data dissemination information system at the Meteorology Research and Education Station, IPB University. The system development method uses the System Development Life Cycle (SDLC) with a waterfall model. The SDLC stages begin with the analysis of system and user requirements, followed by designing the conceptual and physical structures, system implementation and installation, system testing and evaluation, and maintenance procedures. This research results in a system that provides meteorological data access with various configurations and displays real-time data in the form of a dashboard. The system is implemented as a website built using the Laravel framework. The data access functions are performed by processing user requests using the query builder and responding in the form of *.xlsx and *.csv output files. The monitoring function displays data from the database using the query builder, presenting it in a dashboard view with real-time graphs. The system testing, conducted using the System Usability Scale (SUS) method, yielded a score of 80,83 with a grade of B, indicating an excellent level of user acceptance. Evaluation for system development requires analysis with a more diverse user scope.
Keyword: climate data, meteorological station, SDLC, system usability scale, waterfall model

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