Parallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem
|
|
- Thomasine Bryant
- 5 years ago
- Views:
Transcription
1 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 of Science and Technology(KAIST), 373-1, Kusong-dong Yusong-gu, Taejon, 35-71, Reublic of Korea Abstract- This aer rooses a new arallel evolutionary algorithm called arallel quantum-insired genetic algorithm (PQGA). Quantum-insired genetic algorithm(qga) is based on the concet and rinciles of quantum comuting such as qubits and suerosition of states. Instead of binary, numeric, or symbolic reresentation, by adoting qubit chromosome as a reresentation, QGA can reresent a linear suerosition of solutions due to its robabilistic reresentation. QGA is suitable for arallel structure because of raid convergence and good global search caability. That is, QGA is able to ossess the two characteristics of exloration and exloitation, simultaneously. The effectiveness and the alicability of PQGA are demonstrated by exerimental results on the knasack roblem, which is a well-known combinatorial otimization roblem. The results show that PQGA is suerior to QGA as well as other conventional genetic algorithms. 1 Introduction Evolutionary algorithms(eas) are rincially stochastic searches and otimization methods based on the rinciles of natural biological evolution. Comared to the traditional otimization methods, such as calculus-based and enumerative stragegies, EAs are robust, global and can be generally alied without recourse to domain-secic heuristics. But the characteristics of oulation diversity and selective ressure are not easy to be imlemented in EAs such as evolutionary rogramming(ep), evolution strategies(es) and genetic algorithm(ga), simultaneously. As selective ressure is increased, the search focuses on the to individuals in the oulation, but because of this exloitation genetic diversity is lost. The reason is that the reresentations of EAs are dened using deterministic values. The new evolutionary algorithm which uses stochastic reresentation was roosed in [1]. QGA are characterized by raid convergence and global search caability, simultaneously. QGA is based on the concet and rinciles of quantum comuting such as qubits and a linear suerosition of states. One individual of QGA can reresent many states at the same time, and there are weak relationshis between individuals since each individual is determined by current best solution and its robability, that is, the history of individual, u to date. Because of this reason, QGA is suitable for arallel structure. Recently, arallel evolutionary algorithms (PEAs) have been used to slove more difcult roblems which need a bigger oulation. This results in higher comutational cost. The basic motivation behind many early studies of PEAs was to reduce the rocessing time needed to reach an accetable solution [2]. This was accomlished by imlementing EAs on different arallel architecture. In addition, it was noted that in some cases the PEAs found better solutions than comarably sized serial EAs. There are several aroaches to arallelize the serial EAs [2, 3, 4, 5]. This aer offers a new arallel evolutionary algorithm called arallel quantum-insired genetic algorithm (PQGA). Esecially, a coarse-grained arallel scheme was alied to PQGA. PQGA can reduce the comutational time as comared with QGA. This aer is organized as follows. Section 2 and 3 describe the new evolutionary algorithm, QGA and the arallel quantum-insired genetic algorithm, resectively. Section 4 contains a descrition of the exeriment with GAs, QGAs and PQGAs for knasack roblems for comarison urose. Section 5 summarizes and analyzes the exerimental results. Concluding remarks follow in Section 6. 2 Quantum-insired Genetic Algorithm (QGA) QGA is based on the concets of qubits and suerosition of states of quantum mechanics. The smallest unit of information stored in a two-state quantum comuter is called a quantum bit or qubit [6]. A qubit may be in the 1 state, in the state, or in any suerosition of the two. The state of a qubit can be reresented as jψi = ffji + j1i; (1) where ff and are comlex numbers that secify the robability amlitudes of the corresonding states. jffj 2 gives the robability that the qubit will be found in state and jj 2 gives the robability that the qubit will be found in the 1 state. Normalization of the state to unity guarantees jffj 2 + jj 2 =1: (2) If there is a system of m-qubits, the system can contain information of 2 m states. However, in the act of observing a
2 quantum state, it collases to a single state [7]. 2.1 Reresentation It is ossible to use a number of different reresentations to encode the solutions onto chromosomes in evolutionary algorithm. The classical reresentations can be broadly classied as: binary, numeric, and symbolic [8]. QGA uses a novel reresentation that is based on the concet of qubits. One qubit is dened with a air of comlex numbers, (ff; ), as» ff ; which is characterized by (1) and (2). And an m-qubits reresentation is dened as» ff 1 ff 2 ff m 1 2 ; (3) m where jff i j 2 + j i j 2 =1, i =1; 2; ;m. This reresentation has the advantage that it is able to reresent a suerosition of states. If there is, for instance, a three-qubits system with three airs of amlitudes such as " # ; (4) the state of the system can be reresented as 1 ji j1i 1 j1i 3 j11i (5) j1i 4 + j11i 1 3 j11i j111i The above result means that the robabilities to reresent the state ji, j1i, j1i, j11i, j1i, j11i, j11i, and j111i are 1, 3, 1, 3, 1, 3, 1, and 3, resectively. By consequence, the three-qubits system of (4) contains information of eight states. Evolutionary comuting with qubit reresentation has a better characteristic of diversity than classical aroaches, since it can reresent suerosition of states. Only one qubit chromosome such as (4) is enough to reresent eight states, but in classical reresentation at least eight chromosomes, (), (1), (1), (11), (1), (11), (11), and (111) are needed. Convergence can be also obtained with the qubit reresentation. As jff i j 2 or j i j 2 aroaches to 1 or, the qubit chromosome converges to a single state and the roerty of diversity disaears gradually. That is, the qubit reresentation is able to ossess the two characteristics of exloration and exloitation, simultaneously. 2.2 QGA The structure of QGA is described in the following. rocedure QGA t ψ initialize Q(t) make P (t) by observing Q(t) states evaluate P (t) store the best solution among P (t) while (not termination-condition) do t ψ t +1 make P (t) by observing Q(t 1) states evaluate P (t) udate Q(t) using quantum gates U (t) store the best solution among P (t) QGA is a robabilistic algorithm which is similar to genetic algorithm. QGA maintains a oulation of qubit chromosomes, Q(t) =fq t 1; q t 2; ; q t ng at generation t, where n is the size of oulation, and q t j is a qubit chromosome dened as q t j =» ff t 1 t 1 ff t 2 t 2 ff t m t ; (6) m where m is the number of qubits, i.e., the string length of the qubit chromosome, and j =1; 2; ;n. In the ste of initialize Q(t), ff t i and t i, i =1; 2; ;m, of all q t j, j = 1; 2; ;n,inq(t) are initialized with 1 2. It means that one qubit chromosome, q t j j t= reresents the linear suerosition of all ossible states with the same robability: X m 2 jψ q j i = 1 js ki; 2 m k=1 where S k is the k-th state reresented by the binary string (x 1 x 2 x m ). x i, i = 1; 2; ;m, is either or 1. The next ste makes a set of binary solutions, P (t), by observing Q(t) states, where P (t) =fx t ; 1 xt ; ; 2 xt ng at generation t. One binary solution, x t j, j = 1; 2; ;n, is a binary string of length m, and is formed by selecting each bit using the robability of qubit, either jff t i j2 or ji tj2, i =1; 2; ;m,of q t j. Each solution xt j is evaluated to give some measure of its tness. The initial best solution is then selected and stored among the binary solutions, P (t). In the while loo, one more ste, udate Q(t), is included to have tter states of the qubit chromosomes. A set of binary solutions, P (t), is formed by observing Q(t 1) states as with the rocedure described before, and each binary solution is evaluated to give the tness value. In the next ste, udate Q(t), a set of qubit chromosomes Q(t) is udated by alying some aroriate quantum gates 1 U (t), which is 1 Quantum gates are reversible gates and can be reresented as unitary oerators acting on the qubit basis states: U y U = UU y, where U y is the hermitian adjoint of U. There are several quantum gates, such as NOT gate, Controlled NOT gate, Rotation gate, Hadamard gate, etc.[6].
3 formed by using the binary solutions P (t) and the best stored solution. The aroriate quantum gates can be designed in comliance with ractical roblems. Rotation gates such as» cos( ) sin( ) U ( ) = ; (7) sin( ) cos( ) where is a rotation angle, will be used for knasack roblems in the next section. This ste makes the qubit chromosomes converge to the tter states. The best solution among P (t) is selected in the next ste, and if the solution is tter than the best stored solution, the stored solution is relaced by this best solution. The binary solutions P (t) are discarded at the of the loo. In QGA, the oulation size, i.e., the number of qubit chromosomes is always ket constant. This is due to conservation of qubits based on quantum comuting. QGA with the qubit reresentation can have better convergence with diversity than conventional GAs which have xed and 1 information. 3 Parallel Quantum-insired Genetic Algorithm (PQGA) To nd more otimized solution in shorter comuting time, arallelization of EAs is indisensable. The basic motivation behind many early studies of PEAs was to reduce the rocessing time needed to reach an accetable solution. This was accomlished by imlementing EAs on different arallel architectures. Using many rocesses shortens the comuting time. In the exeriments reorted in [3], Using n rocessers shortens the comutation time by a factor whose value is limited to n. In the shifting balancing theory roosed by Sewall Wright [3], the evolution seed of small suboulations with loose connection is faster than that of large oulation. In addition, it was noted that in some cases the PEAs found better solutions than comarably sized serial EAs, because the migration of individuals between suboulations introduces the ossibility of global search. The arallelization of EAs has been imlemented in several ways, like globally PEAs, coarse-grained PEAs and negrained PEAs. These are classication according to the connection toology of multi-rocessors [2, 3]. Also, the hybrid structure can be alied for arallelization [9]. The coarsegrained arallel scheme is considered here. The imortant characteristics of coarse-grained algorithms are the use of few relatively large demes and the introduction of a migration oerator. The whole oulation is divided into some number of oulations, each suboulation evolves indeently, and the exchange of individuals, called migration, occurs after some generations. This scheme can be easily imlemented and even if there is no arallel comuter available, it is easy to simulate one with a network of workstation or even in a single rocessor machine. Utilizing migration and using some number of demes revent converging to local otima. The erformance of CGPEAs mostly des on the migration rate, migration eriod and the selection of migrated individuals. The methods of migration scheme are random migration, imrovement insertion, worst deletion, best migration and crossover migration. One individual of QGA can reresent many states at the same time, and there are weak relationshis during individuals since each individual is determined by current best solution and its robability. Because of this characteristic, QGA is better than EAs such as EP, GA and ES for imlementation of a arallel architecture. The best migration scheme was considered for the method of migration in this aer. 4 Exeriment The knasack roblem, a kind of combinatorial otimization roblem, is used to investigate the erformance of PQGA. The knasack roblem can be described as selecting from among various items those items which are most rotable, given that the knasack has limited caacity. The -1 knasack roblem is described as: given a set of m items and a knasack, select a subset of the items so as to maximize the rot f (x): subject to f (x) = i x i ; w i x i» C; where x =(x 1 x m ), x i is or 1, i is the rot of item i, w i is the weight of item i, and C is the caacity of the knasack. In this section, some conventional GA methods used in the -1 knasack roblem are described, and this is followed by the detailed algorithms of QGA and PQGA for the knasack roblem. 4.1 Conventional GA methods Three tyes of conventional algorithms are described and tested: algorithms based on enalty functions, algorithms based on reair methods, and algorithm based on decoder [1]. In all the algorithms based on enalty functions, a binary string of the length m reresents a chromosome x for the roblem. The rot f (x) of each string is determined as f (x) = i x i Pen(x); where Pen(x) is a enalty function. There are many ossible strategies for assigning the enalty function [11, 12]. Two tyes of enalties are considered, such as logarithmic enalty and linear enalty: Pen 1 (x) = log 2 (1 + ρ ( P m w ix i C)) ;
4 Pen 2 (x) =ρ ( P m w ix i C) ; where ρ is max m f i =w i g. In algorithms based on reair methods, the rot f (x) of each string is determined as f (x) = i x i; where x is a reaired vector of the original vector x. Original chromosomes are relaced with a 5% robability in the exeriment. The two reair algorithms considered here differ only in selection rocedure, which chooses an item for removal from the knasack: Re 1 (random reair): The selection rocedure selects a random element from the knasack. Re 2 (greedy reair): All items in the knasack are sorted in the decreasing order of their rot to weight ratios. The selection rocedure always chooses the last item for deletion. A ossible decoder for the knasack roblem is based on an integer reresentation. Each chromosome is a vector of m integers; the i-th comonent of the vector is an integer in the range from 1 to m i +1. The ordinal reresentation references a list L of items; a vector is decoded by selecting aroriate item from the current list. Dec 1 (random decoding): The build rocedure creates a list L of items such that the order of items on the list corresonds to the order of items in the inut le which is random. 4.2 QGA for the knasack roblem The algorithm of QGA for the knasack roblem is based on the structure of QGA roosed and it contains a reair algorithm. The algorithm can be written as follows: rocedure QGA t ψ initialize Q(t) make P (t) by observing Q(t) states reair P (t) evaluate P (t) store the best solution b among P (t) while (t <MAX GEN) do t ψ t +1 make P (t) by observing Q(t 1) states reair P (t) evaluate P (t) udate Q(t) store the best solution b among P (t) A qubit string of length m reresents a linear suerosition of solutions as in (6) to the roblem. The length of a qubit string is the same as the number of items. The i-th item can be selected for the knasack with robability j i j 2 or (1 jff i j 2 ). Thus, a binary string of length m is formed from the qubit string. For every bit in the binary string, we generate a random number r from the range [::1]; ifr>jff i j 2, we set the bit of the binary string. The binary string x t j, j =1; 2; ;n, of P (t) reresents a j-th solution to the roblem. For notational simlicity, x is used instead of x t j in the following. The i-th item is selected for the knasack iff x i =1, where x i is the i-th bit of x. The reair algorithm of QGA for the knasack roblem is imlemented as follows: rocedure reair (x) knasack-overlled ψ false if P m w ix i >C then knasack-overlled ψ true while (knasack-overlled) do select an i-th item from the knasack x i ψ if P m w ix i» C then knasack-overlled ψ false while (not knasack-overlled) do select a j-th item from the knasack x j ψ 1 if P m w ix i >C then knasack-overlled ψ true x j ψ P m The rot of a binary solution x is evaluated by ix i, and it is used to nd the best solution b after the udate of q j, j =1; 2; ;n. A qubit chromosome q j is udated by using the rotation gate U ( ) of (7) in this algorithm. The i-th qubit value (ff i ; i ) is udated as»»» ff i cos( i ) sin( i ) f = : (8) sin( i ) cos( i ) i i In this knasack roblem i is given as s(ff i i ) i. The arameters used are shown in Table 1. For examle, if the condition, f (x) f (b), is satised and x i and b i are 1 and, resectively, we can set the value of i as :25ß and s(ff i i ) as +1, 1,or according to the condition of ff i i so as to increase the robability of the state j1i. The value of i has an effect on the seed of convergence, but if it is too big, the solutions may diverge or have a remature convergence to a local otimum. The sign s(ff i i ) determines the direction of convergence to a global otimum. The looku table can be
5 s(ff i i ) x i b i f (x) i ff i i ff i i ff i i f (b) > < = = false true 1 false 1 true :5ß 1 +1 ±1 1 false :1ß 1 +1 ±1 1 true :25ß +1 1 ±1 1 1 false :5ß +1 1 ±1 1 1 true :25ß +1 1 ±1 Table 1: Looku table of i, where f ( ) is the rot, s(ff i i ) is the sign of i, and b i and x i are the i-th bits of the best solution b and the binary solution x, resectively. Figure 1: The connection structure for 4 rocessors. used as a strategy for convergence. This udate rocedure can be described as follows: rocedure udate (q) i ψ while (i <m) do i ψ i +1 determine i with the looku table obtain (ff i ; i ) as: [ff i i ]T = U ( i )[ff i i ] T q ψ q The udate rocedure can be imlemented using various methods with aroriate quantum gates. It des on a given roblem. 4.3 PQGA for the knasack roblem The structure of each rocessor was same as the rocedure of QGA as mentioned reviously. The coarse-grained arallel scheme and the best migration method were used in these exeriments. In QGA, the best solution migrated from other rocessor cannot cause raid convergence to ossibly local otimum, since QGA has a robabilistic reresentation including the meaning of history of evolved individual. To reduce the load of communication between each rocessors, new structures were used as Figure 1 and 2. Figure 1 and 2 show the connection structures for 4 rocessors and 16 rocessors, resectively. Figure 2: The connection structure for 16 rocessors. 5 Results In all exeriments strongly correlated sets of unsorted data were considered: w i = uniformly random[1; 1) i = w i +5: Average knasack caacity given by: C = 1 2 was used. The oulation size considered for all the six conventional genetic algorithms (CGAs) was equal to 1. As in [1], robabilities of crossover and mutation were xed as.5 and.1, resectively. The oulation size of QGA1 was equal to 1, and the oulation size of QGA2 was equal to 48, this being the only difference between QGA1 and QGA2. The number of rocessors of PQGA1 and PQGA2 were equal to 4 and 16, and the suboulation sizes in each rocessor of PQGA1 and PQGA2 were equal to 12 and 3, resectively. The migration eriod of PQGA1 is 2 generations. In PQGA2, there are 4 sub-grous in the overall structure, and each sub-grou includes 4 rocessors. There are 3 suboulations in each rocessor. The migration between the rocessors occurs every 2 generations, and the w i
6 ] of CGAs QGAs PQGAs items Pen1 Pen2 Re1 Re2 Dec1 P 2R1 QGA1 QGA2 PQGA1 PQGA2 b rots m w t(sec=run) b rots m w t(sec=run) b rots m w t(sec=run) Table 2: Exerimental results of the knasack roblem: the maximum number of generations 1, the number of runs 3. P 2R1 means the algorithm imlemented by P en2 and Re1, and b:, m:, and w: means best, mean, and worst, resectively. t(sec=run) reresents the elased time er one run. migration between the sub-grous takes lace every 5 generations. As a erformance measure of the algorithm we collected the best solution found within 1 generations over 3 runs, and we checked the elased time er one run. A Pentium-III 8MHz was used, running Visual C Table 2 shows the exerimental results of the knasack roblems with 1, 25, and 5 items. In the case of 1 items, PQGA yielded suerior results as comared to all the other CGAs and QGAs. The CGA designed by using a linear enalty function and random reair algorithm outerformed all other CGAs, but is behind QGAs as well as PQGAs in erformance. The results show that PQGAs and QGAs erform well in site of small size of oulation. Judging from the results, PQGAs and QGAs can search solutions near the otimum within a short time as comared to CGAs, and although the total oulation number of PQGAs is equal to that of QGA2 (oulation size 48), PQGAs outerformed QGA2 in best solution and comutation time. In the cases of 25 and 5 items, the exerimental results again demonstrate the sueriority of PQGAs. Figure 3 shows the rogress of the mean of best rots and the mean of average rots of oulation found by PQGA1, PQGA2, QGA1, QGA2 and CGA over 3 runs for 1, 25, and 5 items. PQGAs erforms better than QGAs and CGAs in terms of convergence rate and nal results. Initially, QGA2 including 48 oulations shows the fastest convergence rate. PQGAs shows a slower convergence rate than QGAs due to its small oulation number in one rocessor. But in 2 generations, PQGAs outace QGA2. It is caused by the best migration between rocessors. Esecillay, in the cases of 25 items and 5 items, PQGA2 outerforms PQGA1 in best solution. The reason is that the structure of PQGA2 can increase the oulation diversity. PQGAs nal results are better than QGA s and CGA s in 1 generations. The tency of convergence rate can be shown clearly in the results of the mean of average rots of oulation. In the ning, convergence rates of all the algorithms increase. But CGA maintains a nearly constant rot due to its remature convergence, while QGA aroaches towards the neighborhood of global otima with a constant convergence rate. Esecially, after migrations, PQGAs have a faster convergence rate to nd out global otima. The exerimental results demonstrate the effectiveness and the alicability of PQGA. Esecially, gure 3 shows excellent global search ability and sueriority of convergence ability of PQGA. 6 Conclusions This aer roosed a new arallel evolutionary algorithm, PQGA with a quantum reresentation and a coarse-grained arallel scheme. Since QGA is based on the rinciles of quantum comuting such as concets of qubits and suerosition of states, it can reresent a linear suerosition of states, and there is no need to include many individuals. QGA has excellent ability of global search due to its diversity caused by the robabilistic reresentation, and it can aroach better solutions than CGA s in a short time. These characteristics of QGA are suitable for arallel structure. Also, the migration in PQGA can imrove the caability of exloitation and exloration. The knasack roblem, a kind of combinatorial otimization roblem, is used to discuss the erformance of PQGA. It was shown that PQGA s convergence and global search ability are suerior to QGA s and CGA s. The exerimental results demonstrate the effectiveness and the alicability of PQGA.
7 Best rots Average rots Best of PQGA2 Best of PQGA1 Best of QGA2 Best of QGA1 Average of PQGA2 Average of PQGA1 Average of QGA2 Average of QGA Best of CGA Average of CGA (a) best rots (1 items) (b) average rots (1 items) Best rots Average rots Best of PQGA2 Best of PQGA Best of QGA2 146 Best of QGA1 Average of PQGA2 15 Average of PQGA1 Average of QGA2 145 Average of QGA Best of CGA Average of CGA (c) best rots (25 items) (d) average rots (25 items) Best rots Average rots 3 3 Best of PQGA2 Average of PQGA Best of PQGA1 29 Average of PQGA1 285 Best of QGA2 285 Average of QGA2 28 Best of QGA1 28 Average of QGA1 275 Best of CGA Average of CGA (e) best rots (5 items) (f) average rots (5 items) Figure 3: Comarison of PQGAs, QGAs and CGAs on the knasack roblem. The vertical axis is the rot value of knasack, and the horizontal axis is the number of generations. (a), (c), (e) show the best rots, and (b), (d), (f) show the average rots. Both were averaged over 3 runs
8 References [1] K.-H. Han and J.-H. Kim, Genetic Quantum Algorithm and its Alication to Combinatorial Otimization Problem, in Proceedings of the 2 Congress on Evolutionary Comutation, , July, 2. [2] E. C.-Paz, Designing scalable multi-oulation arallel genetic algorithms, in IlliGAL Reort No. 989, Illinois Genetic Algorithms Laboratory, [3] T. C. Belding, The distributed genetic algorithm revisited, in Proceedings of the Sixth International Conference on Genetic Algorithms, , Morgan Kaufmann, [4] V. S. Gordon and D. Whitley, Serial and arallel genetic algorithms as function otimizers, in Proceedings of the Fifth International Conference on Genetic Algorithms, , Morgan Kaufmann, [5] S. Baluja, Structure and erformance of ne-grain arallelism in genetic search, in Proceedings of the Fifth International Conference on Genetic Algorithms, , Morgan Kaufmann, [6] T. Hey, Quantum comuting: an introduction, Comuting & Control Engineering Journal, , Jun [7] A. Narayanan, Quantum comuting for ners, in Proceedings of the 1999 Congress on Evolutionary Comutation, , Jul [8] R. Hinterding, Reresentation, Constraint Satisfaction and the Knasack Problem, in Proceedings of the 1999 Congress on Evolutionary Comutation, , Jul [9] C.-H. Lee, S.-H. Park and J.-H. Kim, Toology and Migration Policy of Fine-grained Parallel Evolutionary Algorithms for Numerical Otimization, in Proceedings of the 2 Congress on Evolutionary Comutation,. 7-76, July, 2. [1] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Sringer-Verlag, 3rd, revised and exted edition, [11] J.-H. Kim and H. Myung, Evolutionary Programming Techniques for Constrained Otimization Problems, IEEE Transactions on Evolutionary Comutation, Vol. 1, No. 2, , Jul [12] X. Yao, Evolutionary Comutation: Theory and Alications, World Scientic, Singaore, 1999.
Genetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationIntroduction of Quantum-inspired Evolutionary Algorithm
FIRA Robot Congress Seoul, Korea Introduction of Quantum-inspired Evolutionary Algorithm Kuk-Hyun Han and Jong-Hwan Kim Department of Electrical Engineering and Computer 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 informationGenetic Algorithms, Selection Schemes, and the Varying Eects of Noise. IlliGAL Report No November Department of General Engineering
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
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 informationQuantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization
580 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 6, DECEMBER 2002 Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization Kuk-Hyun Han and Jong-Hwan Kim Abstract
More informationDETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS
Proceedings of DETC 03 ASME 003 Design Engineering Technical Conferences and Comuters and Information in Engineering Conference Chicago, Illinois USA, Setember -6, 003 DETC003/DAC-48760 AN EFFICIENT ALGORITHM
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 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 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 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 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 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 informationResearch Article Research on Evaluation Indicator System and Methods of Food Network Marketing Performance
Advance Journal of Food Science and Technology 7(0: 80-84 205 DOI:0.9026/afst.7.988 ISSN: 2042-4868; e-issn: 2042-4876 205 Maxwell Scientific Publication Cor. Submitted: October 7 204 Acceted: December
More informationSHAPE OPTOMIZATION OF H-BEAM FLANGE FOR MAXIMUM PLASTIC ENERGY DISSIPATION
The Fourth China-Jaan-Korea Joint Symosium on Otimization of Structural and Mechanical Systems Kunming, Nov. 6-9, 2006, China SHAPE OPTOMIZATION OF H-BEAM FLANGE FOR MAXIMUM PLASTIC ENERGY DISSIPATION
More informationDiscrete Particle Swarm Optimization for Optimal DG Placement in Distribution Networks
Discrete Particle Swarm Otimization for Otimal DG Placement in Distribution Networs Panaj Kumar, Student Member, IEEE, Nihil Guta, Member, IEEE, Anil Swarnar, Member, IEEE, K. R. Niazi, Senior Member,
More informationFuzzy Automata Induction using Construction Method
Journal of Mathematics and Statistics 2 (2): 395-4, 26 ISSN 1549-3644 26 Science Publications Fuzzy Automata Induction using Construction Method 1,2 Mo Zhi Wen and 2 Wan Min 1 Center of Intelligent Control
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 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 informationCSE 599d - Quantum Computing When Quantum Computers Fall Apart
CSE 599d - Quantum Comuting When Quantum Comuters Fall Aart Dave Bacon Deartment of Comuter Science & Engineering, University of Washington In this lecture we are going to begin discussing what haens to
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 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 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 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 informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationSIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING. Ruhul SARKER. Xin YAO
Yugoslav Journal of Oerations Research 13 (003), Number, 45-59 SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING Ruhul SARKER School of Comuter Science, The University of New South Wales, ADFA,
More informationComputer arithmetic. Intensive Computation. Annalisa Massini 2017/2018
Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3
More informationThe Recursive Fitting of Multivariate. Complex Subset ARX Models
lied Mathematical Sciences, Vol. 1, 2007, no. 23, 1129-1143 The Recursive Fitting of Multivariate Comlex Subset RX Models Jack Penm School of Finance and lied Statistics NU College of Business & conomics
More informationMatching Partition a Linked List and Its Optimization
Matching Partition a Linked List and Its Otimization Yijie Han Deartment of Comuter Science University of Kentucky Lexington, KY 40506 ABSTRACT We show the curve O( n log i + log (i) n + log i) for the
More informationA New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search
A New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search Eduard Babkin and Margarita Karunina 2, National Research University Higher School of Economics Det of nformation Systems and
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 informationTests for Two Proportions in a Stratified Design (Cochran/Mantel-Haenszel Test)
Chater 225 Tests for Two Proortions in a Stratified Design (Cochran/Mantel-Haenszel Test) Introduction In a stratified design, the subects are selected from two or more strata which are formed from imortant
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 informationON OPTIMIZATION OF THE MEASUREMENT MATRIX FOR COMPRESSIVE SENSING
8th Euroean Signal Processing Conference (EUSIPCO-2) Aalborg, Denmark, August 23-27, 2 ON OPTIMIZATION OF THE MEASUREMENT MATRIX FOR COMPRESSIVE SENSING Vahid Abolghasemi, Saideh Ferdowsi, Bahador Makkiabadi,2,
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 informationElliptic Curves and Cryptography
Ellitic Curves and Crytograhy Background in Ellitic Curves We'll now turn to the fascinating theory of ellitic curves. For simlicity, we'll restrict our discussion to ellitic curves over Z, where is a
More information2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.
-D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear
More informationA Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test Split
A Bound on the Error of Cross Validation Using the Aroximation and Estimation Rates, with Consequences for the Training-Test Slit Michael Kearns AT&T Bell Laboratories Murray Hill, NJ 7974 mkearns@research.att.com
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationTopology Optimization of Three Dimensional Structures under Self-weight and Inertial Forces
6 th World Congresses of Structural and Multidiscilinary Otimization Rio de Janeiro, 30 May - 03 June 2005, Brazil Toology Otimization of Three Dimensional Structures under Self-weight and Inertial Forces
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 informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
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 informationNew Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
New Schedulability Test Conditions for Non-reemtive Scheduling on Multirocessor Platforms Technical Reort May 2008 Nan Guan 1, Wang Yi 2, Zonghua Gu 3 and Ge Yu 1 1 Northeastern University, Shenyang, China
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 informationImplementation of a Column Generation Heuristic for Vehicle Scheduling in a Medium-Sized Bus Company
7e Conférence Internationale de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 Paris- France «Modélisation, Otimisation MOSIM 08 et Simulation du 31 mars des Systèmes au 2 avril : 2008
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 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 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 informationKEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS
4 th International Conference on Earthquake Geotechnical Engineering June 2-28, 27 KEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS Misko CUBRINOVSKI 1, Hayden BOWEN 1 ABSTRACT Two methods for analysis
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 informationResearch of PMU Optimal Placement in Power Systems
Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) Research of PMU Otimal Placement in Power Systems TIAN-TIAN CAI, QIAN AI
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 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 information1-way quantum finite automata: strengths, weaknesses and generalizations
1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum
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 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 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 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 informationCharacterization of Material Parameters
Proceedings of the World Congress on Engineering 29 Vol II WCE 29, July 1-3, 29, London, U.K. Characterization of Material Parameters S. M. Humayun Kabir, Tae-In Yeo, Sang-Ho Kim Abstract The resent work
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 informationEnergy-aware optimisation for run-time reconfiguration
Energy-aware otimisation for run-time reconfiguration Tobias Becker and Wayne Luk Deartment of Comuting Imerial College London, UK eter Y. K. Cheung Deartment of Electrical and Electronic Engineering Imerial
More informationMODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS
MODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS Dan-Cristian POPA, Vasile IANCU, Loránd SZABÓ, Deartment of Electrical Machines, Technical University of Cluj-Naoca RO-400020 Cluj-Naoca, Romania; e-mail:
More informationCryptanalysis of Pseudorandom Generators
CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we
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 informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationPRELIMINARY SELECTION OF BASIC PARAMETERS OF DIFFERENT TORSIONAL VIBRATION DAMPERS INTENDED FOR USE IN MEDIUM-SPEED DIESEL ENGINES
Ivan Filiović Dževad Bibić Aleksandar Milašinović Almir Blažević Adnan Pecar ISSN 333-4 PRELIMINARY SELECTION OF BASIC PARAMETERS OF DIFFERENT TORSIONAL VIBRATION DAMPERS INTENDED FOR USE IN MEDIUM-SPEED
More informationFinding Shortest Hamiltonian Path is in P. Abstract
Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs
More information1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th
18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider
More informationOptimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment
Neutrosohic Sets and Systems Vol 14 016 93 University of New Mexico Otimal Design of Truss Structures Using a Neutrosohic Number Otimization Model under an Indeterminate Environment Wenzhong Jiang & Jun
More informationRecursive Estimation of the Preisach Density function for a Smart Actuator
Recursive Estimation of the Preisach Density function for a Smart Actuator Ram V. Iyer Deartment of Mathematics and Statistics, Texas Tech University, Lubbock, TX 7949-142. ABSTRACT The Preisach oerator
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 informationA STUDY ON THE UTILIZATION OF COMPATIBILITY METRIC IN THE AHP: APPLYING TO SOFTWARE PROCESS ASSESSMENTS
ISAHP 2005, Honolulu, Hawaii, July 8-10, 2003 A SUDY ON HE UILIZAION OF COMPAIBILIY MERIC IN HE AHP: APPLYING O SOFWARE PROCESS ASSESSMENS Min-Suk Yoon Yosu National University San 96-1 Dundeok-dong Yeosu
More informationSTART Selected Topics in Assurance
START Selected Toics in Assurance Related Technologies Table of Contents Introduction Statistical Models for Simle Systems (U/Down) and Interretation Markov Models for Simle Systems (U/Down) and Interretation
More informationImproved Capacity Bounds for the Binary Energy Harvesting Channel
Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,
More informationFault Tolerant Quantum Computing Robert Rogers, Thomas Sylwester, Abe Pauls
CIS 410/510, Introduction to Quantum Information Theory Due: June 8th, 2016 Sring 2016, University of Oregon Date: June 7, 2016 Fault Tolerant Quantum Comuting Robert Rogers, Thomas Sylwester, Abe Pauls
More informationOn Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.**
On Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.** * echnology and Innovation Centre, Level 4, Deartment of Electronic and Electrical Engineering, University of Strathclyde,
More informationAnalysis of M/M/n/K Queue with Multiple Priorities
Analysis of M/M/n/K Queue with Multile Priorities Coyright, Sanjay K. Bose For a P-riority system, class P of highest riority Indeendent, Poisson arrival rocesses for each class with i as average arrival
More informationAlgorithms for Air Traffic Flow Management under Stochastic Environments
Algorithms for Air Traffic Flow Management under Stochastic Environments Arnab Nilim and Laurent El Ghaoui Abstract A major ortion of the delay in the Air Traffic Management Systems (ATMS) in US arises
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 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 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 informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More informationA numerical implementation of a predictor-corrector algorithm for sufcient linear complementarity problem
A numerical imlementation of a redictor-corrector algorithm for sufcient linear comlementarity roblem BENTERKI DJAMEL University Ferhat Abbas of Setif-1 Faculty of science Laboratory of fundamental and
More informationNeural network models for river flow forecasting
Neural network models for river flow forecasting Nguyen Tan Danh Huynh Ngoc Phien* and Ashim Das Guta Asian Institute of Technology PO Box 4 KlongLuang 220 Pathumthani Thailand Abstract In this study back
More informationCOMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS
NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender
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 informations v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4
Discrete Adative Transmission for Fading Channels Lang Lin Λ, Roy D. Yates, Predrag Sasojevic WINLAB, Rutgers University 7 Brett Rd., NJ- fllin, ryates, sasojevg@winlab.rutgers.edu Abstract In this work
More informationFrequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer
Frequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer C.P. an + F. Crusca # M. Aldeen * + School of Engineering, Monash University Malaysia, 2 Jalan Kolej, Bandar Sunway, 4650 Petaling,
More informationarxiv: v1 [quant-ph] 22 Apr 2017
Quaternionic Quantum Particles SERGIO GIARDINO Institute of Science and Technology, Federal University of São Paulo (Unifes) Avenida Cesare G. M. Lattes 101, 147-014 São José dos Camos, SP, Brazil arxiv:1704.06848v1
More informationPosition Control of Induction Motors by Exact Feedback Linearization *
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8 No Sofia 008 Position Control of Induction Motors by Exact Feedback Linearization * Kostadin Kostov Stanislav Enev Farhat
More informationMetrics Performance Evaluation: Application to Face Recognition
Metrics Performance Evaluation: Alication to Face Recognition Naser Zaeri, Abeer AlSadeq, and Abdallah Cherri Electrical Engineering Det., Kuwait University, P.O. Box 5969, Safat 6, Kuwait {zaery, abeer,
More informationModelling a Partly Filled Road Tanker during an Emergency Braking
Proceedings of the World Congress on Engineering and Comuter Science 217 Vol II, October 25-27, 217, San Francisco, USA Modelling a Partly Filled Road Tanker during an Emergency Braking Frank Otremba,
More informationConvolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.
Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional
More informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationEnd-to-End Delay Minimization in Thermally Constrained Distributed Systems
End-to-End Delay Minimization in Thermally Constrained Distributed Systems Pratyush Kumar, Lothar Thiele Comuter Engineering and Networks Laboratory (TIK) ETH Zürich, Switzerland {ratyush.kumar, lothar.thiele}@tik.ee.ethz.ch
More informationGIVEN an input sequence x 0,..., x n 1 and the
1 Running Max/Min Filters using 1 + o(1) Comarisons er Samle Hao Yuan, Member, IEEE, and Mikhail J. Atallah, Fellow, IEEE Abstract A running max (or min) filter asks for the maximum or (minimum) elements
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 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 informationPreconditioning techniques for Newton s method for the incompressible Navier Stokes equations
Preconditioning techniques for Newton s method for the incomressible Navier Stokes equations H. C. ELMAN 1, D. LOGHIN 2 and A. J. WATHEN 3 1 Deartment of Comuter Science, University of Maryland, College
More information