<p><em>Training of communities around forests is needed to improve the management non-timber forest products for community empowerment. This training activity carried out every year, so it necessary design forestry community. Therefore, required predict number incoming trainees that can be evenly by extension workers. study aims determine application Single Exponential Smoothing met...

CV. Usaha Muda Materials is a company engaged in the distribution of wood, cement, iron and other building materials. Frequent errors data collection purchases sales lead to disinformation goods. Prediction process for estimating how many needs future which include terms quantity, quality, time location needed order meet demand goods or services. number inventory items can be calculated using e...

Peramalan dijadikan untuk pertimbangan dalam bidang bisnis dan ekonomi, agar kerugian perusahaan menjadi sekecil mungkin supaya keuntungan yang di dapat maksimal. Peneliti ini bertujuan membuat sebuah aplikasi Forecastin penjualan berbasis website memudahkan Toko Agung meramalkan penjualan.
 Penelitian mencari solusi Pemilik barang. Mengunakan Metode Single Exponential Smoothing. Kebutuhan...

This paper describes a method for compiling a constraint-based grammar into a potentially more efficient form for processing. This method takes dependent disjunctions within a constraint formula and factors them into non-interacting groups whenever possible by determining their independence. When a group of dependent disjunctions is split into smaller groups, an exponential amount of redundant ...

The C library libkww provides functions to compute the Kohlrausch–Williams– Watts function, i.e., the Laplace–Fourier transform of the stretched (or compressed) exponential function exp(−t) for exponents β between 0.1 and 1.9 with double precision. Analytic error bounds are derived for the low and high frequency series expansions. For intermediate frequencies, the numeric integration is enormou...

In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in the number of variables and exponential in the integration time. The best classical algorithm runs in a time scaling linearly with the number of variables, ...

This paper considers a formula for Weil’s Generalized Exponential Sums which depends entirely upon the singularities modulo π, similar to the purpose of the Stationary Phase Formula (SPF) for Igusa Local Zeta Functions (ILZF). Unlike the formula discussed in this paper, the SPF for ILZF also requires one to examine the points where the function evaulates to zero modulo π; this paper shows where...

We introduce two abstract theorems that reduce a variety of complex exponential distributional approximation problems to the construction of couplings. These are applied to obtain rates of convergence with respect to the Wasserstein and Kolmogorov metrics for the theorem of Rényi on random sums and generalizations of it, hitting times for Markov chains, and to obtain a new rate for the classica...