Genetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
|
|
- Nathaniel Collins
- 6 years ago
- Views:
Transcription
1 Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-1, Kusong-dong Yusong-gu Taejon, , Republic of Korea kh han (9 vivaldi. kais t.ac.kr Jong-Hwan Ki Dept. of Electrical Engineering, KAIST, 373-1, Kusong-dong Yusong-gu Taejon, , Republic of Korea vivaldi.kaist.ac.kr Abstract- This paper proposes a novel evolutionary coputing ethod called a genetic quantu algorith (GQA). GQA is based on the concept and principles of quantu coputing such as qubits and superposition of states. Instead of binary, nueric, or sybolic representation, by adopting qubit chroosoe as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantu gates are eployed for the search of the best solution. Rapid convergence and good global search capability characterize the perforance of GQA. The effectiveness and the applicability of GQA are deonstrated by experiental results on the knapsack proble, which is a well-known cobinatorial optiization proble. The results show that GQA is superior to other genetic algoriths using penalty functions, repair ethods, and decoders. 1 Introduction Many efforts on quantu coputers have progressed actively since the early 1990 s because these coputers were shown to be ore powerful than classical coputers on various specialized probles. But if there is no quantu algorith that solves practical probles, quantu coputer hardware ay be useless. It could be considered as a coputer without operating syste. Although there would be significant benefit fro new quantu algoriths that could solve coputational probles faster than classical algoriths, to date, only a few quantu algoriths are known. Nevertheless, quantu coputing is attracting serious attention, since its superiority was deonstrated by a few quantu algoriths such as Shor s quantu factoring algorith [l, 21 and Grover s database search algorith [3, 41. Shor s algorith finds the prie factors of an n-digit nuber in polynoial-tie, while the best-known ( 1 classical factoring algoriths require tie o 2n log(n). Grover s database search algorith can find an ite in an unsorted list of n ites in 0 (6) steps, while classical algoriths require O(n). Research on erging evolutionary coputing and quantu coputing has been started by soe researchers since late 1990 s. They can be classified into two fields. One con- centrates on generating new quantu algoriths using autoatic prograing techniques such as genetic prograing [SI. The absence of new quantu algoriths otivated this work. The other concentrates on quantu-inspired evolutionary coputing for a classical coputer [6], a branch of study on evolutionary coputing that is characterized by certain principles of quantu echanics such as standing waves, interference, coherence, etc. This paper offers a novel evolutionary coputing algorith called a genetic quantu algorith (GQA). GQA is characterized by principles of quantu coputing including concepts of qubits and superposition of states. GQA uses a qubit representation instead of binary, nueric, or sybolic representations. GQA can iitate parallel coputation in classical coputers. This paper is organized as follows. Section 2 describes a novel evolutionary coputing algorith, GQA. Section 3 contains a description of the experient with GAS and GQAs for knapsack probles for coparison purpose. Section 4 suarizes and analyzes the experiental results. Concluding rearks follow in Section 5. 2 Genetic Quantu Algorith (GQA) GQA is based on the concepts of qubits and superposition of states of quantu echanics. The sallest unit of inforation stored in a two-state quantu coputer is called a quantu bit or qubit [7]. A qubit ay be in the 1 state, in the 0 state, or in any superposition of the two. The state of a qubit can be represented as where a and,8 are coplex nubers that specify the probability aplitudes of the corresponding states. Ia12 gives the probability that the qubit will be found in 0 state and ]PI2 gives the probability that the qubit will be found in the 1 state. Noralization of the state to unity guarantees If there is a syste of -qubits, the syste can represent 2 states at the sae tie. However, in the act of observing a quantu state, it collapses to a single state [8] /00/$ IEEE. 1354
2 2.1 Representation It is possible to use a nuber of different representations to encode the solutions onto chroosoes in evolutionary coputation. The classical representations can be broadly classified as: binary, nueric, and sybolic [9]. GQA uses a novel representation that is based on the concept of qubits. One qubit is defined with a pair of coplex nubers, (a,@), as store the best solution aong P(t) while (not terination-condition) do ttt+l ake P( t) by observing Q (t- 1) states evaluate P(t) update Q(t) using quantu gates U(t) store the best solution aong P(t) which is chzacterized by (1) and (2). And an -qubits representation is defined as [ ; I ;: I ::: I ; ] where laii2 + lflii2 = 1, i = 1,2,...,. This representation has the advantage that it is able to represent any superposition of states. If there is, for instance, a three-qubits syste with three pairs of aplitudes such as [ g I ;:I $ 1 (3) GQA is a probabilistic algorith which is SiikU to a genetic algorith. GQA aintains a population of qubit chroosoes, Q(t) = {qt, q:,., qk} at generation t, where n is the size of population, and q$ is a qubit chroosoe defined as (6) where is the nuber of qubits, i.e., the string length of the qubit chroosoe, and j = 1,2,...,. n. of all q$, j = 1,2,...,n, in Q(t) are initialized with -&. It eans that one qubit chroosoe, q$ it=^ represents the linear superposition of all possible statevwith the sae probabilitv: 1 In the step of initialize Q(t), ai and pit, i = 1,2, - -,, the state of the syste can be represented as (4) o The above result eans that the probabilities to represent the state (OOO), IOOl), IlOO), and 1101) are i, $, i, and i, respectively. By consequence, the three-qubits syste of (4) has four states inforation at the sae tie. Evolutionary coputing with the qubit representation has a better characteristic of diversity than classical approaches, since it can represent superposition of states. Only one qubit chroosoe such as (4) is enough to represent four states, but in classical representation at least four chroosoes, (000), (OOl), (loo), and (101) are needed. Convergence can be also obtained with the qubit representation. As /ail2 or I&I2 approaches to 1 or 0, the qubit chroosoe converges to a single state and the property of diversity disappears gradually. That is, the qubit representation is able to possess the two characteristics of exploration and exploitation, siultaneously. 2.2 GQA The structure of GQA is described in the following. procedure GQA t t o initialize Q(t) ake P(t) by observing &(t) states evaluate P( t) where Sk is the k-th state represented by the binary string (qzz..-z), where zi, i = 1,2, -. e,, is either 0 or 1. The next step akes a set of binary solutions, P(t), by observing Q(t) states, where P(t) = {xi, xi, - - -, xk} at gen- eration t. One binary solution, xi, j = 1,2,...,n, is a binary string of the length, and is fored by selecting each bit using the probability of qubit, either ]ail2 or I@12, i = 1,2,.,, of qi. Each solution xi is evaluated to give soe easure of its fitness. The initial best solution is then selected and stored aong the binary solutions, P(t). In the while loop, one ore step, update Q(t), is in- cluded to have fitter states of the qubit chroosoes. A set of binary solutions, P(t), is fored by observing Q(t - 1) states as with the procedure described before, and each binary solution is evaluated to give the fitness value. In the next step, update Q(t). a set of qubit chroosoes Q(t) is updated by applying soe appropriate quantu gates U(t), which is fored by using the binary solutions P(t) and the stored best solution. The appropriate quantu gates can be designed in copliance with practical probles. Rotation gates, for instance, will be used for knapsack probles in the next sec- lquantuni gates are reversible gates and can be represented as unitary operators acting on the qubit basis states: UtU = UUt, where Ut is the heritian adjoint of U. There are several quantu gates, such as NOT gate, Controlled NOT gate, Rotation gate, Hadaard gate, etc.[7]. 1355
3 tion, such a$ U(8) = cos(8) sin(8) - sin(8) cos(8) 1 ' where 8 is a rotation angle. This step akes the qubit chroosoes converge to the fitter states. The best solution aong P(t) is selected in the next step, and if the solution is fitter than the stored best solution, the stored solution is changed by the new one. The binary solutions P(t) are discarded at the of the loop. It should be noted that soe genetic operators can be applied, such as utation which creates new individuals by a sall change in a single individual, and crossover which creates new individuals by cobining parts fro two or ore individuals. Mutation and crossover can ake the probability of linear superposition of states change. But as GQA has diversity caused by the qubit representation, there is no need to use the genetic operators. If the probabilities of utation and crossover are high, the perforance of GQA can be decreased notably. In GQA, the population size, i.e., the nuber of qubit chroosoes is kept the sae all the tie. This is caused by conservation of qubits based on quantu coputing. GQA with the qubit representation can have better convergence with diversity than conventional GAS which have fixed 0 and 1 inforation. 3 Experient The knapsack proble, a kind of cobinatorial optiization proble, is used to investigate the perforance of GQA. The knapsack proble can be described as selecting fro aong various ites those ites which are ost profitable, given that the knapsack has liited capacity. The 0-1 knapsack proble is described a$: given a set of ites and a knapsack, select a subset of the ites so as to axiize the profit f (4: subject to = C pixi, i= 1 i= 1 where x = ( XI. x), zi is 0 or 1, pi is the profit of ite i, zvi is the weight of ite i, and C is the capacity of the knapsack. In this section, soe conventional GA ethods are described to experient with the 0-1 knapsack proble, and the detailed algorith of GQA for the knapsack proble follows. 3.1 Conventional GA ethods Three types of conventional algoriths are described and tested: algoriths based on penalty functions, algoriths (7) based on repair ethods, and algoriths based on decoders [lo]. In all algoriths based on penalty functions, a binary string of the length represents a chroosoe x to the proble. The profit f(x) of each string is deterined as f(x) = C pixi - ~ en(x), i=l where Pen(x) is a penalty function. There are any possible strategies for assigning the penalty function [l 1, 121. Three types of penalties are considered, such as logarithic penalty, linear penalty, and quadratic penalty: Penl(x) = log, (1 + p (Ccl wixi - C)), Penz(x) = p(ccl wizi - C), 2 Px) = (p(ell wixi - C)), where p is axi=l...{ pi/wi}- In algoriths based on repair ethods, the profit f (x) of each string is deterined as where x' is a repaired vector of the original vector x. Original chroosoes are replaced with a 5% probability in the experient. The two repair algoriths considered here differ only in selection procedure, which chooses an ite for reoval fro the knapsack: Rep1 (rando repair): The selection procedure selects a randotn eleent fro the knapsack. RepfL (greedy repair): All ites in the knapsack are sorted in the decreasing order of their profit to weight ratios. The selection procedure always chooses the last ite for deletion. A possible decoder for the knapsack proble is based on an integer representation. Each chroosoe is a vector of integers; the i-th coponent of the vector is an integer in the range fro 1 to - i + 1. The ordinal representation references a list L of ites; a vector is decoded by selecting appropriate ite fro the current list. The two algoriths based on decoders considered here differ only in the procedure of building a list L of ites: Decl (rando decoding): The build procedure creates a list L of ites such that the order of ites on the list corresponds to the order of ite in the input file which is rando. Decz (greedy decoding): The build procedure creates a list L of ites in the decreasing order of their profit to weight ratios. 3.2 GQA for the knapsack proble The algorith of GQA for the knapsack proble is based on the StruChiTe of GQA proposed and it contains a repair 1356
4 algorith. The algorith can be written as follows: procedure GQA t t o initialize Q(t) ake P(t) by observing Q(t) states repair P(t) evaluate P(t) store the best solution b aong P(t) while (t < MAX-GEN) do ttt+l ake P(t) by observing Q(t - 1) states repair P(t) evaluate P(t) update Q(t) store the best solution b aong P(t) A qubit string of the length represents a linear superposition of solutions to the proble as in (6). The length of a qubit string is the sae as the nuber of ites. The i-th ite can be selected for the knapsack with probability I/3ilz or (1 - lail'). Thus, a binary string of the length is fored fro the qubit string. For every bit in the binary string, we generate a rando nuber T fro the range [0..1]; if r > laii2, we set the bit of the binary string. The binary string xf, j = 1,2,, n, of P(t) represents a j-th solution to the proble. For notational siplicity, x is used instead of xf in the following. The i-th ite is selected for the knapsack iff xi = 1, where xi is the i-th bit of x. The binary string x is deterined as follows: procedure ake (x) i t 0 while (i < ) do iti+l if randolo, 1) > Iai12 thenzi t 1 else xi t 0 The repair algorith of GQA for the knapsack proble is ipleented as follows: procedure repair (x) knapsack-overfilled t false ifce1 wixi > C then knapsack-overfilled t true while (knapsack-overfilled) do., O false I true false true 0.05~ 1 0 false 0.01T 1 0 true 0.025~ 1 1 false 0.005~ 1 1 true 0.025~ I : +1 fl 0 +1 fl fl -1 0 fl -1 0 fl $ Table 1: Lookup table of Oi, where f (,) is the profit, s(ai@i) is the sign of Bi, and bi and xi are the i-th bits of the best solution b and the binary solution x, respectively. select an i-th ite fro the knapsack xi t 0 ifcl1 wixi <_ c then knapsack-overfilled c false while (not knapsack-overfilled) do select a j-th ite fro the knapsack xj t 1 if CL1 wixi > C then knapsack-overfilled t Vue xj t 0 The profit of a binary solution x is evaluated by pixi, and it is used to find the best solution b after the update of qi, j = 1,2,..., n. A qubit chroosoe sj is updated by using the rotation gate U(0) of (7) in this algorith. The i-th qubit value (ai, Pi) is updated as In this knapsack proble 0, is given as s(aipi)a&. The paraeters used are shown in Table 1. For exaple, if the condition, f (x) 2 f (b), is satisfied and xi and bi are 1 and 0, respectively, we can set the value of At$ as 0.025~ and s(aipi) as +1, -1, or 0 according to the condition of a& so as to increase the probability of the state 11). The value of AOi has an effect on the speed of convergence, but if it is too big, the solutions ay diverge or have a preature convergence to a local optiu. The sign s(aipi) deterines the direction of convergence to a global optiu. The lookup table can be used as a strategy for convergence. This update procedure can be described as follows: procedure update (9) i t
5 ll of ites CGAs GQAs Pen1 Pen2 Pen3 Repl Rep2 Decl Dec2 P2+R1 GQA(1) GQA(10) b profits w t(sec/run) b profits W t(sec/run) b profits W t(sec/run) while (i < ) do iti+l deterine Bi with the lookup table obtain (ai, Pf) as: [ai = qe,) [ai q+ q' The update procedure can be ipleented in various ethods with appropriate quantu gates. It deps on a given proble. 4 Results In all experients strongly correlated sets of data were considered: wi = uniforly rando[l, 10) pi = Wi + 5, the average knapsack capacity was used: i=l and the data files were unsorted. The population size of the eight conventional genetic algoriths (CGAs) was equal to 100. Probabilities of crossover and utation were fixed: 0.65 and 0.05, respectively, as in [lo]. The population size of GQA( 1) was equal to 1, and the population size of GQA( 10) was equal to 10, this being the only difference between GQA( 1) and GQA( 10). As a perforance easure of the algorith we collected the best solution found within 500 generations over 25 runs, and we checked the elapsed tie per one run. A Pentiu-III 500MHz was used, running Visual C Table 2 shows the experiental results of the knapsack probles with 100, 250, and 500 ites. In the case of 100 ites, GQA yielded superior results as copared to all the other CGAs. The CGA designed by using a linear penalty function and rando repair algorith outperfored all other CGAs, but is behind GQA( 1) as well as GQA( 10) in perforance. The results show that GQA perfors well in spite of sall size of population. Judging fro the results, GQA can search solutions near the optiu within a short tie as copared to CGAs. In the cases of 250 and 500 ites, the CGA that outperfors all the other CGAs was tested for coparison purpose with GQA. The experiental results again deonstrate the superiority of GQA. Figure 1 shows the progress of the ean of best profits and the ean of average profits of population found by GQA( l), GQA( lo), and CGA over 25 runs for 100,250, and 500 ites. GQA perfors better than CGA in ters of convergence rate and final results. In the ning of the plotting of the best profits, GQA( 1) shows a slower convergence rate than GQA( 10) and CGA due to its sall population nuber. After 50 generations, GQA( 10) and GQA( 1) aintain a nearly constant convergence rate, while CGA's convergence rate reduces substantially. After 200 generations, even though convergence rate of GQA reduces, GQAs show a faster convergence rate than CGA due to its better global search ability. GQAs' final results are larger than CGA's in 1000 generations. The tency of convergence rate can be shown clearly in the results of the ean of average profits of population. In the ning, convergence rates of all the algoriths increase. But CGA aintains a nearly constant profit due to its preature convergence iediately, while GQA approaches towards the neighborhood of global optia with a constant 1358
6 convergence rate. GQAs display no preature convergence which is a coon proble of CGAs until 1000 generations. The experiental results deonstrate the effectiveness and the applicability of GQA. Especially, Figure 1 shows the excellent global search ability and the superiority of convergence ability of GQA. 5 Conclusions This paper proposed a novel evolutionary coputing algorith, GQA with a quantu representation. GQA is based on the principles of quantu coputing such as concepts of qubits and superposition of states. GQA can represent a linear superposition of states, and there is no need to include any individuals. GQA has an excellent ability of global search due to its diversity caused by the probabilistic representation, and it can approach better solutions than CGA s in a short tie. The knapsack proble, a kind of cobinatorial optiization problcs, is used to discuss the perforance of GQA. It was showed that GQA s convergence and global search ability are superior to CGA s. The experiental results deonstrate the effectiveness and the applicability of GQA. [81 A. Narayanan, Quantu coputing for ners, in Proceedings of the 1999 Congress on Evolutionary Coputation, pp , Jul [9] R. Hinterding, Representation, Constraint Satisfaction and the Knapsack Proble, in Proceedings of the 1999 Congress on Evolutionary Coputation, pp , Jul [ Michalewicz, Genetic Algoriths i Data Structures = Evolution Progras, Springer-Verlag, 3rd, revised and exted edition, [l 11 J.-H. Ki and H. Myung, Evolutionary Prograing Techniques for Constrained Optiization Probles, IEEE Transactions on Evolutionary Coputation, Vol. 1, NO. 2, pp , Jul [ 121 X. Yao, Evolutionary Coputation: Theory and Applications, World Scientific, Singapore, References P. W. Shor, Quantu Coputing, Docuenta Matheatica, vol. Extra Volue ICM, pp , 1998, EMIS/ journals/ DMJDMV/ xvol-ic/ 001 Shor.MAN.ht1. P. W. Shor, Algoriths for Quanhi Coputation: Discrete Logariths and Factoring, in Proceedings of the 35th Annual Syrnposiunz on Foundations of Coputer Science, pp , L. K. Grover, A fast quantu echanical algorith for database search, in Proceedings of the 28th ACM Syposiu on Theory of Coputing, pp , L. K. Grover, Quantu Mechanical Searching, in Proceedings ofthe 1999 Congress on Evolutionary Coputation, pp Jul L. Spector, H. Bau, H. J. Bestein and N. Sway, Finding a Better-than-Classical Quanhi AND/OR Algorithtn using Genetic Prograing, in Proceedings of the 1999 Congress on Evolutionary Coputation, pp , Jul A. Narayanan and M. Moore, Quantu-inspired genetic algoriths, in Proceedings of IEEE International Conference on Evolutionary Coputation, pp , T. Hey, Quantu coputing: an introduction, Coputing & Control Engineering Journal, pp , Jun
7 Avoran w - ",,,,,,,,, 5301 " " " " " WO 700 BOO (a) best profits (100 ites) -; lb0 2;o 3bo 4b0 40 eo0,bo M O 9L lcoo (b) average profits (100 ites) l =7 I ' " " ' ' 0 IO WO I000 (c) best profits (250 ites) (d) average profits (250 ites) 2650 AWageolCW ~ oD W O I (e) best profits (500 ites) (f) average profits (500 ites) Figure 1: Coparison between CGA and GQA on the knapsack proble. The vertical axis is the profit value of knapsack, and the horizontal axis is the nuber of generations. (a), (c), (e) show the best profits, and (b), (d), (f) show the average profits. Both were averaged over 25 runs. 1360
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 informationOn the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual
6 IEEE Congress on Evolutionary Coputation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-1, 6 On the Analysis of the Quantu-inspired Evolutionary Algorith with a Single Individual
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 informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationarxiv: v1 [cs.ds] 29 Jan 2012
A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationAn Adaptive Quantum-based Evolutionary Algorithm for Multiobjective Optimization
An Adaptive Quantu-based Evolutionary Algorith for Multiobjective Optiization JERZY BALICKI Naval University of Gdynia ul. Sidowicza 69, 81-103 Gdynia, POLAND J.Balicki@aw.gdynia.pl Abstract: - An Adaptive
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationMSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE
Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationLow complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
Inforation Processing Letters 107 008 11 15 www.elsevier.co/locate/ipl Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationAn improved self-adaptive harmony search algorithm for joint replenishment problems
An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationCompression and Predictive Distributions for Large Alphabet i.i.d and Markov models
2014 IEEE International Syposiu on Inforation Theory Copression and Predictive Distributions for Large Alphabet i.i.d and Markov odels Xiao Yang Departent of Statistics Yale University New Haven, CT, 06511
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationA New Algorithm for Reactive Electric Power Measurement
A. Abiyev, GAU J. Soc. & Appl. Sci., 2(4), 7-25, 27 A ew Algorith for Reactive Electric Power Measureent Adalet Abiyev Girne Aerican University, Departernt of Electrical Electronics Engineering, Mersin,
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationOn Rough Interval Three Level Large Scale Quadratic Integer Programming Problem
J. Stat. Appl. Pro. 6, No. 2, 305-318 2017) 305 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.18576/jsap/060206 On Rough Interval Three evel arge Scale
More informationEnsemble Based on Data Envelopment Analysis
Enseble Based on Data Envelopent Analysis So Young Sohn & Hong Choi Departent of Coputer Science & Industrial Systes Engineering, Yonsei University, Seoul, Korea Tel) 82-2-223-404, Fax) 82-2- 364-7807
More informationINTEGRATIVE COOPERATIVE APPROACH FOR SOLVING PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT FAMILY SETUP TIMES
8 th International Conference of Modeling and Siulation - MOSIM 10 - May 10-12, 2010 - Haaet - Tunisia Evaluation and optiization of innovative production systes of goods and services INTEGRATIVE COOPERATIVE
More informationSPECTRUM sensing is a core concept of cognitive radio
World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile
More informationOn Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40
On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering
More informationGenetic Algorithm Search for Stent Design Improvements
Genetic Algorith Search for Stent Design Iproveents K. Tesch, M.A. Atherton & M.W. Collins, South Bank University, London, UK Abstract This paper presents an optiisation process for finding iproved stent
More informationElliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth s Algorithm
Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Sangook Moon, Non-eber ABSTRACT The ain back-bone
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationThe Algorithms Optimization of Artificial Neural Network Based on Particle Swarm
Send Orders for Reprints to reprints@benthascience.ae The Open Cybernetics & Systeics Journal, 04, 8, 59-54 59 Open Access The Algoriths Optiization of Artificial Neural Network Based on Particle Swar
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationPAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessment and Evolution Programming Techniques
1900 PAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessent and Evolution Prograing Techniques Chen-Sung CHANG a), Meber SUMMARY This paper applies the Evolutionary Prograing (EP)
More informationAdapting the Pheromone Evaporation Rate in Dynamic Routing Problems
Adapting the Pheroone Evaporation Rate in Dynaic Routing Probles Michalis Mavrovouniotis and Shengxiang Yang School of Coputer Science and Inforatics, De Montfort University The Gateway, Leicester LE1
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationREDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION
ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas
More informationarxiv: v1 [math.na] 10 Oct 2016
GREEDY GAUSS-NEWTON ALGORITHM FOR FINDING SPARSE SOLUTIONS TO NONLINEAR UNDERDETERMINED SYSTEMS OF EQUATIONS MÅRTEN GULLIKSSON AND ANNA OLEYNIK arxiv:6.395v [ath.na] Oct 26 Abstract. We consider the proble
More informationNonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy
Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo
More informationSupport Vector Machines MIT Course Notes Cynthia Rudin
Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationSelective-Candidate Framework with Similarity Selection Rule for Evolutionary Optimization
> arxiv preprint, arxiv:1712.06338 Source code available at https://shengxinzhang.github.io/ Selective-Candidate Fraework with Siilarity Selection Rule for Evolutionary Optiization Sheng Xin Zhang, Wing
More informationUse of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization
Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically
More informationOptimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks
1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationarxiv: v3 [cs.ds] 22 Mar 2016
A Shifting Bloo Filter Fraewor for Set Queries arxiv:1510.03019v3 [cs.ds] Mar 01 ABSTRACT Tong Yang Peing University, China yangtongeail@gail.co Yuanun Zhong Nanjing University, China un@sail.nju.edu.cn
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More information3D acoustic wave modeling with a time-space domain dispersion-relation-based Finite-difference scheme
P-8 3D acoustic wave odeling with a tie-space doain dispersion-relation-based Finite-difference schee Yang Liu * and rinal K. Sen State Key Laboratory of Petroleu Resource and Prospecting (China University
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationA New Approach to Solving Dynamic Traveling Salesman Problems
A New Approach to Solving Dynaic Traveling Salesan Probles Changhe Li 1 Ming Yang 1 Lishan Kang 1 1 China University of Geosciences(Wuhan) School of Coputer 4374 Wuhan,P.R.China lchwfx@yahoo.co,yanging72@gail.co,ang_whu@yahoo.co
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationTight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions
Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805
More informationA method to determine relative stroke detection efficiencies from multiplicity distributions
A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,
More informationOn the theoretical analysis of cross validation in compressive sensing
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.erl.co On the theoretical analysis of cross validation in copressive sensing Zhang, J.; Chen, L.; Boufounos, P.T.; Gu, Y. TR2014-025 May 2014 Abstract
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationCombining Classifiers
Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/
More informationOn Fuzzy Three Level Large Scale Linear Programming Problem
J. Stat. Appl. Pro. 3, No. 3, 307-315 (2014) 307 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.12785/jsap/030302 On Fuzzy Three Level Large Scale Linear
More informationarxiv: v3 [quant-ph] 18 Oct 2017
Self-guaranteed easureent-based quantu coputation Masahito Hayashi 1,, and Michal Hajdušek, 1 Graduate School of Matheatics, Nagoya University, Furocho, Chikusa-ku, Nagoya 464-860, Japan Centre for Quantu
More informationBayesian Approach for Fatigue Life Prediction from Field Inspection
Bayesian Approach for Fatigue Life Prediction fro Field Inspection Dawn An and Jooho Choi School of Aerospace & Mechanical Engineering, Korea Aerospace University, Goyang, Seoul, Korea Srira Pattabhiraan
More informationMeasuring orbital angular momentum superpositions of light by mode transformation
CHAPTER 7 Measuring orbital angular oentu superpositions of light by ode transforation In chapter 6 we reported on a ethod for easuring orbital angular oentu (OAM) states of light based on the transforation
More informationAn Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles
An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,
More informationThe source of THz radiation based on dielectric waveguide excited by sequence of electron bunches
Journal of Physics: Conference Series PAPER OPEN ACCESS The source of THz radiation based on dielectric waveguide excited by sequence of electron bunches To cite this article: A M Altark and A D Kanareykin
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationGenetic Algorithms using Low-Discrepancy Sequences
Genetic Algoriths using Low-Discrepancy Sequences ABSTRACT Shuhei Kiura Departent of Inforation and Knowledge Engineering, Faculty of Engineering, Tottori University 4-, Koyaa Minai, Tottori, JAPAN kiura@iketottori-uacjp
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationComparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations
International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationUCSD Spring School lecture notes: Continuous-time quantum computing
UCSD Spring School lecture notes: Continuous-tie quantu coputing David Gosset 1 Efficient siulation of quantu dynaics Quantu echanics is described atheatically using linear algebra, so at soe level is
More informationFault Tree Modeling for Redundant Multi-Functional Digital Systems
International Journal of Perforability Engineering, Vol. 3, No. 3, July, 2007, pp. 329-336 RAMS Consultants Printed in India Fault Tree Modeling for Redundant Multi-Functional Digital Systes HYUN GOOK
More informationDefect-Aware SOC Test Scheduling
Defect-Aware SOC Test Scheduling Erik Larsson +, Julien Pouget*, and Zebo Peng + Ebedded Systes Laboratory + LIRMM* Departent of Coputer Science Montpellier 2 University Linköpings universitet CNRS Sweden
More informationShort Papers. Test Data Compression and Decompression Based on Internal Scan Chains and Golomb Coding
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 1, NO. 6, JUNE 00 715 Short Papers Test Data Copression and Decopression Based on Internal Scan Chains and Golob Coding
More information