Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

http://masou-keshtkar.persiangig.com/document/sdarticle.pdf

GSA: A Gravitational Search Algorithm

Introduction to Optimization The Binary Genetic Algorithm The Continuous Parameter Genetic Algorithm Applications An Added Level of Sophistication Advanced Applications Evolutionary Trends Appendix Glossary Index.

https://cdn.preterhuman.net/texts/science_and_technology/nature_and_biology/Bioinformatics/Practical%20Genetic%20Algorithms%20-%20Randy%20L.%20Haupt,%20Sue%20Ellen%20Haupt.pdf

Practical Genetic Algorithms

Phased Arrays in Radar and Communication Systems. Pattern Characteristics and Synthesis of Linear and Planar Arrays. Patterns of Nonplanar Arrays. Elements, Transmission Lines, and Feed Architectures for Phased Arrays. Summary of Element Pattern and Mutual Impedance Effects. Array Error Effects. Special Array Feeds for Limited Field of View and Wideband Arrays.

Phased Array Antenna Handbook

Array processing involves manipulation of signals induced on various antenna elements. Its capabilities of steering nulls to reduce cochannel interferences and pointing independent beams toward various mobiles, as well as its ability to provide estimates of directions of radiating sources, make it attractive to a mobile communications system designer. Array processing is expected to play an important role in fulfilling the increased demands of various mobile communications services. Part I of this paper showed how an array could be utilized in different configurations to improve the performance of mobile communications systems, with references to various studies where feasibility of apt array system for mobile communications is considered. This paper provides a comprehensive and detailed treatment of different beam-forming schemes, adaptive algorithms to adjust the required weighting on antennas, direction-of-arrival estimation methods-including their performance comparison-and effects of errors on the performance of an array system, as well as schemes to alleviate them. This paper brings together almost all aspects of array signal processing.

/pdf/application-of-antenna-arrays-to-mobile-communications-ii-52fds1c81j.pdf

Application of antenna arrays to mobile communications. II. Beam-forming and direction-of-arrival considerations

This communication presents a technique that optimizes the orientation of each dipole in an array to minimize the sidelobes in the co-polarization pattern while constraining the gain of the cross-polarized pattern. A genetic algorithm calls an array cost function modeled using the method of moments.

Low Sidelobe Arrays via Dipole Rotation

Traditionally, unit circle analysis/synthesis techniques were only applied to amplitude tapered arrays. This paper extends the method to uniformly weighted thinned and aperiodic arrays. It shows how to analyze thinned and aperiodic arrays using the z-transform and unit circle. Finding the roots of the thinned array is an easy process using a polynomial root finding algorithm. >

Unit circle representation of aperiodic arrays

Experimental adaptive nulling with a genetic algorithm

Timed Arrays: Wideband and Time Varying Antenna Arrays

Genetic algorithms are capable of optimizing the performance of antenna arrays. They model biological evolution to find the parameters that optimize the output of a function. In this paper, the genetic algorithms find the quantized phase weights that optimize the sidelobe levels of an array over its scanning region.

/pdf/genetic-algorithm-design-of-antenna-arrays-13e2lowvf2.pdf

Randy L. Haupt

Papers

Low Sidelobe Arrays via Dipole Rotation

Unit circle representation of aperiodic arrays

Experimental adaptive nulling with a genetic algorithm

Timed Arrays: Wideband and Time Varying Antenna Arrays

Genetic algorithm design of antenna arrays