OPAC - Pencarian Artikel Jurnal & Majalah Library USD
Menampilkan semua artikel (Halaman 190 dari 34169, Total: 341690 data)
STRATEGI DEMOGRAFI DALAM RANGKA PEMERATAAN PENDAPATAN
klik untuk membaca file PDF
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Edisi | : | IX-8, AGUSTUS (No. 8) |
| Halaman | : | 735-747 |
| Abstrak | : | - |
CIS Publication Spotlight
| Pengarang | : | Derong Liu,Chin-Teng Lin,Kay Chen Tan,Kendall, Graham,Angelo Cangelosi |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 10 (No. 3) |
| Halaman | : | 5-7 |
| Abstrak | : | - |
GARIS KEMISKINAN DAN PENENTUAN KECAMATAN MISKIN DI SUMATERA BARAT
| Pengarang | : | Alfian Lains |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Edisi | : | IX-8, AGUSTUS (No. 8) |
| Halaman | : | 706-734 |
| Abstrak | : | - |
Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
| Pengarang | : | Matija Buci? & James Davies |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Edisi | : | 132 (No. 9) |
| Halaman | : | 883-894 |
| Abstrak | : | In 1975 Paul Erd?s initiated the study of the following very natural question. What can be said about the chromatic number of unit distance graphs in ?2 that have large girth? Over the years this question and its natural extension to ????? attracted considerable attention with the high-dimensional variant reiterated recently by Noga Alon and Andrey Kupavskii. We prove that there exist unit distance graphs in ????? with chromatic number at least (1.074+?????(1))???? that have arbitrarily large girth. This improves upon a series of results due to Kupavskii; Arsenii Sagdeev; and Sagdeev and Andrei Raigorodskii and gives the first bound in which the base of the exponent does not tend to one with the girth. In addition, our construction can be made explicit which allows us to answer in a strong form a question of Kupavskii. Our arguments show graphs of large chromatic number and high girth exist in a number of other geometric settings, including diameter graphs and orthogonality graphs. |
Conways Cosmological Theorem and Automata Theory
| Pengarang | : | Pierre Lairez & Aleksandr Storozhenko |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Edisi | : | 132 (No. 9) |
| Halaman | : | 867-882 |
| Abstrak | : | John Conway proved that every audioactive sequence (a.k.a. look-and-say) decays into a compound of 94 elements, a statement he termed the cosmological theorem. The underlying audioactive process can be modeled by a finite-state machine, mapping one sequence of integers to another. Leveraging automata theory, we propose a new proof of Conway’s theorem based on a few simple machines, using a computer to compose and minimize them. |
ARTI DAN ISI KEADILAN SOSIAL
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Edisi | : | IX-8, AGUSTUS (No. 8) |
| Halaman | : | 683-705 |
| Abstrak | : | - |
Asymptotics of Redistricting the n×n Grid
| Pengarang | : | Christopher Donnay & Matthew Kahle |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Edisi | : | 132 (No. 9) |
| Halaman | : | 856-866 |
| Abstrak | : | Redistricting is the act of dividing a region into districts for electoral representation. Motivated by this application, we study two questions. How many ways are there to partition the ????×???? grid into n contiguous districts of equal size? How many of these partitions are “compact”? We give asymptotic bounds on the number of plans: a lower bound of roughly 1.41????2 and an upper bound of roughly 3.21????2. We then use the lower bound to show that most plans are not compact. |
MENGGERAKKAN SEGENAP KEMAMPUAN DAN POTENSI DALAM NEGERI DALAM PEMBANGUNAN UNTUK MEWUJUDKAN DEMOKRASI EKONOMI
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Edisi | : | IX-8, AGUSTUS (No. 8) |
| Halaman | : | 667-682 |
| Abstrak | : | - |
Sums of Dilates Over Groups of Prime Order
| Pengarang | : | David Conlon & Jeck Lim |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Edisi | : | 132 (No. 9) |
| Halaman | : | 848-855 |
| Abstrak | : | For p prime, ????⊆?/?????? and ????∈?, the sum of dilates ????+????·???? is defined by????+????·????={????+?????????′:????,????′∈????}.The basic problem on such sums of dilates asks for the minimum size of |????+????·????| for given ????, A of given density ????, and p tending to infinity. We investigate this problem for ???? fixed and ???? tending to infinity, proving near-optimal bounds in this case. |
Universal Approximation with Convex Optimization: Gimmick or Reality?
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | IEEE Computational intelligence |
| Volume / Edisi | : | 10 (No. 2) |
| Halaman | : | 68-77 |
| Abstrak | : | This paper surveys in a tutorial fashion the recent history of universal learning machines starting with the multilayer perceptron. The big push in recent years has been on the design of universal learning machines using optimization methods linear in the parameters, such as the Echo State Network, the Extreme Learning Machine and the Kernel Adaptive filter. We call this class of learning machines convex universal learning machines or CULMs. The purpose of the paper is to compare the methods behind these CULMs, highlighting their features using concepts of vector spaces (i.e. basis functions and projections), which are easy to understand by the computational intelligence community. We illustrate how two of the CULMs behave in a simple example, and we conclude that indeed it is practical to create universal mappers with convex adaptation, which is an improvement over backpropagation. |