Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 222 dari 34194, Total: 341939 data)

Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth

Nama Pengarang : Matija Buci? & James Davies
Nama Majalah/Jurnal : The American Mathematical Monthly
Volume / Nomor Edisi : 132 (No. 9)
Nomor Halaman : 883-894
Abstraksi Narasi : 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

Nama Pengarang : Pierre Lairez & Aleksandr Storozhenko
Nama Majalah/Jurnal : The American Mathematical Monthly
Volume / Nomor Edisi : 132 (No. 9)
Nomor Halaman : 867-882
Abstraksi Narasi : 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

Nama Pengarang : -
Nama Majalah/Jurnal : Analisa
Volume / Nomor Edisi : IX-8, AGUSTUS (No. 8)
Nomor Halaman : 683-705
Abstraksi Narasi : -

Asymptotics of Redistricting the n×n Grid

Nama Pengarang : Christopher Donnay & Matthew Kahle
Nama Majalah/Jurnal : The American Mathematical Monthly
Volume / Nomor Edisi : 132 (No. 9)
Nomor Halaman : 856-866
Abstraksi Narasi : 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

Nama Pengarang : -
Nama Majalah/Jurnal : Analisa
Volume / Nomor Edisi : IX-8, AGUSTUS (No. 8)
Nomor Halaman : 667-682
Abstraksi Narasi : -

Sums of Dilates Over Groups of Prime Order

Nama Pengarang : David Conlon & Jeck Lim
Nama Majalah/Jurnal : The American Mathematical Monthly
Volume / Nomor Edisi : 132 (No. 9)
Nomor Halaman : 848-855
Abstraksi Narasi : 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?

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 10 (No. 2)
Nomor Halaman : 68-77
Abstraksi Narasi : 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.

Revisiting the Lind Reichardt Counterexample to Hasses Local Global Principle

Nama Pengarang : David B. Leep, Paul Pollack & Daniel B. Shapiro
Nama Majalah/Jurnal : The American Mathematical Monthly
Volume / Nomor Edisi : 132 (No. 9)
Nomor Halaman : 839-847
Abstraksi Narasi : We discuss what is widely believed to be the first published counterexample to the Hasse principle, presented by Hans Reichardt in 1942: The equation ????4−17?????4=2?????2 has no nonzero solution in rational numbers X, Y, Z, but has a nonzero solution over ? and over every ?????. We demonstrate that Reichardt’s example (in fact, an infinite family of examples that contains Reichardt’s) can be presented in a completely elementary way. Both local solvability and global unsolvability can be established using tools no deeper than quadratic reciprocity. For global solvability, this has long been known, but our simple and short proof of local solvability appears to be new. The above counterexample is usually attributed to Carl-Erik Lind as well as Reichardt. We discuss how this claim, while correct, is not correct enough due to the presence of a third individual who made contributions to this problem.

A Survey of Evolutionary Computation for Resource Management of Processing in Cloud Computing

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 10 (No. 2)
Nomor Halaman : 53-67
Abstraksi Narasi : Cloud computing is significantly C reshaping the computing industry. Individuals and small organizations can benefit from using state-of-the-art services and infrastructure, while large companies are attracted by the flexibility and the speed with which they can obtain the services. Service providers compete to offer the most attractive conditions at the lowest prices. However, the environmental impact and legal aspects of cloud solutions pose additional challenges. Indeed, the new cloud-related techniques for resource rce virtualization and sharing and the corresponding service level agreements call for new optimization models and solutions. It is important for computational intelligence researchers to understand the novelties introduced by cloud computing. The current survey highlights and classifies key research questions, the current state of the art, and open problems.

Visual Cue-Guided Rat Cyborg for Automatic Navigation

Nama Pengarang : -
Nama Majalah/Jurnal : IEEE Computational intelligence
Volume / Nomor Edisi : 10 (No. 2)
Nomor Halaman : 42-52
Abstraksi Narasi : Arat robot is a type of animal robots, A where an animal is connected to a machine system via a brain-computer interface. Electrical stimuli can be generated by the machine system and delivered to the animal's brain to control its behavior. The sensory capacity and flexible motion ability of rat robots highlight their potential advantages over mechanical robots. However, most existing rat robots require that a human observes the environmental layout to guide navigation, which limits the applications of rat robots. This work incorporates object detection algorithms to a rat robot system to enable it to find 'humaninteresting' objects, and then use these cues to guide its behaviors to perform automatic navigation. A miniature camera is mounted on the rat's back to capture the scene in front of the rat. The video is transferred via a wireless module to a computer and we develop some object detection/identification algorithms to allow objects of interest to be found. Next, we make the rat robot perform a specific motion automatically in response to a detected object, such as turning left. A single stimulus does not allow the rat to perform a motion successfully. Inspired by the fact that humans usually give a series of stimuli to a rat robot, we develop a closed-loop model that issues a stimulus sequence automatically according to the state of the rat and the objects in front of it until the rat completes the motion successfully. Thus, the rat robot, which we refer to as a rat cyborg, is able to move according to the detected objects without the need for manual operations. The object detection methods and the closedloop stimulation model are evaluated in experiments, which demonstrate that our rat cyborg can accomplish human-specified navigation automatically.
← Kembali ke Halaman Utama