| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 10 (No. 4) |
| Nomor Halaman | : | 10-11 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Derong Liu,Chin-Teng Lin,Kay Chen Tan,Kendall, Graham,Angelo Cangelosi |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 10 (No. 4) |
| Nomor Halaman | : | 7-9 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Rodrigo Angelo & Max Wenqiang Xu |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 9) |
| Nomor Halaman | : | 918-925 |
| Abstraksi Narasi | : | We prove that if a polynomial with rational coefficients has a root mod p for every large prime p, then it has a real root. We show with examples how to use Chebotarev’s density theorem to study roots of polynomials mod p, leading up to our proof. As an application, we show that the primes can’t be covered by finitely many positive definite binary quadratic forms. |
| Nama Pengarang | : | Vjekoslav Kovac |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 9) |
| Nomor Halaman | : | 895-911 |
| Abstraksi Narasi | : | We help Alice play a certain “convergence game” against Bob and win the prize, which is a constructive solution to a problem by Paul Erd?s and Ronald Graham, posed in their 1980 book on open questions in combinatorial number theory. Namely, after several reductions using peculiar arithmetic identities, the game outcome shows that the set of points(∑????∈????1????,∑????∈????1????+1,∑????∈????1????+2),obtained as A ranges over infinite sets of positive integers, has a non-empty interior. This generalizes a two-dimensional result by Erd?s and Ernst Straus. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | IX-9, SEPTEMBER (No. 9) |
| Nomor Halaman | : | 881-892 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 10 (No. 3) |
| Nomor Halaman | : | 62-76 |
| Abstraksi Narasi | : | Major Golf and Grand Slam Tennis tournaments such as Australian Open, The Masters, Roland Garros, United States Golf Association (USGA), Wimbledon, and United States Tennis Association (USTA) United States (US) Open provide real-time and historical sporting information to immerse a global fan base in the action. Each tournament provides realtime content, including streaming video, game statistics, scores, images, schedule of play, and text. Due to the game popularities, some of the web servers are heavily visited and some are not, therefore, we need a method to autonomously provision servers to provide a smooth user experience. Predictive Cloud Computing (PCC) has been developed to provide a smart allocation/deallocation of servers by combining ensembles of forecasts and predictive modeling to determine the future origin demand for web site content. PCC distributes processing through analytical pipelines that correlate streaming data, such as scores, media schedules, and player brackets with a future-simulated tournament state to measure predicted demand spikes for content. Social data streamed from Twitter provides social sentiment and popularity features used within predictive modeling. Data at rest, such as machine logs and web content, provide additional features for forecasting. While the duration of each tournament varies, the number of origin website requests range from 29,000 to 110,000 hits per minute. The PCC technology was developed and deployed to all Grand Slam tennis events and several major golf tournaments that took place in 2013 and to the present, which has decreased wasted computing consumption by over 50%. We propose a novel forecasting ensemble that includes residual, vector, historical, partial, adjusted, cubic and quadratic forecasters. In addition, we present several predictive models based on Multiple Regression as inputs into several of these forecasters. We conclude by empirically demonstrating that the predictive cloud technology is able to forecast the computing load on origin web servers for professional golf and tennis tournaments. |
| Nama Pengarang | : | J. Panglaykim. |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | IX-9, SEPTEMBER (No. 9) |
| Nomor Halaman | : | 824-880 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | IX-9, SEPTEMBER (No. 9) |
| Nomor Halaman | : | 812-823 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Nomor Edisi | : | IX-9, SEPTEMBER (No. 9) |
| Nomor Halaman | : | 802-811 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Nomor Edisi | : | 10 (No. 3) |
| Nomor Halaman | : | 52-60 |
| Abstraksi Narasi | : | This article introduces a new supervised classification method - the extended nearest neighbor (ENN) - that predicts input patterns according to the maximum gain of intra-class coherence. Unlike the classic knearest neighbor (KNN) method, in which only the nearest neighbors of a test sample are used to estimate a group membership, the ENN method makes a prediction in a "two-way communication" style: it considers not only who are the nearest neighbors of the test sample, but also who consider the test sample as their nearest neighbors. By exploiting the generalized class-wise statistics from all training data by iteratively assuming all the possible class memberships of a test sample, the ENN is able to learn from the global distribution, therefore improving pattern recognition performance and providing a powerful technique for a wide range of data analysis applications. |