The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes the design method of novel resonant elements with four axial symmetry designed by using the genetic algorithm(GA). Designing a reflectarray, it is desirable for the resonant element to have a low cross-polarization and dual-polarization property, in addition to providing an ideal reflection phase. Then, we verified effectiveness of the proposed elements from the radiation pattern...
Solving complex optimization problems with genetic algorithms (GAs) with custom computing architectures is a way to improve the execution time of this metaheuristic, which is known to consume considerable amounts of time to converge to final solutions. In this work, we present a scalable computing array architecture to accelerate the execution of cellular GAs (cGAs), a variant of genetic algorithms...
Cloud Computing (CC) model plays an important role for the growth of contemporary IT industry where stability, availability and partition tolerance of computational resources mean a great deal. It is of utmost significance that not only cloud services are to be provided with satisfactory performance but also they are able to minimize and resiliently recover from potential damages when cloud infrastructures...
Pairwise testing is an effective combinatorial test generation technique that can generate relative small test suite to cover all pairs of parameter values at least once. Genetic algorithm has been used for pairwise test suite generation by some researchers. In order to improve the performance of genetic algorithm, this paper proposes a hybrid optimization algorithm by augmenting genetic algorithm...
This paper presents the design of a circular array working at 2 GHz capable of generating two conical beam patterns with a semiangle of 30° and 90° respectively. The genetic algorithm was employed in order to obtain the characteristics of the array. Four parameters were optimized by using this method: number of rings, ring radius, number of elements in each ring and phase excitations. As a result,...
We present an overview of a method for designing near-field focusing systems, where distributions of electrically-small antennas are used as the source. The technique proposed here relies on recent progress in the theoretical understanding of the relation between the far and near fields of generic antennas, where it is suggested that the entire exterior-domain near field can be reconstructed from...
This paper presents the simulation and design of a dual polarized electrically adjustable array antenna with broadband element for mobile communication base station. The antenna array works from 1710 MHz to 2690 MHz which covers DCS/PCS/3G and LTE bands. By choosing the fed network and optimizing the fed phase of each element with the Genetic Algorithm, a perfect shaped-beam radiation pattern is obtained...
Since the series fed microstrip patch array antenna has low feeding loss, it is especially effective for the millimeter wave application. In order to realize an array antenna with a high gain, low sidelobe level, and low VSWR, we have optimized the width and element spacing for each patch antenna by the parato genetic algorithm. As for such an evolution method as genetic algorithm, the calculation...
The purpose of the present paper is to introduce new method for designing electrically-small antennas with optimum directivity. A sphere with small radius compared to the wavelength contains a distribution of infinitesimal point sources. Global optimization is used to find the best current on the small antenna enclosed within this sphere capable of providing the optimum directivity. The results presented...
NP-hard problems, such as generating crossword puzzles, are candidates for solution by genetic algorithms (GAs). A combination of both a genetic algorithms and a Wisdom of Artificial Crowds (WoAC) aggregation method was developed for the purpose of creating crossword puzzles given a particular outline. The program was written using a GPL Hunspell wrapper NHunspell for word verification and suggestion...
In this paper, optimisation algorithms are successfully applied to a number of antenna array beampattern synthesis problems — including, a Uniform Linear Array (ULA), a ULA with an inactive element, and a 2D Wireless Sensor Network (WSN) array. The algorithms presented include a Greedy Algorithm (GDA), a Metropolis Algorithm (MA), and a Genetic Algorithm (GA).
As various types of Internets of Things (IoT) are deployed in a wide range of areas, the need arises to utilize various IoT resources dynamically to accomplish user tasks. We call this environment an urban-scale IoT environment, where various IoT resources that are necessary to accomplish user tasks are directly connected to each other via users' mobile devices, such as their smart phones. IoT resources...
Sudoku puzzles are logical number placement puzzle games. They are classified as combinatorial optimization problems and are NP-complete. To solve problems in this complexity class, metaheuristic approaches, such as genetic algorithms (GAs), are often adopted. However, conventional GAs with random swap mutations suffer from slow convergence, especially in extremely difficult sudoku puzzles, in which...
In the data mining research area, discovering frequent item sets is an important issue and key factor for mining association rules. For large datasets, a huge amount of frequent patterns are generated for a low support value, which is a major challenge in frequent pattern mining tasks. A Maximal frequent pattern mining task helps to resolve this problem since a maximal frequent pattern contains information...
A novel solution to the problem of integrated exploration of datapath resource configuration and loop unrolling factor (UF) for control data flow graphs (CDFGs) during high level synthesis (HLS) for optimal scheduling is presented in this paper. The proposed approach is fast as it is driven through an adaptive genetic algorithm (GA) process, capable of escaping local minima and an estimation model...
Adaptive evolution strategies without crossover are used to design complete dominance-based controllers for linear multivariable plants. Such complete dominance-based controllers comprise a pre-compensator and a set of single-loop controllers, which can both be readily designed using the proposed evolutionary approach. The effectiveness of this two-stage evolutionary design technique is illustrated...
In this paper, a convenient and effective method is proposed to synthesize an line array radiation pattern in arbitrary array topology. This method is modified from the conventional Fourier transforms relations and able to synthesize a non-uniform array. A new function is utilized to form a modified Fourier transform pair. The function includes two variables, i.e. the array geometry coordinate and...
Adaptive beamforming is critical in high performance radar and wireless communications applications. This paper presents a study of adaptive beamforming for arbitrary array by applying the powerful and versatile particle swarm optimization (PSO). Numerical experiments for sidelobe suppression, nulling, null steering and array failure correction have demonstrated that the presented PSO approach is...
Genetic algorithm is considered to have a relatively slow convergence rate and space time adaptive processing is considered to be computationally intensive. So, combining both of them in one processing scheme may result in an inapplicable approach to real time applications. This paper presents a new fast direct data domain genetic algorithm beam forming approach to space time adaptive processing....
Locating nulls in the desired directions and as well as steering main beam towards the direction of interest is the most important part of the beamforming concept. Many evolutionary and metaheuristic algorithms are applied to solve these problems. In this paper a circular array is considered. Novel flower pollination algorithm is applied to position nulls with and without beam steering conditions...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.