| Nama Pengarang | : | Nawaf Bou-Rabee |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 60 (No. 2) |
| Nomor Halaman | : | 386-406 |
| Abstraksi Narasi | : | The numerical solution of stochastic partial differential equations (SPDEs) presents challenges not encountered in the simulation of PDEs or SDEs. Indeed, the roughness of the noise in conjunction with nonlinearities in the drift typically make it difficult to construct, operate, and validate numerical methods for SPDEs. This is especially true if one is interested in path-dependent expected values, long-time simulations, or in the simulation of SPDEs whose solutions have constraints on their domains. To address these numerical issues, this paper introduces a Markov jump process approximation for SPDEs, which we refer to as the spectral random walk method (SPECTRWM). The accuracy and ergodicity of SPECTRWM are verified in the context of a heat and an overdamped Langevin SPDE, respectively. We also apply the method to Burgers and KPZ SPDEs. The article includes a MATLAB implementation of SPECTRWM. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Journal of Computational and Graphical Statistics |
| Volume / Nomor Edisi | : | 26 (No. 3) |
| Nomor Halaman | : | 469-477 |
| Abstraksi Narasi | : | Boxplots are useful displays that convey rough information about the distribution of a variable. Boxplots were designed to be drawn by hand and work best for small datasets, where detailed estimates of tail behavior beyond the quartiles may not be trustworthy. Larger datasets afford more precise estimates of tail behavior, but boxplots do not take advantage of this precision, instead presenting large numbers of extreme, though not unexpected, observations. Letter-value plots address this problem by including more detailed informati'on about the tails using "letter values," an order statistic defined by Tukey. Boxplots display the first two .letter values (rhe median and quartiles'); letter-value plots displc1y further letter values so far as they are reliable estimates of their corresponding quantiles. We illustrate letter-value plots with real data that demonstrate their usefulness for large datasets. All graphic$ are created using the R package lvplot, and code and data are available in the supplementary materials. |
| Nama Pengarang | : | Sanghyeon Yu,Habib Ammari |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 60 (No. 2) |
| Nomor Halaman | : | 356-385 |
| Abstraksi Narasi | : | When metallic (or plasmonic) nanospheres are nearly touching, strong concentration of light can occur in the narrow gap regions. This phenomenon has potential applications in nanophotonics, biosensing, and spectroscopy. Understanding the strong interaction between the plasmonic spheres turns out to be quite challenging; indeed, an extremely high computational cost is required to compute the electromagnetic field. Also, the classical method of image charges, which is effective for the dielectric spheres system, is not valid for plasmonic spheres because of their negative permittivities. Here we develop new analytical and numerical methods for the plasmonic spheres system by clarifying the connection between transformation optics and the method of image charges. We derive fully analytic solutions valid for two plasmonic spheres. We then develop a hybrid numerical scheme for computing the field distribution produced by an arbitrary number of spheres. Our method is highly efficient and accurate even in the nearly touching case and is valid for plasmonic spheres. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal ilmu komputer dan teknologi informasi |
| Volume / Nomor Edisi | : | 3 (No. 1) |
| Nomor Halaman | : | 54-63 |
| Abstraksi Narasi | : | Penelitian ini membahas teknologi streaming audio dalam format MP3 (MPEG Audio Layer 3) dan implementasinya pada sistem radio internet. Teknologi streaming audio memungkinkan pengiriman siaran dapat dilakukan secara kontinu melalui internet, sehingga teknologi ini merupakan dasar dari radio internet. Sistem radio internet terdiri dari 3 komponen utama, yaitu encoder, streaming server dan streaming player. Encoder berfungsi mengkonversi input siaran ke dalam format streaming audio, Sedangkan streaming server berfungsi sebagai repeater yang mengirimkan streaming audio tersebut ke streaming player. Ketiga komponen ini bekerja secara real time untuk menghasilkan siaran radio internet. Bandwidth merupakan persoalan yang harus diperhatikan dalam sistem radio internet karena berhubungan dengan biaya dan kualitas suara. Hasil evaluasi sistem radio internet menujukkan bahwa untuk aspek reliability, efficiency dan kualitas suara sangat tergantung dengan infrastruktur jaringan internet. |
| Nama Pengarang | : | WILSON, HUON,KEICH, URI |
| Nama Majalah/Jurnal | : | Journal of Computational and Graphical Statistics |
| Volume / Nomor Edisi | : | 26 (No. 1) |
| Nomor Halaman | : | 223-229 |
| Abstraksi Narasi | : | Accurately computing very small tail probabilities of a sum of independent and identically distriputed lattice·valued random variables is numerically challenging. The only general purpose algorithms that can guarantee the desired accuracy have a quadratic runtime complexity that js often too slow. While fast Fourier transform (FFT)-based convolutions have an essentially linear runtime complexity, they can introduce overwhelming roundoff errors. We present sisFFT (segmented Iterated shifted FFT), which harnesses the speed of FFT while retaining control of the relative error of the computed tail probability. We rigorously prove the method's accuracy and we empirically demonstrate its significant speed advantage over existing accurate methods. Finally, we show that sisFFT sacrifices very little, if any, speed when FFT-pased convolution is sufficiently accurate to begin with. Supplementary material Is available online. |
| Nama Pengarang | : | Bailey K. Fosdick,Daniel B. Larremore,Joel Nishimura,Johan Ugander |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 60 (No. 2) |
| Nomor Halaman | : | 315-355 |
| Abstraksi Narasi | : | Random graph null models have found widespread application in diverse research communities analyzing network datasets, including social, information, and economic networks, as well as food webs, protein-protein interactions, and neuronal networks. The most popular random graph null models, called configuration models, are defined as uniform distributions over a space of graphs with a fixed degree sequence. Commonly, properties of an empirical network are compared to properties of an ensemble of graphs from a configuration model in order to quantify whether empirical network properties are meaningful or whether they are instead a common consequence of the particular degree sequence. In this work we study the subtle but important decisions underlying the specification of a configuration model, and we investigate the role these choices play in graph sampling procedures and a suite of applications. We place particular emphasis on the importance of specifying the appropriate graph labeling---stub-labeled or vertex-labeled---under which to consider a null model, a choice that closely connects the study of random graphs to the study of random contingency tables. We show that the choice of graph labeling is inconsequential for studies of simple graphs, but can have a significant impact on analyses of multigraphs or graphs with self-loops. The importance of these choices is demonstrated through a series of three in-depth vignettes, analyzing three different network datasets under many different configuration models and observing substantial differences in study conclusions under different models. We argue that in each case, only one of the possible configuration models is appropriate. While our work focuses on undirected static networks, it aims to guide the study of directed networks, dynamic networks, and all other network contexts that are suitably studied through the lens of random graph null models. |
| Nama Pengarang | : | L´eon Bottou,Frank E. Curtis,Jorge Nocedal |
| Nama Majalah/Jurnal | : | Siam Review |
| Volume / Nomor Edisi | : | 60 (No. 2) |
| Nomor Halaman | : | 223-311 |
| Abstraksi Narasi | : | This paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what makes them challenging. A major theme of our study is that large-scale machine learning represents a distinctive setting in which the stochastic gradient (SG) method has traditionally played a central role while conventional gradient-based nonlinear optimization techniques typically falter. Based on this viewpoint, we present a comprehensive theory of a straightforward, yet versatile SG algorithm, discuss its practical behavior, and highlight opportunities for designing algorithms with improved performance. This leads to a discussion about the next generation of optimization methods for large-scale machine learning, including an investigation of two main streams of research on techniques that diminish noise in the stochastic directions and methods that make use of second-order derivative approximations |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Journal of Computational and Graphical Statistics |
| Volume / Nomor Edisi | : | 26 (No. 1) |
| Nomor Halaman | : | 217-222 |
| Abstraksi Narasi | : | Mixture distributions arise in many application areas, for example, as marginal distributions or convolutions of distributions. We present a method of constructing an easily tractable discrete mixture distribution as an approximation to a mixture distribution with a large t.o infinite number, discrete or continuous, of components. The proposed DIRECT (divergence restricting conditional tesselation) algorithm is set up such that a prespecified precis1on, defined in terms of Kullback-Leibler divergence between true distribution and approximation, Is guaranteed. Application of the algorithm is demonstrated in two examples. Supplementary materials for this article are avallable online. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal ilmu komputer dan teknologi informasi |
| Volume / Nomor Edisi | : | 3 (No. 1) |
| Nomor Halaman | : | 42-53 |
| Abstraksi Narasi | : | In this paper, we present a new neural network scheme for 3D shape reconstruction. This scheme, named as Smooth Projected Polyhedron Representation Neural Network (SPPRNN), can successively refine polyhedron's vertices parameter of an initial 3D shape based on depth maps of several shaded images taken from multiple views. We considered the depth maps obtained by deploying Tsai-Shah shape-from-shading (SFS) algorithm as partial 3D shapes of the object to be reconstructed. The task is to reconstruct a complete representation of a given object from only a limited number of views and erroneous SFS depth maps. We investigate the effectiveness of this scheme through experiment of reconstructing a mannequin object from its images. The reconstruction result is evaluated for each view by comparing mean square error of the depth maps recovered by the proposed scheme and the depth maps recovered by the SFS method alone, in comparison with true depth obtained by 3D scanner. It is experimentally shown that through hierarchical reconstruction and annealing reinforcement strategies our system gives more exact results. In addition, it corrects and smoothly fuses the erroneous SFS depth-maps. |
| Nama Pengarang | : | H. Suhartanto,K. Burrage |
| Nama Majalah/Jurnal | : | Jurnal ilmu komputer dan teknologi informasi |
| Volume / Nomor Edisi | : | 3 (No. 1) |
| Nomor Halaman | : | 27-41 |
| Abstraksi Narasi | : | There have been extensive discussions on the parallelism of solving Initial Value Problems (IVPs) for Ordinary Differential Equations (ODEs), however the implementation as codes available to users have been generally lacking. In particular, parallel codes which use Multistep Runge-Kutta (MRK) methods still do not exist. This paper describes the development of a Parallel Non-stiff solver which is based on parallel iterated techniques using MRK methods. The code has the capability of providing several types of MRK methods including Implicit Runge-Kutta (IRK) methods of Radau type. The numerical results show the effectiveness of the method particularly on expensive problems, both in parallel and sequentially, when compared to available codes such as VODE and RKSUITE. |