Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise. IlliGAL Report No November Department of General Engineering
|
|
- Dwain Powers
- 5 years ago
- Views:
Transcription
1 Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise Brad L. Miller Det. of Comuter Science University of Illinois at Urbana-Chamaign David E. Goldberg Det. of General Engineering University of Illinois at Urbana-Chamaign IlliGAL Reort No November 1995 Deartment of General Engineering University of Illinois at Urbana-Chamaign 117 Transortation Building 104 South Mathews Avenue Urbana, IL 61801
2 Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise Brad L. Miller Det. of Comuter Science University of Illinois at Urbana/Chamaign David E. Goldberg Det. of General Engineering University of Illinois at Urbana/Chamaign November 14, 1995 Abstract This aer analyzes the eect of noise on dierent selection mechanisms for genetic algorithms. Models for several selection scheme are develoed that successfully redict the convergence characteristics of genetic algorithms within noisy environments. The selection schemes modeled in this aer include roortionate selection, tournament selection, - selection, and linear ranking selection. These models are shown to accurately redict the convergence rate of genetic algorithms under a wide range of noise levels. 1 Introduction Selection schemes rimarily determine the convergence characteristics of genetic algorithms (GAs). Good rogress has been made in develoing models for several dierent selection schemes that successfully redict the convergence characteristics of a GA within a deterministic (noiseless) environment. However, these models are not designed for noisy environments, where tness functions only aroximately measure the true tness of individuals. This aer seeks to model the convergence characteristics of several selection schemes for noisy environments. Convergence models of dierent selection schemes was rst broached in Goldberg (1989), and later exanded in Goldberg and Deb (1991). Muhlenbein and Schlierkam-Voosen (1993) introduced the use of selection intensity for convergence analysis of genetic algorithm selection schemes. The convergence characteristics of several dierent selection schemes have recently been successfully modeled for deterministic environments. In Thierens and Goldberg (1994), convergence models for deterministic environments were develoed for several selection schemes, including roortionate selection, binary tournament selection, and truncation selection. Both Back (1995) and Miller and Goldberg (1995) alied order statistics to extend Thierens and Goldberg's tournament selection model to handle tournament sizes larger than two. Back also used order statistics to develo a model for - selection (Back, 1995). A convergence model for linear ranking was resented by Blickle and Thiele (1995). The urose of this aer is to further our understanding of how selection ressure works, with secial attention on how noise alters the eects of selection ressure. Convergence models are then develoed that utilize our new understanding of how noise aects selection ressure. Convergence models for noisy environments are develoed for several selection schemes, including tournament selection, - selection, linear ranking, and stochastic universal selection. These models accurately redict the convergence of GAs, and are veried for a wide range of noise levels using the onemax domain. Section 2 rovides the basic background needed to understand this aer, including a discussion of selection scheme tyes, selection intensity, noise denitions, and the onemax domain. Section 3 exands the selection intensity equation to handle noise, and adats the noisy selection intensity model to the onemax domain. This forms the basis of the convergence models for both roortionate-based and ordinal-based selection. Section 1
3 2 4 discusses the exerimental methodology used, and resents the results of exeriments comaring actual convergence erformance of several selection schemes with redicted erformance. Lastly, section 5 resents some general conclusions from this research. 2 Background In this section, a brief overview of the basic background information needed to understand this aer is given. The role of selection schemes in GAs is discussed, and a general selection intensity model is resented. Next, noise and noisy tness functions are exlained. The last subsection deals with the onemax domain, as well as using the general selection intensity model to redict erformance in the deterministic onemax domain. 2.1 Selection Schemes Genetic algorithms use a selection scheme to select individuals from the oulation to insert into a mating ool. Individuals from the mating ool are used by a recombination oerator to generate new osring, with the resulting osring forming the basis of the next generation. As the individuals in the mating ool ass their genes on to the next generation, it is desirable that the mating ool be comrised of \good" individuals. A selection scheme in GAs is simly a rocess that favors the selection of better individuals in the oulation for the mating ool. The selection ressure is the degree to which the better individuals are favored: the higher the selection ressure, the more the better individuals are favored. This selection ressure drives the GA to imrove the oulation tness over succeeding generations. The convergence rate of a GA is largely determined by the magnitude of the selection ressure, with higher selection ressures resulting in higher convergence rates. Genetic algorithms are able to to identify otimal or near-otimal solutions under a wide range of selection ressure (Goldberg, Deb, & Thierens, 1993). However, if the selection ressure is too low, the convergence rate will be slow, and the GA will unnecessarily take longer to nd the otimal solution. If the selection ressure is too high, there is an increased chance of the GA rematurely converging to an incorrect (sub-otimal) solution. In addition to roviding selection ressure, selection schemes should also reserve oulation diversity, as this hels avoid remature convergence. There are two basic tyes of selection schemes commonly used today: roortionate selection and ordinalbased selection. Proortionate-based selection selects individuals based uon their tness values relative to the tness of the other individuals in the oulation. Some common roortionate-based selection schemes are roortionate selection (Holland, 1975), stochastic remainder selection (Booker, 1982; Brindle, 1981), and stochastic universal selection (Baker, 1987; Grefenstette & Baker, 1989). Ordinal-based selection schemes select individuals not uon their tness, but based uon their rank within the oulation. This entails that the selection ressure is indeendent of the tness distribution of the oulation, and is solely based uon the relative ordering (ranking) of the oulation. Some common ordinal-based selection schemes are tournament selection (Brindle, 1981; Goldberg, Korb, & Deb, 1989), - selection (Schwefel, 1981), truncation selection (Muhlenbein & Schlierkam-Voosen, 1993), and linear ranking (Baker, 1985; Baker, 1987; Grefenstette & Baker, 1989). Ordinal selection schemes are normally referred over roortional selection schemes for a variety of reasons, the most rominent of which is the scaling roblem (Forrest, 1985; Goldberg, 1989; Whitley, 1989). A selection scheme is said to be scale invariant if multilying every individuals' tness by a constant does not change the selection ressure. A selection scheme is said to be translation invariant if adding a constant to every individuals' tness does not change the selection ressure. Proortionate selection methods are normally scale invariant, but translation variant. Ordinal-based selection schemes are translation and scale invariant. 2.2 Selection Intensity The selection intensity, I, measures the magnitude of the selection ressure rovided by a selection scheme. The selection intensity of genetic algorithms, as dened by Muhlenbein and Schlierkam-Voosen (1993), is the exected average tness of a oulation after selection is erformed uon a oulation whose tness is distributed according to the unit normal distribution N(0; 1). If the selection intensity I of a selection scheme is known, and the oulation tness at generation t is distributed N( t ; 2 t ), the exected mean tness of a oulation after selection can be determined: t+1 = t + t I: (1)
4 3 An imortant assumtion of this model is that oulation tness is normally distributed before selection. In ractice, this is true or aroximately true for many domains, as recombination and mutation oerators have a normalizing eect on the oulation tness distribution. Table 1 gives the selection intensity for several common selection schemes. Back (1995) and Miller and Goldberg (1995) indeendently alied order statistics to derive the selection intensity for tournament selection. The order statistics are for the unit normal distribution N(0; 1); thus i:j reresents the exected value of the ith biggest samle out of a samle of size j drawn from the unit normal distribution. The maximal order statistic s:s determines the selection ressure of a tournament of size s. The study by Back (1995) also derives the selection intensity for - selection. In - selection, the best individuals are selected out of a random samle of individuals. The selection ressure is simly the average of the to th order statistics of samle size. The selection intensity of linear ranking is given by Blickle and Thiele (1995), where n + denotes the number of desired coies of the best individual. Linear ranking selects each individual in the oulation with a robability linearly roortional to the rank of the individual. Imlicit in the selection intensity value for linear ranking is that 1 n + 2, and n + + n? = 2, where n? is the number of desired coies of the worst individual. Muhlenbein and Schlierkam-Voosen (1993) derived the selection intensity for roortionate selection, which directly deends on the current mean t and standard deviation t of the oulation in generation t. Proortionate selection selects individuals for the mating ool with a robability directly roortional to the individuals' tness. The selection intensity equation for roortionate selection is used in this aer to redict the erformance of stochastic universal selection, one of a handful of dierent roortionate selection schemes. The selection intensity of roortionate selection is unique in that it is the only one that is sensitive to the current oulation distribution. Selection Scheme Parameters Selection Intensity I Tournament Selection s s:s 1 X - Selection ; i=?+1 Linear Ranking n + (n +? 1) 1 Proortionate Selection t ; t t = t i: Table 1: Selection Intensity of Common Selection Schemes. 2.3 Noise While there are many dierent denitions of noise, in this aer we are concerned with the factors that revent the accurate evaluation of the tness of individuals. This noise results in the tness functions being inaccurate, so the tness function in turn are referred to as noisy tness functions. There are many factors that may necessitate the use of noisy tness functions. In some domains, there may be no known tness function that can accurately assess an individual's tness, so an aroximate (noisy) tness function must be used. In domains where comutational seed is aramount, fast but noisy tness functions may be referred over slow but accurate tness functions. Noisy information can also negatively aect the accuracy of a tness evaluation. Information noise can come from a variety of sources, including noisy data, knowledge uncertainty, samling error, sensor inut, and human error. As the selection rocess is based uon tness values, noisy tness functions cause the selection rocess itself to be noisy. The noisy tness value of an individual can be viewed as the sum of the real tness of the individual lus a random noise comonent. In this aer, we assume that the noise comonent is randomly drawn from an unbiased (mean of zero) normal distribution. The assumtion of an unbiased, normally distributed noise source is true or aroximately true in many noisy domains, and allows the eects of noise to be more easily modeled. 2.4 Onemax Domain This aer uses the onemax domain, also known as the counting ones or bit-counting roblem, to verify the accuracy of the selection scheme models. The ability to accurately redict the erformance of a selection
5 4 scheme oerating within the onemax domain demonstrates a basic understanding of the underlying selection mechanism. This section reviews the onemax domain, and derives the convergence model for the onemax domain. Within the onemax domain, the real tness of an individual is simly the number of one bits in the chromosome. The otimal chromosome is simly the chromosome containing all one bits. The oulation mean tness and variance for the onemax domain are given by t = l t and t 2 = l t (1? t ); resectively (Muhlenbein & Schlierkam-Voosen, 1993; Thierens & Goldberg, 1994), where l is the chromosome length and t is the ercentage of correct alleles in the oulation at generation t. Given that the general selection intensity equation 1 can be reresented as t+1? t = t I; the rate of change of the ercentage of correct alleles can be determined by t+1? t = I t (1? t ): l Aroximating the above dierence equation with a dierential equation yields d t (1? t ): (2) dt = I l For a randomly initialized oulation, 0 = 0:5 is a reasonable aroximation for the initial ercentage of correct alleles. Using this, Equation 2 can be solved exactly to yield t = 1 2 (1 + sin( l I t)): (3) The time until convergence t conv for 0 = 0:5 can also be solved to yield t conv = l 2I : (4) The above derivation holds for cases where the selection intensity I is indeendent of the ercentage of correct alleles t. However, for roortional selection, the selection intensity is directly deendent on t, so the derivation is dierent. For roortionate selection (Thierens & Goldberg, 1994), t+1? t = 1 l ti; = 2 t l t ; = l t(1? t ) l 2 t ; = 1 l (1? t): Aroximating the above with the dierential d dt, and again assuming that 0 = 0:5, gives t = 1? 0:5e? t l (5) for the secial case of roortionate selection. It is imortant to note that unlike the ordinal-based selection mechanisms, roortionate selection, as shown by equation 5, will never reach absolute convergence ( = 1). Thierens and Goldberg (1994) calculated the amount of time until the oulation convergences to within an arbitrary amount of = 1: t conv =?l ln(2):
6 5 For the uroses of this aer, is chosen to be = 1, so the converge time for roortionate selection is 2l calculated by t conv = l ln(l): (6) 3 Noise and Selection Intensity This section extends the selection intensity equation, given by equation 1, to accurately redict the selection ressure in the resence of noise. This section generalizes the derivation of the noisy tournament selection model resented in Miller and Goldberg (1995) to work for all selection scheme models that are based uon selection intensity. This section then derives the corresonding convergence models for the onemax environment. 3.1 Noisy Selection Intensity Model Derivation The model derivation in this section has three major stes. First, the relationshi between an individual's noisy tness and true tness values is determined, so that the exected true tness value of an individual can be estimated from the noisy tness evaluation. Next, the relationshi between true and noisy tness is extended to handle subsets of individuals, so that the mean true tness of a subset of the oulation can be estimated from the mean noisy tness of the subset. Lastly, we use the general selection intensity equation, equation 1, to estimate the mean noisy tness value of the mating ool, where the mating ool was selected based on the noisy tness values. This mean noisy tness value is then lugged into the formula found in the second ste to estimate the mean true tness of the mating ool. The selection ressure, based on the exected mean true tness value of the mating ool, is thus determined. The result is a redictive model for selection schemes that can handle varying noise levels. In a noisy environment, the noisy tness f 0 of an individual is given by f 0 = f + noise, where f is the real tness of the individual, and noise is the noise inherent in the tness function evaluation. The real tness of the oulation F is assumed to be normally distributed N( F;t ; 2 F;t). This section further assumes that the noise is unbiased and normally distributed N(0; 2 N). This facilitates modeling the eects of the noise, and is a reasonable assumtion for many domains. Using these assumtions, along with the additive roerty of normal distributions, gives that the noisy tness F 0 of the oulation is normally distributed N( F;t ; 2 F;t + 2 N ). Although the real tness value for an individual is unknown, the exected value of the real tness can be determined from the individual's noisy tness value, which is generated by a noisy tness function evaluation. As both the true tness and the noisy tness are normally distributed, the bivariate normal distribution can be used to obtain the exected true tness value of F for a given noisy tness value f 0 of F 0. For normal random variables X and Y, the bivariate normal distribution states that the exected value of Y for a secic value x of X is XY E(Y jx) = Y + XY Y X (x? X ); where XY is the correlation coecient for X and Y. The correlation coecient XY can be calculated by = XY X Y, where XY is the covariance of X and Y. The covariance between F and F 0 is simly F, 2 thus E(F jf 0 ) = F + 2 F F F 0 F F 0 = F + 2 F 2 F 0 (f 0? F 0); = F + 2 F 2 F + 2 N (f 0? F 0); (f 0? F 0): (7) As the above formula is linear, the exected value of F for any subset R of the oulation can be calculated using equation 7, with f 0 set to the noisy tness mean R of the subset. Of course, the subset we are interested in is the mating ool selected by the noisy selection rocess. The general selection intensity equation, equation 1, can be used to obtain the exected mean noisy tness of the mating ool when the selection rocess is itself based uon noisy tness values. The exected noisy tness mean of the mating ool subset can be calculated
7 6 using equation 1, as the mean F 0 ;t and variance F 0 ;t of the noisy oulation are known: F 0 ;t+1 = F 0 ;t + F 0 ;ti; q = F 0 ;t F;t 2 N I: Setting f 0 to F 0 ;t+1 in equation 7 roduces the exected true tness value of the mating ool: E(F t+1 j F 0 ;t+1) = F;t+1 ; = F;t + = F;t + 2 F;t 2 F;t + 2 N q ( F 0 ;t + 2 F;t + 2 N I? F ;t); 0 2 F;t I: (8) 2 F;t + 2 N As exected, equation 8 reduces to equation 1, the formula for the deterministic case, when the noise variance 2 N equals zero. Equation 8 is signicant in that it extends the basic selection intensity convergence model to handle noise. By doing so, accurate convergence rate rediction in the resence of noise is now ossible for selection schemes that can be modeled using the selection intensity aroach. An interesting ramication of equation 8 is that roortionate selection is noise invariant: increased noise levels do not aect the selection ressure of genetic algorithms using roortionate selection! Plugging in I = F 0 ;t from Table 1 to equation 8, and realizing that F 0 ;t = F;t and F 0 ;t = 2 F 0 F;t + 2 N for unbiased ;t normally distributed noise, yields F;t F;t+1 = F;t + F;t ; (9) F;t which is identical to the deterministic equation of selection ressure for roortionate selection. 3.2 Selection Intensity Model for Noisy Onemax Environment In subsection 2.4, the basic convergence model for the deterministic domain was derived. This section derives the converge model for the noisy onemax domain. Using the same aroach outlined in subsection 2.4, along with equation 8, it is easy to see that t+1? t = I 2 F;t : l 2 F;t + 2 N t (1? t ) = I : (10) l t (1? t ) + 2 N Aroximating the above dierence equation with a dierential equation yields d = dt I t (1? t ) l t (1? t ) + 2 N : (11) Although equation 11 is integrable, it does not reduce to convenient form in the general case for t ; however, it can be easily solved numerically for t, and for the noiseless case ( N = 0) t can be solved exactly (see equation 3). While equation 11 is not directly solvable for t, it can be solved for t as a function of : t() = 1 I " l arctan N log? 1 l(2? 1) 2 2 N + l (1? )?l? 2 2 N + l? 2 N 2 N + l (1? )! 2 2 N + l + 2 N 2 N + l (1? ) + (12)! + c # :
8 7 For binary alleles, at time t = 0 we can assume that half of the alleles are initially correct = 0:5. Using this to solve for c in equation 12 gives that c = 0. We are articularly interested in the time t conv it takes for all alleles to converge ( = 1). For the deterministic case, equation 12 reduces to t conv = l 2I ; (13) which is equivalent to the result obtained in equation 4. While t conv can not be solved exactly for the noisy onemax environment, it can be easily solved numerically. Useful aroximations for small, medium, and large levels of noise are derived from equation 12 in Miller and Goldberg (1995), where the convergence aroximations derived for tournament selection can be generalized to the selection intensity model by simly substituting I for s:s. These aroximation for small, medium, and large amounts of noise can be used to quickly estimate the convergence time of GAs in noisy environments, and are resented in table 2. Noise Case Noise Level t conv Aroximation h 1 l i Small N 0 l arctan I 2 N + 2 N log(2 N ) h 1 l Medium N F l arctan I 2 N + 2 N log( 2 N ) Large N 1 1 I h l 2 N + N log(l? 1) Table 2: Time of Convergence Aroximations for Noisy Onemax Domain. i i 4 Exerimental Validation In this section we verify the accuracy of the noisy selection models derived above for four dierent selection schemes: tournament selection, - selection, linear ranking, and stochastic universal selection. The exeriments are run using the noisy onemax domain, where the tness function noise is simulated by adding a random noisy value to the true tness of each individual. The noise is randomly drawn from an unbiased normal distribution, where the variance of the normal distribution is given for each exeriment. The exerimental results of running GAs with the dierent selection schemes in various noise levels is then comared to the results redicted by the models derived above. 4.1 Methodology For each dierent selection scheme, the GA is run 10 times in the noisy onemax domain for each noise level, and the results are averaged. The results are then lotted against redicted erformance for each noise level. For the onemax domain, the chromosome length is l = 100, and the oulation size is set according to Goldberg, Deb, and Clark (1992), which works out to N = 8( 2 + F 2 N ). For a binomially distributed oulation, the initial oulation variance is l(1? ), and the initial the ercentage of correct alleles in the oulation is assumed to be 0:5. Thus the oulation sizing equation works out to be N = 8( N ). To isolate the eects of selection, no mutation mechanism is used. The crossover mechanism is uniform crossover (Syswerda, 1989). As done in Thierens and Goldberg (1994) and Miller and Goldberg (1995), two rounds of crossover are erformed in each generation. The mating ool is selected by the selection scheme, crossover is used to roduce a new ool of osring, and then crossover is run again on the new osring to roduce the next generation. The creates a new generation that is more normally distributed than if one crossover er generation is used. This makes the selection model assumtion of a normally distributed oulation more accurate. However, Miller and Goldberg (1995) shows that for tournament selection, two crossovers er generation only has a small eect in the convergence erformance of the GA comared to one crossover er generation. The tested noise levels are taken to be 0, 0:5, 1, 2, and 4 times the initial function variance of 2 = 25. Thus the noise levels used in verifying the selection mechanisms are F 2 N = f0; 12:5; 25; 50; 100g. In each GA run, the run is stoed only after the oulation has fully converged.
9 8 4.2 Results This subsection details the results of our exeriments. The exerimental results are lotted along with the redicted erformance for each selection scheme in gure 1. In each lot, the dotted line is the redicted erformance, and the solid lines are the exerimental erformance (avg. of 10 runs). In most cases, the model accurately redicts the exerimental erformance, so that the redicted erformance (dashed line) is mostly obscured by the exerimental results (solid line). For the ordinal-based selection mechanisms (tournament selection, - selection, and linear ranking), there are ve sets of lines corresonding to the ve dierent noise levels. The lines, from left to right, corresond to the ve dierent noises levels of 2 N = f0; 12:5; 25; 50; 100g. Equations 3 and 11 are used to redict the erformance of the ordinal based selection schemes in the deterministic and noisy onemax domains resectively. The selection intensity for each of the ordinal selection schemes is calculated according to table 1, and is described in more detail below. The results for roortionate selection are resented in the stochastic universal selection below Tournament Selection For tournament selection, a tournament size of s = 2 was used, with a corresonding selection intensity (from table 1) of I = 2:2 = 0:5642: The maximal order statistic value was obtained from Harter (1970). The results, lotted in gure 1a, demonstrate that the convergence models were very accurate at redicting the convergence of tournament selection Selection For - selection, = 4 and = 8 was used. The corresonding selection intensity was calculating using table 1, along with the order statistic values obtained from Harter (1970). I = 1 4 ( 5:8 + 6:8 + 7:8 + 8:8 ) = 1 (0: : : :4236) 4 = 0:7253: The results, lotted in gure 1b, demonstrate that the convergence models were very accurate at redicting the convergence of - selection. Note that this exeriment had the same = ratio value of 0.5 as the binary tournament selection exeriment, yet had a higher selection ressure. The tradeo of eectively having higher values for and for the same ratio is that the resulting selected oulation has a lower variance. In general, selection mechanisms should maximize the resulting oulation variance for a given level of selection ressure in order to avoid remature convergence. This entails that for - selection, if there are several ossible and combinations that roduce a desired selection ressure, the combination with the smallest should be referred in ordered to maximize oulation diversity Linear Ranking For linear ranking selection, the number of desired coies of the best individual n + was set to 2, which made n? = 0. The corresonding selection intensity (from table 1) is I = 1 = 0:5642; which is equivalent to the binary tournament selection case. The results, lotted in gure 1c, demonstrate that the convergence models were very accurate at redicting the convergence of linear ranking.
10 9 100 Tournament Selection: s=2 100 Mu-Lambda Selection: mu=4, lambda=8 % Convergence Noise Var: 0,12.5,25,50,100 Predictive Model Exerimental Avg Generations % Convergence Noise Var: 0,12.5,25,50,100 Predictive Model Exerimental Avg Generations (a) Tournament Selection (b) - Selection 100 Linear Ranking Selection: n+ = Stochastic Universal Selection: c=0 % Convergence Noise Var: 0,12.5,25,50,100 Predictive Model Exerimental Avg Generations % Convergence Noise Var: 0,12.5,25,50,100 Predictive Model Exerimental Avg Generations (c) Linear Ranking Selection (d) - Selection Figure 1: Exerimental Results for the Onemax Domain Stochastic Universal Selection As equation 9 demonstrated that the convergence equation for noisy environments was equivalent to the deterministic case for roortionate selection, equation 5 was used to redict the erformance for stochastic universal selection at all noise levels. The redictive accuracy of our model for stochastic universal selection, equation 5, is shown in gure 1d. As the model is noise invariant, the runs at the ve dierent noise level roduced roughly the same lot, and therefore overlay each other in the gure. This accounts for the one dark line, which is also the redicted erformance for stochastic universal selection. This bears out the model's assumtion of noise invariance. Note that the number of generations until convergence is much larger than the rank-based selection schemes. While gure 1d demonstrates that our model accurately redicts the selection ressure of tness roortionate selection, it does not show that the absolute convergence times dier for dierent noise levels and oulation sizes. While the number of generation until the oulation reached 99.5% convergence is roughly equivalent for all ve noise levels, the time for absolute convergence ranged from 790 generation to 1420 generations. This can be exlained by the following: as the oulation aroaches near convergence for tness roortionate selection schemes, the resulting selection ressure becomes negligible. At this oint, the eect of genetic drift dominates the convergence rocess. The time until convergence under genetic drift is inuenced both by the noise and size of the oulation. However, this ending genetic drift is not free to let the oulation drift any which way, as the further away the oulation drifts from the otimum, the more selection ressure is alied. So in eect, there is a one-way genetic drift tendency of the oulation towards the otimum.
11 10 Accurate modeling of this one-way genetic drift in the resence of noise is an interesting toic that merits further research. 5 Conclusions Now that GAs are increasingly being used by industry, the eects of noise on erformance are becoming more imortant. This aer's main contribution is that it demonstrates how tness function noise will aect the convergence of GAs utilizing several common selection schemes. A noisy selection intensity model is derived that accurately redicts the erformance of several selection schemes in noisy environments, including tournament selection, - selection, linear ranking and stochastic universal selection. Furthermore, any selection scheme model based uon the deterministic selection intensity model can be similarly adated to handle noise. This noisy selection intensity model develoed in this aer has several immediate ractical alications. It can redict the convergence rate of a GA within a noisy environment, which is critical for time-sensitive alications. The model can be used to redict the solutions quality after a certain number of generations, and therefore be used to determine aroriate stoing criteria for noisy environments. For noisy tness functions where the noise is due to samling error, the model can be used to determine an otimal samle size for the tness function. An otimum samle size will maximize the erformance of a GA within a xed comutational time. This research also has several long term ramications. The basic aroach of this aer can be used to study the delaying eects of noise on other selection schemes. It may also be ossible to aly the same aroach to redict convergence delays resulting from noise inherent within other GA oerators, such as recombination or mutation. 6 Acknowledgments This work was suorted under NASA Grant No. NGT 9-4. This eort was also sonsored by the Air Force Oce of Scientic Research, Air Force Materiel Command, USAF, under grant numbers F and F The U.S. Government is authorized to reroduce and distribute rerints for Governmental uroses notwithstanding any coyright notation thereon. The views and conclusions contained herein are those of the authors and should not be interreted as necessarily reresenting the ocial olicies or endorsements, either exressed or imlied, of the Air Force Oce of Scientic Research or the U.S. Government. References Back, T. (1995). Generalized convergence models for tournament- and (,)-selection. In Eschelman, L. (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (. 2{8). San Francisco, CA: Morgan Kaufmann. Baker, J. E. (1985). Adative selection methods for genetic algorithms. In Grefenstette, J. J. (Ed.), Proceedings of an International Conference on Genetic Algorithms and Their Alications (. 101{111). Hillsdale, NJ: Lawrence Erlbaum Associates. Baker, J. E. (1987). Reducing bias and ineciency in the selection algorithm. In Grefenstette, J. J. (Ed.), Proceedings of the Second International Conference on Genetic Algorithms (. 14{21). Hillsdale, NJ: Lawrence Erlbaum Associates. Blickle, T., & Thiele, L. (1995). A comarison of selection schemes used in genetic algorithms (Technical Reort No. 11). Gloriastrasse 35, CH-8092 Zurich: Swiss Federal Institute of Technology (ETH) Zurich, Comuter Engineering and Communications Networks Lab (TIK). Booker, L. B. (1982). Intelligent behavior as an adatation to the task environment. Dissertations Abstracts International, 43 (2), 469B. (University Microlms No ). Brindle, A. (1981). Genetic algorithms for function otimization. Unublished doctoral dissertation, University of Alberta, Edmonton, Canada.
12 11 Forrest, S. (1985). Documentation for PRISONERS DILEMMA and NORMS rograms that use the genetic algorithm. Unublished manuscrit. Goldberg, D. E. (1989). Genetic algorithms in search, otimization, and machine learning. New York: Addison-Wesley. Goldberg, D. E., & Deb, K. (1991). A comarative analysis of selection schemes used in genetic algorithms. In Rawlins, G. J. E. (Ed.), Foundations of Genetic Algorithms (. 69{93). San Mateo, CA: Morgan Kaufmann. Goldberg, D. E., Deb, K., & Clark, J. H. (1992). Genetic algorithms, noise, and the sizing of oulations. Comlex Systems, 6, 333{362. Goldberg, D. E., Deb, K., & Thierens, D. (1993). Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers, 32 (1), 10{16. Goldberg, D. E., Korb, B., & Deb, K. (1989). Messy genetic algorithms: Motivation, analysis, and rst results. Comlex Systems, 3, 493{530. (Also TCGA Reort 89003). Grefenstette, J. J., & Baker, J. E. (1989). How genetic algorithms work: A critical look at imlicit arallelism. In Schaer, J. D. (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (. 20{27). San Mateo, CA: Morgan Kaufmann. Harter, H. L. (1970). Order statistics and their use in testing and estimation, Volume 2: Estimates Based on Order Statistics of Samles from Various Poulations. Washington, D.C.: U.S. Government Printing Oce. Holland, J. H. (1975). Adatation in natural and articial systems. Ann Arbor: University of Michigan Press. Miller, B. L., & Goldberg, D. E. (1995). Genetic algorithms, tournament selection, and the varying eects of noise (IlliGAL Reort No ). Urbana: University of Illinois at Urbana-Chamaign, Illinois Genetic Algorithms Laboratory. Muhlenbein, H., & Schlierkam-Voosen, D. (1993). Predictive models for the breeder genetic algorithm: I. Continuous arameter otimization. Evolutionary Comutation, 1 (1), 25{49. Schwefel, H.-P. (1981). Numerical otimization of comuter models. Chichester: Wiley. Syswerda, G. (1989). Uniform crossover in genetic algorithms. In Schaer, J. D. (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (. 2{9). San Mateo, CA: Morgan Kaufmann. Thierens, D., & Goldberg, D. (1994). Convergence models of genetic algorithm selection schemes. In Davidor, Y., Schwefel, H.-P., & Manner, R. (Eds.), Parallel Problem Solving from Nature- PPSN III (. 119{129). Berlin: Sringer-Verlag. Whitley, D. (1989). The Genitor algorithm and selective ressure: Why rank-based allocation of reroductive trials is best. In Schaer, J. D. (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (. 116{123). San Mateo, CA: Morgan Kaufmann.
Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationGeneral Linear Model Introduction, Classes of Linear models and Estimation
Stat 740 General Linear Model Introduction, Classes of Linear models and Estimation An aim of scientific enquiry: To describe or to discover relationshis among events (variables) in the controlled (laboratory)
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationParallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem
Parallel Quantum-insired Genetic Algorithm for Combinatorial Otimization Problem Kuk-Hyun Han Kui-Hong Park Chi-Ho Lee Jong-Hwan Kim Det. of Electrical Engineering and Comuter Science, Korea Advanced Institute
More informationDIFFERENTIAL evolution (DE) [3] has become a popular
Self-adative Differential Evolution with Neighborhood Search Zhenyu Yang, Ke Tang and Xin Yao Abstract In this aer we investigate several self-adative mechanisms to imrove our revious work on [], which
More informationA Simple Weight Decay Can Improve. Abstract. It has been observed in numerical simulations that a weight decay can improve
In Advances in Neural Information Processing Systems 4, J.E. Moody, S.J. Hanson and R.P. Limann, eds. Morgan Kaumann Publishers, San Mateo CA, 1995,. 950{957. A Simle Weight Decay Can Imrove Generalization
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationPERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM
PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM Takafumi Noguchi 1, Iei Maruyama 1 and Manabu Kanematsu 1 1 Deartment of Architecture, University of Tokyo,
More informationOn split sample and randomized confidence intervals for binomial proportions
On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have
More informationUse of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek
Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.
More informationScaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling
Scaling Multile Point Statistics or Non-Stationary Geostatistical Modeling Julián M. Ortiz, Steven Lyster and Clayton V. Deutsch Centre or Comutational Geostatistics Deartment o Civil & Environmental Engineering
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationHotelling s Two- Sample T 2
Chater 600 Hotelling s Two- Samle T Introduction This module calculates ower for the Hotelling s two-grou, T-squared (T) test statistic. Hotelling s T is an extension of the univariate two-samle t-test
More informationGene Pool Recombination in Genetic Algorithms
Gene Pool Recombination in Genetic Algorithms Heinz Mühlenbein GMD 53754 St. Augustin Germany muehlenbein@gmd.de Hans-Michael Voigt T.U. Berlin 13355 Berlin Germany voigt@fb10.tu-berlin.de Abstract: A
More informationVariable Selection and Model Building
LINEAR REGRESSION ANALYSIS MODULE XIII Lecture - 38 Variable Selection and Model Building Dr. Shalabh Deartment of Mathematics and Statistics Indian Institute of Technology Kanur Evaluation of subset regression
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationPlotting the Wilson distribution
, Survey of English Usage, University College London Setember 018 1 1. Introduction We have discussed the Wilson score interval at length elsewhere (Wallis 013a, b). Given an observed Binomial roortion
More information8 STOCHASTIC PROCESSES
8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular
More informationGenetic Algorithms with Dynamic Niche Sharing. for Multimodal Function Optimization. at Urbana-Champaign. IlliGAL Report No
Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization Brad L. Miller Dept. of Computer Science University of Illinois at Urbana-Champaign Michael J. Shaw Beckman Institute
More informationCharacterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations
Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations PINAR KORKMAZ, BILGE E. S. AKGUL and KRISHNA V. PALEM Georgia Institute of
More informationGenetic Algorithm Based PID Optimization in Batch Process Control
International Conference on Comuter Alications and Industrial Electronics (ICCAIE ) Genetic Algorithm Based PID Otimization in Batch Process Control.K. Tan Y.K. Chin H.J. Tham K.T.K. Teo odelling, Simulation
More informationChapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population
Chater 7 and s Selecting a Samle Point Estimation Introduction to s of Proerties of Point Estimators Other Methods Introduction An element is the entity on which data are collected. A oulation is a collection
More informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationUsing the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process
Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process P. Mantalos a1, K. Mattheou b, A. Karagrigoriou b a.deartment of Statistics University of Lund
More informationIntroduction to Probability and Statistics
Introduction to Probability and Statistics Chater 8 Ammar M. Sarhan, asarhan@mathstat.dal.ca Deartment of Mathematics and Statistics, Dalhousie University Fall Semester 28 Chater 8 Tests of Hyotheses Based
More informationCSC165H, Mathematical expression and reasoning for computer science week 12
CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml
More informationSystem Reliability Estimation and Confidence Regions from Subsystem and Full System Tests
009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More informationUsing a Computational Intelligence Hybrid Approach to Recognize the Faults of Variance Shifts for a Manufacturing Process
Journal of Industrial and Intelligent Information Vol. 4, No. 2, March 26 Using a Comutational Intelligence Hybrid Aroach to Recognize the Faults of Variance hifts for a Manufacturing Process Yuehjen E.
More informationBayesian System for Differential Cryptanalysis of DES
Available online at www.sciencedirect.com ScienceDirect IERI Procedia 7 (014 ) 15 0 013 International Conference on Alied Comuting, Comuter Science, and Comuter Engineering Bayesian System for Differential
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More informationabout the problem can be used in order to enhance the estimation and subsequently improve convergence. New strings are generated according to the join
Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence Martin Pelikan Dept. of General Engineering and Dept. of Computer Science University of Illinois, Urbana, IL 61801 pelikan@illigal.ge.uiuc.edu
More informationx and y suer from two tyes of additive noise [], [3] Uncertainties e x, e y, where the only rior knowledge is their boundedness and zero mean Gaussian
A New Estimator for Mixed Stochastic and Set Theoretic Uncertainty Models Alied to Mobile Robot Localization Uwe D. Hanebeck Joachim Horn Institute of Automatic Control Engineering Siemens AG, Cororate
More informationDistributed Rule-Based Inference in the Presence of Redundant Information
istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced
More informationBiitlli Biointelligence Laboratory Lb School of Computer Science and Engineering. Seoul National University
Monte Carlo Samling Chater 4 2009 Course on Probabilistic Grahical Models Artificial Neural Networs, Studies in Artificial i lintelligence and Cognitive i Process Biitlli Biointelligence Laboratory Lb
More informationEstimation of component redundancy in optimal age maintenance
EURO MAINTENANCE 2012, Belgrade 14-16 May 2012 Proceedings of the 21 st International Congress on Maintenance and Asset Management Estimation of comonent redundancy in otimal age maintenance Jorge ioa
More informationA SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE
THE 19 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE K.W. Gan*, M.R. Wisnom, S.R. Hallett, G. Allegri Advanced Comosites
More informationSupplementary Materials for Robust Estimation of the False Discovery Rate
Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More informationA Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression
Journal of Modern Alied Statistical Methods Volume Issue Article 7 --03 A Comarison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Ghadban Khalaf King Khalid University, Saudi
More informationPOWER DENSITY OPTIMIZATION OF AN ARRAY OF PIEZOELECTRIC HARVESTERS USING A GENETIC ALGORITHM
International Worksho SMART MATERIALS, STRUCTURES & NDT in AEROSPACE Conference NDT in Canada 11-4 November 11, Montreal, Quebec, Canada POWER DENSITY OPTIMIZATION OF AN ARRAY OF PIEZOELECTRIC HARVESTERS
More informationLending Direction to Neural Networks. Richard S. Zemel North Torrey Pines Rd. La Jolla, CA Christopher K. I.
Lending Direction to Neural Networks Richard S Zemel CNL, The Salk Institute 10010 North Torrey Pines Rd La Jolla, CA 92037 Christoher K I Williams Deartment of Comuter Science University of Toronto Toronto,
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More informationA MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST BASED ON THE WEIBULL DISTRIBUTION
O P E R A T I O N S R E S E A R C H A N D D E C I S I O N S No. 27 DOI:.5277/ord73 Nasrullah KHAN Muhammad ASLAM 2 Kyung-Jun KIM 3 Chi-Hyuck JUN 4 A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST
More informationAn Investigation on the Numerical Ill-conditioning of Hybrid State Estimators
An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical
More informationA Game Theoretic Investigation of Selection Methods in Two Population Coevolution
A Game Theoretic Investigation of Selection Methods in Two Poulation Coevolution Sevan G. Ficici Division of Engineering and Alied Sciences Harvard University Cambridge, Massachusetts 238 USA sevan@eecs.harvard.edu
More informationA New GP-evolved Formulation for the Relative Permittivity of Water and Steam
ew GP-evolved Formulation for the Relative Permittivity of Water and Steam S. V. Fogelson and W. D. Potter rtificial Intelligence Center he University of Georgia, US Contact Email ddress: sergeyf1@uga.edu
More informationLOGISTIC REGRESSION. VINAYANAND KANDALA M.Sc. (Agricultural Statistics), Roll No I.A.S.R.I, Library Avenue, New Delhi
LOGISTIC REGRESSION VINAANAND KANDALA M.Sc. (Agricultural Statistics), Roll No. 444 I.A.S.R.I, Library Avenue, New Delhi- Chairerson: Dr. Ranjana Agarwal Abstract: Logistic regression is widely used when
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationCHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules
CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules. Introduction: The is widely used in industry to monitor the number of fraction nonconforming units. A nonconforming unit is
More informationCorrespondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationsubstantial literature on emirical likelihood indicating that it is widely viewed as a desirable and natural aroach to statistical inference in a vari
Condence tubes for multile quantile lots via emirical likelihood John H.J. Einmahl Eindhoven University of Technology Ian W. McKeague Florida State University May 7, 998 Abstract The nonarametric emirical
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationAggregate Prediction With. the Aggregation Bias
100 Aggregate Prediction With Disaggregate Models: Behavior of the Aggregation Bias Uzi Landau, Transortation Research nstitute, Technion-srael nstitute of Technology, Haifa Disaggregate travel demand
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationPeriod-two cycles in a feedforward layered neural network model with symmetric sequence processing
PHYSICAL REVIEW E 75, 4197 27 Period-two cycles in a feedforward layered neural network model with symmetric sequence rocessing F. L. Metz and W. K. Theumann Instituto de Física, Universidade Federal do
More informationOne step ahead prediction using Fuzzy Boolean Neural Networks 1
One ste ahead rediction using Fuzzy Boolean eural etworks 1 José A. B. Tomé IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa jose.tome@inesc-id.t João Paulo Carvalho IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa
More informationChurilova Maria Saint-Petersburg State Polytechnical University Department of Applied Mathematics
Churilova Maria Saint-Petersburg State Polytechnical University Deartment of Alied Mathematics Technology of EHIS (staming) alied to roduction of automotive arts The roblem described in this reort originated
More informationOne-way ANOVA Inference for one-way ANOVA
One-way ANOVA Inference for one-way ANOVA IPS Chater 12.1 2009 W.H. Freeman and Comany Objectives (IPS Chater 12.1) Inference for one-way ANOVA Comaring means The two-samle t statistic An overview of ANOVA
More informationAI*IA 2003 Fusion of Multiple Pattern Classifiers PART III
AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell October 25, 2009 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationAdaptive estimation with change detection for streaming data
Adative estimation with change detection for streaming data A thesis resented for the degree of Doctor of Philosohy of the University of London and the Diloma of Imerial College by Dean Adam Bodenham Deartment
More informationPrincipal Components Analysis and Unsupervised Hebbian Learning
Princial Comonents Analysis and Unsuervised Hebbian Learning Robert Jacobs Deartment of Brain & Cognitive Sciences University of Rochester Rochester, NY 1467, USA August 8, 008 Reference: Much of the material
More informationFitness Inheritance in Multi-Objective Optimization
Fitness Inheritance in Multi-Objective Optimization Jian-Hung Chen David E. Goldberg Shinn-Ying Ho Kumara Sastry IlliGAL Report No. 2002017 June, 2002 Illinois Genetic Algorithms Laboratory (IlliGAL) Department
More informationChapter 1 Fundamentals
Chater Fundamentals. Overview of Thermodynamics Industrial Revolution brought in large scale automation of many tedious tasks which were earlier being erformed through manual or animal labour. Inventors
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analysis of Variance and Design of Exeriment-I MODULE II LECTURE -4 GENERAL LINEAR HPOTHESIS AND ANALSIS OF VARIANCE Dr. Shalabh Deartment of Mathematics and Statistics Indian Institute of Technology Kanur
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationA Parallel Algorithm for Minimization of Finite Automata
A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 E-mail: fravi,xiongg@cs.uri.edu Abstract In this
More informationDeriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.
Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &
More informationute measures of uncertainty called standard errors for these b j estimates and the resulting forecasts if certain conditions are satis- ed. Note the e
Regression with Time Series Errors David A. Dickey, North Carolina State University Abstract: The basic assumtions of regression are reviewed. Grahical and statistical methods for checking the assumtions
More informationDeveloping A Deterioration Probabilistic Model for Rail Wear
International Journal of Traffic and Transortation Engineering 2012, 1(2): 13-18 DOI: 10.5923/j.ijtte.20120102.02 Develoing A Deterioration Probabilistic Model for Rail Wear Jabbar-Ali Zakeri *, Shahrbanoo
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationEfficient Discretization Scheduling in Multiple Dimensions. Laura A. Albert and David E. Goldberg. IlliGAL Report No February 2002
Efficient Discretization Scheduling in Multiple Dimensions Laura A. Albert and David E. Goldberg IlliGAL Report No. 2002006 February 2002 Illinois Genetic Algorithms Laboratory University of Illinois at
More informationProbability Estimates for Multi-class Classification by Pairwise Coupling
Probability Estimates for Multi-class Classification by Pairwise Couling Ting-Fan Wu Chih-Jen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics
More informationUnderstanding and Using Availability
Understanding and Using Availability Jorge Luis Romeu, Ph.D. ASQ CQE/CRE, & Senior Member Email: romeu@cortland.edu htt://myrofile.cos.com/romeu ASQ/RD Webinar Series Noviembre 5, J. L. Romeu - Consultant
More informationLower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data
Quality Technology & Quantitative Management Vol. 1, No.,. 51-65, 15 QTQM IAQM 15 Lower onfidence Bound for Process-Yield Index with Autocorrelated Process Data Fu-Kwun Wang * and Yeneneh Tamirat Deartment
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
More informationSIMULATION OF DIFFUSION PROCESSES IN LABYRINTHIC DOMAINS BY USING CELLULAR AUTOMATA
SIMULATION OF DIFFUSION PROCESSES IN LABYRINTHIC DOMAINS BY USING CELLULAR AUTOMATA Udo Buschmann and Thorsten Rankel and Wolfgang Wiechert Deartment of Simulation University of Siegen Paul-Bonatz-Str.
More informationPretest (Optional) Use as an additional pacing tool to guide instruction. August 21
Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational
More informationx(n) x(n) H (f) y(n) Z -1 Z -1 x(n) ^
SOE FUNDAENTAL POPETIES OF SE FILTE BANKS. Kvanc hcak, Pierre oulin, Kannan amchandran University of Illinois at Urbana-Chamaign Beckman Institute and ECE Deartment 405 N. athews Ave., Urbana, IL 680 Email:
More informationFE FORMULATIONS FOR PLASTICITY
G These slides are designed based on the book: Finite Elements in Plasticity Theory and Practice, D.R.J. Owen and E. Hinton, 1970, Pineridge Press Ltd., Swansea, UK. 1 Course Content: A INTRODUCTION AND
More informationAn Improved Calibration Method for a Chopped Pyrgeometer
96 JOURNAL OF ATMOSPHERIC AND OCEANIC TECHNOLOGY VOLUME 17 An Imroved Calibration Method for a Choed Pyrgeometer FRIEDRICH FERGG OtoLab, Ingenieurbüro, Munich, Germany PETER WENDLING Deutsches Forschungszentrum
More informationSAS for Bayesian Mediation Analysis
Paer 1569-2014 SAS for Bayesian Mediation Analysis Miočević Milica, Arizona State University; David P. MacKinnon, Arizona State University ABSTRACT Recent statistical mediation analysis research focuses
More informationFinding recurrent sources in sequences
Finding recurrent sources in sequences Aristides Gionis Deartment of Comuter Science Stanford University Stanford, CA, 94305, USA gionis@cs.stanford.edu Heikki Mannila HIIT Basic Research Unit Deartment
More informationMULTIVARIATE STATISTICAL PROCESS OF HOTELLING S T CONTROL CHARTS PROCEDURES WITH INDUSTRIAL APPLICATION
Journal of Statistics: Advances in heory and Alications Volume 8, Number, 07, Pages -44 Available at htt://scientificadvances.co.in DOI: htt://dx.doi.org/0.864/jsata_700868 MULIVARIAE SAISICAL PROCESS
More informationA generalization of Amdahl's law and relative conditions of parallelism
A generalization of Amdahl's law and relative conditions of arallelism Author: Gianluca Argentini, New Technologies and Models, Riello Grou, Legnago (VR), Italy. E-mail: gianluca.argentini@riellogrou.com
More informationUnderstanding and Using Availability
Understanding and Using Availability Jorge Luis Romeu, Ph.D. ASQ CQE/CRE, & Senior Member C. Stat Fellow, Royal Statistical Society Past Director, Region II (NY & PA) Director: Juarez Lincoln Marti Int
More informationOptimizing the Polynomial to Represent the Extended True Boiling Point Curve from High Vacuum Distillation Data Using Genetic Algorithms
1561 A ublication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 43, 015 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Coyright 015, AIDIC Servizi S.r.l., ISBN 978-88-95608-34-1; ISSN 83-916 The Italian Association
More informationAn Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno, Switzerland
More informationOn the Relationship Between Packet Size and Router Performance for Heavy-Tailed Traffic 1
On the Relationshi Between Packet Size and Router Performance for Heavy-Tailed Traffic 1 Imad Antonios antoniosi1@southernct.edu CS Deartment MO117 Southern Connecticut State University 501 Crescent St.
More informationOn Wald-Type Optimal Stopping for Brownian Motion
J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of
More informationThe Binomial Approach for Probability of Detection
Vol. No. (Mar 5) - The e-journal of Nondestructive Testing - ISSN 45-494 www.ndt.net/?id=7498 The Binomial Aroach for of Detection Carlos Correia Gruo Endalloy C.A. - Caracas - Venezuela www.endalloy.net
More informationGenetic variation of polygenic characters and the evolution of genetic degeneracy
Genetic variation of olygenic characters and the evolution of genetic degeneracy S. A. FRANK Deartment of Ecology and Evolutionary Biology, University of California, Irvine, CA, USA Keywords: mutation;
More informationWhen in doubt, tell the truth... Mark Twain I. INTRODUCTION. Dening an accurate framework in which the study of all radiative decays of light avor mes
Phys. Rev. D59, 407 (999) UK/TP 99{0 LPNHE 99{0 SLAC{PUB{8048 he-h/99036 Radiative Decays, Nonet Symmetry and SU(3) Breaking M. Benayoun a, L. DelBuono a, S. Eidelman a;b, V. N. Ivanchenko a;b, H.B. O'Connell
More information