Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 1122 dari 34197, Total: 341964 data)

A Gillespie Algorithm for Non-Markovian Stochastic Processes

Nama Pengarang : Bakken, Jonas,Brevik, Lisbeth M.
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 1)
Nomor Halaman : 95-115
Abstraksi Narasi : The Gillespie algorithm provides statistically exact methods for simulating stochastic dynamics modeled as interacting sequences of discrete events including systems of biochemical reactions or earthquake occurrences, networks of queuing processes or spiking neurons, and epidemic and opinion formation processes on social networks. Empirically, the inter-event times of various phenomena obey long-tailed distributions. The Gillespie algorithm and its variants either assume Poisson processes (i.e., exponentially distributed inter-event times), use particular functions for time courses of the event rate, or work for non-Poissonian renewal processes, including the case of long-tailed distributions of inter-event times, but at a high computational cost. In the present study, we propose an innovative Gillespie algorithm for renewal processes on the basis of the Laplace transform. The algorithm makes use of the fact that a class of point processes is represented as a mixture of Poisson processes with different event rates. The method is applicable to multivariate renewal processes whose survival function of inter-event times is completely monotone. It is an exact algorithm and works faster than a recently proposed Gillespie algorithm for general renewal processes, which is exact only in the limit of infinitely many processes. We also propose a method to generate sequences of event times with a tunable amount of positive correlation between inter-event times. We demonstrate our algorithm with exact simulations of epidemic processes on networks, finding that a realistic amount of positive correlation in inter-event times only slightly affects the epidemic dynamics.

PDAEs in Refined Electrical Network Modeling

Nama Pengarang : Andreas Bartel,Michael Gunther
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 1)
Nomor Halaman : 56-91
Abstraksi Narasi : Modeling with partial differential-algebraic equations is a natural and universal approach valid for various applications with coupled subsystems. This contribution summarizes the state of such models in the simulation of electric circuits; that is, we place known facts and techniques into an overall context. In fact, we mainly discuss the modeling and analysis aspects of several important settings. In the modeling context, we embed the network equations into the context of Maxwell’s equations and address the three main types of coupling: modeling with subsystems of the same type, refined models, and multiphysics. In the analysis context, we address the existence of solutions for these complex systems as well as structural properties as the DAE index (after spatial semidiscretization). For the numerical simulations, we give results for the cosimulation technique (also referred to as dynamic iteration), which is a standard method for coupled systems

Kinerja PNN-Teroptimasi Berbasis Algoritma Genetika dalam Pengenalan Aroma 2 Campuran

Nama Pengarang : Herry
Nama Majalah/Jurnal : Jurnal ilmu komputer dan teknologi informasi
Volume / Nomor Edisi : 3 (No. 2)
Nomor Halaman : 71-76
Abstraksi Narasi : Hal yang harus diperhatikan dalam penggunaan Probabilistic Neural Network (PNN) adalah penentuan struktur jaringan, yaitu penentuan ukuran jaringan dan nilai parameter smoothing. Ukuran jaringan PNN akan semakin besar seiring dengan bertambahnya jumlah data pelatihan yang mengakibatkan biaya komputasi juga semakin tinggi. Sementara nilai parameter smoothing akan mempengaruhi tingkat klasifikasi dimana nilai yang optimal tergantung pada karakteristik data. Algoritma PNN-Teroptimasi (PNN-T) adalah algoritma yang dikembangkan untuk menentukan struktur PNN yang optimal. Dalam PNN-T, nilal parameter smoothing yang optimal dipilih dengan menggunakan Algoritma Genetika, sedangkan ukuran jaringan ditekan dengan memilih neuron yang representatif menggunakan Algoritma Orthogonal. Dilakukan perbandingan antara PNN dengan PNN-T dalam masalah pengenalan aroma 2 campuran. Dau hasilnya PNN-T mempunyai kinerja yang lebih baik yaitu tingkat pengenalan lebih tinggi dan penggunaan neuron dengan jumlah lebih rendah dibandingkan PNN.

Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton’s Method

Nama Pengarang : Sumardi
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 1)
Nomor Halaman : 3-55
Abstraksi Narasi : The l2 normalized inverse, shifted inverse, and Rayleigh quotient iterations are classic algorithms for approximating an eigenvector of a symmetric matrix. This work establishes rigorously that each iterate produced by one of these three algorithms can be viewed as a Newton’s method iterate followed by a normalization. The equivalences given here are not meant to suggest changes to the implementations of the classic eigenvalue algorithms. However, they add further understanding to the formal structure of these iterations, and they provide an explanation for their good behavior despite the possible need to solve systems with nearly singular coefficient matrices. A historical development of these eigenvalue algorithms is presented. Using our equivalences and traditional Newton’s method theory helps to gain understanding as to why normalized Newton’s method, inverse iteration, and shifted inverse iteration are only linearly convergent and not quadratically convergent, as would be expected, and why a new linear system need not be solved at each iteration. We also give an explanation as to why our normalized Newton’s method equivalent of Rayleigh quotient iteration is cubically convergent and not just quadratically convergent, as would be expected

Bayes Meets Krylov: Statistically Inspired Preconditioners for CGLS

Nama Pengarang : D. Calvetti,F. Pitolli,E. Somersalo,B. Vantaggi
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 2)
Nomor Halaman : 429-461
Abstraksi Narasi : The solution of linear inverse problems when the unknown parameters outnumber data requires addressing the problem of a nontrivial null space. After restating the problem within the Bayesian framework, a priori information about the unknown can be utilized for determining the null space contribution to the solution. More specifically, if the solution of the associated linear system is computed by the conjugate gradient for least squares (CGLS) method, the additional information can be encoded in the form of a right preconditioner. In this paper we study how the right preconditioner changes the Krylov subspaces where the CGLS iterates live, and we draw a tighter connection between Bayesian inference and Krylov subspace methods. The advantages of a Bayes-meets-Krylov approach to the solution of underdetermined linear inverse problems is illustrated with computed examples.

Designing Modular Software: A Case Study in Introductory Statistics

Nama Pengarang : -
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 3)
Nomor Halaman : 493-500
Abstraksi Narasi : Modular programming Is a development paradigm that emphasizes self-conta1ne · d fl , ex1 "bl e, an d · , d _ n epenARTICLE HISTORY Received February 2016 Revised December 2016 dent pieces of functionality. This practice allows new features to be seamlessly added when d : es,red, and unwanted· features to be removed thus simplifying the software's user Interface. The recent nse of webbase.d software applications has p;esented new challenges for designing an extensible, modular software system. In this article, we outline a framework for designing such system, with a focus on reproduc1b1l1ty of the results. We present as a case study a Shiny-based web appl1cat1on called intro, that allows the user to perform basic data analyses and statistical routines. Finally, we hlghlight some challenges we encountered, and how to address them, when combining modular programming concepts with reactive programming as used by Shiny. Supplementary material for this article is available on line.

Pengoptimalan Potensi Biogas Di Dusun Ngemplak, Selo, Boyolali Sebagai Alternatif Mengatasi Illegal Logging Kawasan Gunung Merbabu Dengan Metode Kampung Biogas Dalam Rangka Mewujudkan Dusun Percontohan Biogas Se-Provinsi Jawa Tengah

Nama Pengarang : Rayendra Anandika,Siska Aditya,Atik Muttaqin,Satwika Matahari Adyutawati,Wijaya
Nama Majalah/Jurnal : Jurnal Saintifika Universitas Gadjah Mada
Volume / Nomor Edisi : II (No. 1)
Nomor Halaman : 68-75
Abstraksi Narasi : Dusun Ngemplak berlokasi di kawasan Gunung Merbabu, Boyolali, Jawa Tengah. Di dusun tersebut, illegal logging sudah sering dilakukan untuk mencukupi kebutuhan kayu bakar. Apabila kegiatan tersebut dilakukan terus-menerus sampai di masa yang akan dating, bencana akan mengancam wilayah tersebut. Atas dasar realitas tersebut, program ini memberikan solusi untuk mengatasi illegal logging dengan memanfaatkan sumber daya alam setempat yang belum termanfaatkan. Limbah sapi yang belum termanfaatkan menjadi salah satu prospek untuk mengganti bahan bakar dari kayu bakar ke biogas. Sebanyak 17 instalasi biogas dari 41 rumah sudah dibangun di dusun tersebut. Dengan banyaknya instalasi biogas yang sudah dibangun di wilayah tersebut, maka daerah tersebut diberi nama Kampung Biogas, sebuah dusun yang mandiri energi dan berkelanjutan. Dari proses terbentuknya Kampung Biogas, warga di dusun Ngemplak sudah mahir dalam pembuatan biogas. Oleh karena itu, dari konsep yang telah matang, warga mendirikan `Perusahaan Kampung Biogas` dengan menawarkan jasa berupa penginstalan biogas dan pelatihan instalasi biogas bagi wilayah lain yang memiliki potensi dan tertarik membangun instalasi biogas. Penawaran dilakukan melalui sarana brosur, website, seminar atau pameran nasional maupun internasional, dan penyebaran profil desa ke perangkat desa lain. Hal ini diharapkan akan mampu menyebarkan pengetahuan mengenai biogas dan mampu menginspirasi terbentuknya kampung-kampung biogas baru di daerah lain.

Model Choice and Diagnostics for Linear Mixed-Effects Models Using Statistics on Street Corners

Nama Pengarang : -
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 3)
Nomor Halaman : 478-492
Abstraksi Narasi : The complexity of linear mixed-effects (LME) models means that traditional diagnostics are rendered less effective. This Is due to a breakdown of asymptotic results, boundary issues, and visible patterns in residual plots that a re introduced by the model fitting process. Some of these issues a re well known and adjustments have been proposed. Working with LME models typically requires that the analyst keeps track of all the special circumstances that may arise. In this article, we illustrate a simpler but generally applicable approach to diagnosing LME models. We explain how to use new visual inference methods for these purposes. The approach provides a unified framework for diagnosing LME fits and for model selection. We illustrate the use of this approach on several commo.nly available datasets. A large-scale Amazon Turk study was used to validate the methods. R code is provided for the analyses. Supplementary materials for this article are available online.

On the Metric s–t Path Traveling Salesman Problem

Nama Pengarang : Zhihan Gao
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 2)
Nomor Halaman : 409-426
Abstraksi Narasi : We study the metric s–t path traveling salesman problem (TSP). An, Kleinberg, and Shmoys [Proceedings of the 44th ACM Symposium on Theory of Computing, 2012, pp. 875– 886] improved on the long-standing 5/3 -approximation factor and presented an algorithm that achieves an approximation factor of 1+√5 2 ≈ 1.61803. Later, Seb?o [Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization, 2013, pp. 362– 374] further improved the approximation factor to 8/5 . We present a simple, self-contained analysis that unifies both results; our main contribution is a unified correction vector. Additionally, we compare two different linear programming (LP) relaxations of the s–t path TSP, namely, the path version of the Held–Karp LP relaxation for the TSP and a weaker LP relaxation, and we show that both LPs have the same (fractional) optimal value. Also, we show that the minimum cost of integral solutions of the two LPs are within a factor of 3/2 of each other. Furthermore, we prove that a half-integral solution of the stronger LP relaxation of cost c can be rounded to an integral solution of cost at most 3/2 c. Finally, we give an example that presents obstructions to two natural methods that aim for an approximation factor of 3/2 .

Perancangan dan Pembuatan Digital Voice Scrambler untuk Komunikasi Komputer Pribadi

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal ilmu komputer dan teknologi informasi
Volume / Nomor Edisi : 3 (No. 1)
Nomor Halaman : 64-70
Abstraksi Narasi : Makalah ini akan membahas mengenai perancangan dan implementasi suatu sistem pengacak suara dan dapat menyusun kembali informasi suara yang telah diacak. Pengacak suara ini dibuat berbasiskan digital, dimaksudkan untuk dapat berkomunikasi dengan aman, bebas dari penyadapan pihak yang tidak berkepentingan. Suara manusia diubah menjadi sinyal listrik oleh mikrofon. Setelah dikuatkan, dilewatkan pada rangkaian LPF (Low Pass Filter). Kemudian dikonversikan menjadi data digital oleh ADC (Analog to Digital Converter). Setelah data digital tersebut diacak, dikirimkan ke komputer lainnya. Oleh komputer penerima, data tersebut diterjemahkan kembali. Setelah didapat data digital aslinya, oleh DAC (Digital to Analog Converter), data tersebut dikonversikan menjadi sinyal analog dan dilewatkan pada rangkaian LPF. Kemudian sinyal ini diubah kembali menjadi suara oleh speaker. Metoda yang digunakan dalam proses pengacakan adalah metoda substitusi. Data digital yang digunakan sebesar 8 bit. Dari hasil pengujian, sistem dapat berfungsi dengan baik yaitu untuk mengacak sinyal informasi yang dikirimkan dan mengembalikan sinyal yang teracak menjadi sinyal informasi yang sebenarnya. Dari hasil pengacakan, suara aslinya tidak dapat didengar melainkan yang terdengar hanya suara derau. yang dihasilkan kurang baik dikarenakan ADC yang digunakan hanya 8 bit. Sistem pengacak suara digital ini diharapkan dapat digunakan sebagai salah satu alternatif untuk dapat berkomunikasi secara aman.
← Kembali ke Halaman Utama