Hasil Pencarian  ::  Simpan CSV :: Kembali

"

Informasi mengenai penggunaan energi listrik merupakan salah satu elemen penting dalam hal pengaturan distribusi jaringan listrik pada jaringan pintar skala kecil (smart micro grid). Selain itu informasi pemakaian energi listrik dapat membantu konsumen melakukan proses evaluasi pemakaian energi listrik untuk menekan biaya tagihan pembayaran listrik yang secara tidak langsung berpengaruh pada efisensi energi keseluruhan. Salah satu metode dalam proses pemantauan pemakaian energi listrik adalah Non-Intrusive Load Monitoring (NILM). Permasalahan utama dalam NILM adalah mengetahui peralatan-peralatan elektronik yang ada dan mengetahui konsumsi energi listrik masing-masing peralatan dengan hanya melakukan proses pengambilan data hanya dari satu titik yang terhubung dengan semua peralatan elektronik pada jaringan listrik. Berdasarkan hasil pengujian menggunakan dataset AMPds dan REDD, nilai akurasi terendah yang didapatkan adalah sebesar 96,69% pada semua pengujian yang dilakukan.

 

---

Information on electricity consumption is one of the essential elements in terms of regulating the distribution of electricity in smart micro grid. Besides, information on electricity consumption can help consumers carry out an evaluation process to reduce electricity bill costs, which indirectly affect overall energy efficiency. One method in the process of monitoring electricity consumption is Non-Intrusive Load Monitoring (NILM). The main problem in NILM is electronic disaggregation equipment that exists and determines the electrical energy consumption of each appliance by merely performing the retrieval of data from only one point connected with all the electronic devices on the electrical grid. Based on the results of tests conducted using the REDD and AMPds dataset, the lowest accuracy was 96.69% for all tests performed.

 

"

"This book focuses on the different steps involved in the conception, implementation and application of EDAs that use Markov networks, and undirected models in general. It can serve as a general introduction to EDAs but covers also an important current void in the study of these algorithms by explaining the specificities and benefits of modeling optimization problems by means of undirected probabilistic models.All major developments to date in the progressive introduction of Markov networks based EDAs are reviewed in the book. Hot current research trends and future perspectives in the enhancement and applicability of EDAs are also covered. The contributions included in the book address topics as relevant as the application of probabilistic-based fitness models, the use of belief propagation algorithms in EDAs and the application of Markov network based EDAs to real-world optimization problems. "

"[This book summarizes a line of research that maps certain classical problems of discrete mathematics and operations research, such as the Hamiltonian cycle and the Travelling Salesman problems, into convex domains where continuum analysis can be carried out., This book summarizes a line of research that maps certain classical problems of discrete mathematics and operations research, such as the Hamiltonian cycle and the Travelling Salesman problems, into convex domains where continuum analysis can be carried out.]"

"ABSTRAKAlgoritma Markov Clustering adalah algoritma pengelompokan yang banyak digunakan pada bidang bioinformatik. Operasi utama pada algoritma ini adalah operasi ekspansi. Pada operasi ekspansi dilakukan perkalian dua buah matriks. Karena data pada bidang bioinformatik umumnya berukuran sangat besar dan memiliki tingkat sparsity yang sangat tinggi, diperlukan metode untuk menghemat penggunaan memori dan mempercepat proses komputasi. Sementara itu, Graphics Processing Unit (GPU) berkembang menjadi suatu platform komputasi paralel dengan performa yang lebih baik dari pada Central Processing Unit (CPU). Pada skripsi ini data yang diproses disimpan dalam bentuk sparse matriks ELL-R dan perkalian matriks yang dilakukan menggunakan Sparse Matrix Matrix Product (SpMM) ELL-R. SpMM ELL-R dibuat dengan melakukan Sparse Matrix Vector Product (SpMV) ELL-R beberapa kali. Algoritma MCL yang dibuat menggunakan komputasi paralel dengan GPU.

---

ABSTRACTMarkov Clustering Algorithm is a clustering algorithm that used often in bioinformatics. The main operation of this algorithm is expand operation. The multiplication of two matrix was done in expand operation. Because data processed in bioinformatics usually have a vast amount of information and have high sparsity, a method to save memory usage and make the computating process faster is needed. Meanwhile, Graphics Processing Unit (GPU) developed into a parallel computing platform with better performance compared to Central Processing Unit (CPU). In this skripsi, processed data stored using ELL-R sparse matrix and matrix multiplication done using Sparse Matrix Matrix Product (SpMM) ELL-R. SpMM ELL-R made by doing Sparse Matrix Vector Product (SpMV) ELL-R several times. MCL Algorithm made using parallel computing with GPU."

"Hidden Markov models (HMMs) are discrete-state, discrete-time, stochastic dynamical systems. They are often used to approximate systems with continuous state spaces operating in continuous time. In addition to introducing the basic ideas of HMMs and algorithms for using them, this book explains the derivations of the algorithms with enough supporting theory to enable readers to develop their own variants. The book also presents Kalman filtering as an extension of ideas from basic HMMs to models with continuous state spaces.Although applications of HMMs have become numerous (396,000 Google hits) since they emerged as the key technology for speech recognition in the 1980s, no introductory book on HMMs in general is available. This text aims to fill that gap.Hidden Markov Models and Dynamical Systems features illustrations that use the Lorenz system, laser data, and natural language data. The concluding chapter presents the application of HMMs to detecting sleep apnea in experimentally measured electrocardiograms. Algorithms are given in pseudocode in the text, and a working implementation of each algorithm is available on the accompanying website."