Pencarian Artikel Jurnal & Majalah

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

Circulant Embedding of Approximate Covariances for Inference From Gaussian Data on Large Lattices

Nama Pengarang : GUINNESS, JOSEPH,FUENTES, MONTSERRAT
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 88-97
Abstraksi Narasi : Recently proposed computationally efficient Markov chain Monte Carlo (MCMC) and Monte Carlo expectation-maximization (EM) methods for estimating covariance parameters from lattice data rely on successive imputations of values on an embedding lattice that is at least two times larger in each dimension, These methods can be considered exact in some sense, but we demonstrate that using such a large number of imputed values leads to slowly converging Markov chains and EM algorithms. We propose instead the use of a discrete spectral approximation to allow for the implementation of these methods on smaller embedding lattices. While our methods are approximate, our examples indicate that the error introduced by this approximation is small compared to the Monte Carlo errors present in long Markov chains or many iterations of Monte Carlo EM algorithms. Our results are demonstrated in simulation studies, as well as in numerical studies that explore both increasing domain and fixed domain asyrnptotics. We compare the exact methods to our approximate methods on a large satellite dataset, and show that the approximate methods are also faster to compute, especially when the aliased spectral density is modeled directly. Supplementary materials for this article are available online.

Sampling for Conditional Inference on Contingency Tables

Nama Pengarang : CHEN, YUGUO,EISINGER, ROBERT D.
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 79-87
Abstraksi Narasi : We propose new sequential importance sampling methods for sampling contingency tables with given margins . The proposal for each method is based on asymptotic approximations· to the number of tables with fixed margins. These methods generate tables that are very close to the uniform qistribution. The tables, along with their importance weights, can be used to approximate the null distribution oftest statistics and calculate the total number of tables. We apply the methods to a number of examples and demonstrate an Improvement over other methods in a variety of real problems. Supplementa?y materials are available online.

Luck and Law: Quantifying Chance in Fantasy Sports and Other Contests

Nama Pengarang : Margaret Fielding RSH,Daniel Getty,Masayuki Yano,A. E. Hosoi,Charles Gao
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 4)
Nomor Halaman : 869-887
Abstraksi Narasi : Fantasy sports have experienced a surge in popularity in the past decade. One of the consequences of this recent rapid growth is increased scrutiny surrounding the legal aspects of the games, which typically hinge on the relative roles of skill and chance in the outcome of a competition. While there are many ethical and legal arguments that enter into the debate, the answer to the skill versus chance question is grounded in mathematics. Motivated by this ongoing dialogue we analyze data from daily fantasy competitions played on FanDuel during the 2013 and 2014 seasons and propose a new metric to quantify the relative roles of skill and chance in games and other activities. This metric is applied to FanDuel data and to simulated seasons that are generated using Monte Carlo methods; results from real and simulated data are compared to an analytic approximation which estimates the impact of skill in contests in which players participate in a large number of games. We then apply this metric to professional sports, fantasy sports, cyclocross racing, coin flipping, and mutual fund data to determine the relative placement of all of these activities on a skill-luck spectrum.

Potensi Krim Yang Mengandung Growth Factor Terhadap Kecepatan Kesembuhan Luka Pada Anjing

Nama Pengarang : Diah Septyadari,Halim Saptadi,Septianingrum Dwi Lestari,Novida,Ayu Winda Sara Prananda
Nama Majalah/Jurnal : Jurnal Saintifika Universitas Gadjah Mada
Volume / Nomor Edisi : II (No. 1)
Nomor Halaman : 1-6
Abstraksi Narasi : Growth factor merupakan keluarga polipeptida yang berperan diantaranya yaitu merangsang makrofag untuk mensekresi collagenase, mendegradasi matriks selama tahap renovasi, merangsang keratinocyte dan proliferasi fibroblast, dan dapat mempercepat waktu penyembuhan luka. Penelitian ini bertujuan untuk memanfaatkan limbah media kultur sel dengan kandungan growth factor tinggi sehingga dapat digunakan sebagai produk obat yang berpotensi untuk mempercepat kesembuhan luka dengan pemanfaatan nanobioteknologi. Penelitian dibagi dalam tiga tahap penelitian yaitu tahap pra penelitian, dan tahap pasca penelitian. Penelitian ini menggunakan 4 ekor anjing (Canine domesticus) dengan berat badan 10-14 kg yang diperoleh dari agen penjualan anjing, Ganjuran, Yogyakarta. Keempat anjing tersebut pada bagian punggungnya dibuat luka sebanyak lima daerah berukuran 3x0,5 cm dan kedalamannya hingga dermis. Sebelum pembuatan luka anjing dipuasakan selama 12 jam. Luka pada punggung anjing diberi perlakuan yang berbeda pada tiap wilayah. Wilayah pertama tidak diberi apapun karena sebagai kontrol, wilayah kedua diberi perlakuan dengan mengoleskan cream B, wilayah ketiga diberi perlakuan dengan mengoleskan krim berisi growth factor dengan konsentrasi yang rendah yaitu 1,5 cc dalam 5 gram biocream®, wilayah keempat diberi perlakuan dengan mengoleskan krim berisi growth factor dengan konsentrasi sedang yaitu 3 cc dalam 5 gram biocream®, dan wilayah kelima diberi perlakuan dengan mengoleskan krim berisi growth factor dengan konsentrasi yang tinggi, 4,5 cc dalam 5 gram biocream®. Sesudah pembuatan luka, anjing dipakaikan Elizabeth Collar untuk menghindari anjing menjilat lukanya. Luka diolesi krim sehari sekali. Pengamatan dan pengukuran kesembuhan luka yang meliputi panjang dan lebar luka dilakukan selama 14 hari. Hasil penelitian dianalisis secara deskriptif dan data diolah menggunakan SPSS 16.0 analyze one-WAY ANOVA dengan uji tukey LSD Test. Data statistik menunjukkan bukti adanya pengaruh pemberian krim yang mengandung growth factor terhadap kecepatan kesembuhan luka anjing. Hasil untuk anjing endhol, kambing, dan moi signifikan (p<0,05). Untuk anjing bobo menunjukkan tidak signifikan (p>0,05). Hasil gambaran remodelling struktur kesembuhan kulit menunjukkan bahwa krim II terbukti mempercepat kesembuhan luka dan menghasilkan konstruksi yang lebih baik (tidak menimbulkan keloid atau scar yang luas) dari kontrol, cream B serta kedua krim lainnya.

Imposing Minimax and Quantile Constraints on Optimal Matching in Observational Studies

Nama Pengarang : ROSENBAUM, PAUL R.
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 66-78
Abstraksi Narasi : Modern methods construct a matched sample by minimizing the total cost of a flow in a network, finding a pairing of treated and control individuals that minimizes the sum of within-pair covariate distances subject to constraints that ensure distributions of covariates are balanced. In aggregate, these methods work well; however, they can exhibit a lack of interest in a small number of pairs with large covariate distances. Here, a new method is proposed for imposing a minimax constraint on a minimum total distance matching. Such a match minimizes the total within-pair distance subject to various constraints including the constraint that the maximum pair difference is as small as possible. In an example with 1391 matched pairs, this constraint eliminates dozens of pairs with moderately large differences in age, but otherwise exhibits the same excellent covariate balance found without this additional constraint. A minimax constraint eliminates edges in the network, and can improve the worst-case time bound for the performance of the minimum cost flow algorithm, that is, a better match from a practical perspective may take less time to construct. The technique adapts ideas for a different problem, the bottleneck assignment problem, whose sole objective is to minimize the maximum within-pair difference; however, here, that objective becomes a constraint on the minimum cost flow problem. The method generalizes. Rather than constrain the maximum distance, it can constrain an order statistic. Alternatively, the method can minimize the maximum difference in propensity scores, and subject to doing that, minimize the maximum robust Mahalanobis distance. An example from labor economics is used to illustrate. Supplementary materials for this article are available online.

The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale

Nama Pengarang : Mark Gates,Jack Dongarra,Azzam Haidar,Jakub Kurzak,Piotr Luszczek,Stanimire Tomov,Ichitaro Yamazaki
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 4)
Nomor Halaman : 808-865
Abstraksi Narasi : The computation of the singular value decomposition, or SVD, has a long history with many improvements over the years, both in its implementations and algorithmically. Here, we survey the evolution of SVD algorithms for dense matrices, discussing the motivation and performance impacts of changes. There are two main branches of dense SVD methods: bidiagonalization and Jacobi. Bidiagonalization methods started with the implementation by Golub and Reinsch in Algol60, which was subsequently ported to Fortran in the EIS-PACK library, and was later more efficiently implemented in the LINPACK library, targeting contemporary vector machines. To address cache-based memory hierarchies, the SVD algorithm was reformulated to use Level 3 BLAS in the LAPACK library. To address new architectures, ScaLAPACK was introduced to take advantage of distributed computing, and MAGMA was developed for accelerators such as GPUs. Algorithmically, the divide and conquer and MRRR algorithms were developed to reduce the number of operations. Still, these methods remained memory bound, so two-stage algorithms were developed to reduce memory operations and increase the computational intensity, with efficient implementations in PLASMA, DPLASMA, and MAGMA. Jacobi methods started with the two-sided method of Kogbetliantz and the one-sided method of Hestenes. They have likewise had many developments, including parallel and block versions and preconditioning to improve convergence. In this paper, we investigate the impact of these changes by testing various historical and current implementations on a common, modern multicore machine and a distributed computing platform. We show that algorithmic and implementation improvements have increased the speed of the SVD by several orders of magnitude, while using up to 40 times less energy.

Optimally Adjusted Mixture Sampling and Locally Weighted Histogram Analysis

Nama Pengarang : TAN, ZHIQIANG
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 54-65
Abstraksi Narasi : Consider the two problems of simulating observations and estimating expectations and normalizing constants for multiple distributions. First, we present a self-adjusted mixture sampling method, which accommodates both adaptive serial tempering and a generalized Wang-Landau algorithm. The set of distributions are combined into a labeled mixture, with the mixture weights depending on the initial estimates of log normalizing constants (or free energies). Then, observations are generated by Markov transitions, and free energy estimates are adjusted on line by stochastic approximation. We propose two stochastic approximation schemes by Rao-Blackwellization of the scheme commonly used, and derive the optimal choice of a gain matrix, resulting in the minimum asymptotic variance for free energy estimation, in a simple and feasible form. Second, we develop an offline method, locally weighted histogram analysis, for estimating free energies and expectations, using all the simulated data from multiple distributions by either self-adjusted mixture sampling or other sampling algorithms. This method can be computationally much faster, with little sacrifice of statistical efficiency, than a global method currently used, especially when a large number of distributions are involved. We provide both theoretical results and numerical studies to demonstrate the advantages of the proposed methods.

Looking Back on Inverse Scattering Theory

Nama Pengarang : David Colton,Rainer Kress
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 4)
Nomor Halaman : 779-807
Abstraksi Narasi : We present an essay on the mathematical development of inverse scattering theory for time-harmonic waves over the past fifty years together with some personal memories of our participation in these events.

A Marginal Sampler for u-Stable Poisson-Kingman Mixture Models

Nama Pengarang : LOMELI, MARIA,FAVARO, STEFANO,TEH, YEE WHYE
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 44-53
Abstraksi Narasi : We investigate the class of er-stable Poisson-Kingman random probability measures (RPMs) in the context of Bayesian nonparametric mixture modeling. This is a large class of discrete RPMs, which encompasses most of the popular discrete RPMs used in Bayesian nonpararnetrics, such as the Dirichlet process, PitmanYor process, the normalized inverse Gaussian process, and the normalized generalized Gamma process. We show how certain sampling properties and marginal characterizations of er-stable Poisson-Kingman RPMs can be usefully exploited for devising a Markov chain Monte Carlo (MCMC) algorithm for performing posterior inference with a Bayesian nonparametric mixture model. Specifically, we introduce a novel and efficient MCMC sampling scheme in an augmented space that has a small number of auxiliary variables per iteration. We apply our sampling scheme to a density estimation and clustering tasks with unidimensional and multidimensional datasets, and compare it against competing MCMC sampling schemes. Supplementary materials for this article are available on line.

Variational Approximations for Genera l ized Linear Latent Variable Models

Nama Pengarang : HUI, FRANCIS K. C.,WARTON, DAVID I.,ORMEROD, JOHN T.,HAAPANIEMI, VIIVI,TASKINEN, SARA
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 35-43
Abstraksi Narasi : Generalized linear latent variable models (GLLVMs) are a powerful class of models for understa nding the relationships among multiple, correlated responses. Estimation, however, presents a major challenge, as the marginal likelihood does not possess a closed form for nonnormal response. We propose a variation al approximation (VA) method for estimating GLLVMs. For the common cases of b1nary, original, and overdispersed count data, we derive fully closed-form approximations to the marginal log-likelihood function in each case. Compared to other methods such as the expectation-maximization a lgorithm, estimation using VA is fast and straightforward to implement. Predictions of the latent variables and associated uncertainty estimates are also obtained as part of the estimation process. Simu lations show that VA estimation performs similar to or better than some currently available methods, both at pred icting the latent variables and estimating their corresponding coefficients. They also show that VA estimation offers dramatic reductions in computation time particularly if the number of correlated responses is large relative to the number of observational units. We apply the variational approach to two datasets, estimating GLLVMs to understanding the patterns of variation in youth gratitude and for constructing ordination plots in bird abundance data. R code for performing VA estimation of GLLVMs is available online. Supplementary materials for this article are available online.
← Kembali ke Halaman Utama