A Variable Neighbourhood Descent Algorithm for the Redundancy Allocation Problem
|
|
- Lester Rodney Reeves
- 6 years ago
- Views:
Transcription
1 EMS Vol. 4, No., pp. 94-0, June A Varable Neghbourhood Descent Algorthm for the Redundancy Allocaton Problem Yun-Cha Lang Cha-Chuan u Department of ndustral Engneerng and Management, Yuan Ze Unversty No 35 Yuan-Tung Road, Chung-L, Taoyuan County, Tawan 320, R.O.C. Tel: ext. 252, E-mal: yclang@saturn.yzu.edu.tw Abstract. Ths paper presents the frst known applcaton of a meta-heurstc algorthm, varable neghbourhood descent (VND), to the redundancy allocaton problem (RAP). The RAP, a well-known NP-hard problem, has been the subject of much pror work, generally n a restrcted form where each subsystem must consst of dentcal components. The newer meta-heurstc methods overcome ths lmtaton and offer a practcal way to solve large nstances of the relaxed RAP where dfferent components can be used n parallel. The varable neghbourhood descent method has not yet been used n relablty desgn, yet t s a method that fts perfectly n those combnatoral problems wth potental neghbourhood structures, as n the case of the RAP. A varable neghbourhood descent algorthm for the RAP s developed and tested on a set of well-known benchmark problems from the lterature. Results on 33 test problems rangng from less to severely constraned condtons show that the varable neghbourhood descent method provdes comparable soluton qualty at a very moderate computatonal cost n comparson wth the best-known heurstcs. Results also ndcate that the VND method performs wth lttle varablty over random number seeds. Keywords: varable neghbourhood descent, redundancy allocaton problem, seres-parallel system, combnatoral optmsaton. NTRODUCTON The most studed confguraton of the redundancy allocaton problem (RAP) s a seres system of s ndependent k-out-of-n: G subsystems. Because of the need for relablty and ncreased securty requrements, a seres-parallel system has been wdely used. The RAP s NP-hard (Chern 992) and has been studed n many forms as summarzed n Tllman et al., (977a), and by Kuo and Prasad (2000). As shown n Fgure, a k-out-of-n: G subsystem s functonng properly f at least k of ts n components are operatonal. n the formulaton of a seres-parallel system problem, for each subsystem, multple component choces are used n parallel, and each subsystem may have dfferent component selectons. Thus, the RAP can be formulated to select the optmal combnaton of components and redundancy levels to meet system level constrants, cost of C and weght of whle maxmzng system relablty. t s assumed that system weght and system cost are represented by lnear combnatons of component weght and cost. Max Subject to s R =ΠR ( y k ) () = s C( y ) C, (2) = s ( y ), (3) = n addton, f the maxmum number of components allowed n parallel s pre-determned, the followng constrant s added: k a j j= y 2 n n max = = 2 =, 2,..., s. 2 n 2 = s Fgure. Seres-parallel system confguraton 2 n s (4) : Correspondng Author
2 A Varable Neghbourhood Descent Algorthm for the Redundancy Allocaton Problem 95. Notatons and Assumptons k mnmum number of components requred to functon as a pure parallel system n total number of components used n a pure parallel system k-out-of-n: G a system that functons when at least k of ts n components functon R overall relablty of the seres-parallel system C system cost constrant system weght constrant S number of subsystems ndex for subsystem, =,, s j ndex for components n a subsystem a number of avalable component choces for subsystem r j relablty of component j avalable for subsystem c j cost of component j avalable for subsystem w j weght of component j avalable for subsystem y j quantty of component j used n subsystem ( y,..., y ) y a n = j= j a y, total number of components used n subsystem n max maxmum number of components that can be n parallel (user assgned) k mnmum number of components n parallel requred for subsystem to functon R( y k ) relablty of subsystem, gven k C( y ) total cost of subsystem ( y ) total weght of subsystem R u un-penalzed system relablty of soluton u R up penalzed system relablty of soluton u C u total system cost of soluton u u total system weght of soluton u γ C amplfcaton parameter of cost constrant n the penalty functon γ amplfcaton parameter of weght constrant n the penalty functon l max number of neghbourhood structures l ndex for neghbourhood structures N l the l th neghbourhood structure n the search sequence y current soluton y the best neghbourng soluton of y n a neghbourhood structure e constant that controls the lower bound of number of components used n parallel f constant that controls the upper bound of number of components used n parallel Typcal assumptons are consdered as follows: The state of the components and the system ether functon or fal. Faled components do not damage the system, and are not repared. The falure of a component does not lead to other components falng. Components are actve redundant,.e., the falure rates of components when not n use are the same as when n use. Component relablty, weght and cost are known and determnstc. The supply of components s unlmted..2 Lterature Revew Exact methods of the RAP nclude dynamc programmmng (Bellman and Dreyfus 958, Fyffe et al. 968, Nakagawa and Myazak 98, L 996), nteger programmng (Ghare and Taylor 969, Bulfn and Lu 985, Msra and Sharma 99, Cot and Lu 2000), and mxed-nteger and nonlnear programmng (Tllman et al. 977b). Snce exact methods n practce are lmted to the ncrease n problem sze, meta-heurstcs have become a popular alternatve to exact methods. Meta-heurstc approaches to the RAP vary among Genetc Algorthm (GA) (Cot and Smth 996a&b, Levtn et al. 998), Tabu Search (TS) (Huang et al. 2002, Kulturel-Konak et al. 2003), Ant Colony Optmzaton (ACO) (Lang and Smth 999, Huang et al. 2002, Lang 200, Lang and Smth 2004), hybrd Neural Network (NN) and GA (Cot and Smth 996c), and hybrd ACO wth TS (Huang 2003). n partcular, Levtn et al. (998) generalze a redundancy allocaton problem to mult-state systems, where the system and ts components have a range of performance levels-from perfectly functonng to complete falure. Levtn s paper mplements a unversal moment genera-tng functon to estmate system performance (capacty or operaton tme), and a GA s employed as the optmzaton technque. Furthermore, consderng the problem type for maxmzng system relablty, past studes such as TS proposed by Kulturel-Konak et al. (2003), GA de-veloped by Cot and Smth (996a), and ACO by Lang and Smth (200, 2004) have provded comparable results over a set of 4-subsystem benchmark problems. Huang et al. (2002, 2003) proposed ACO, TS, and hybrd ACO/TS algorthms respectvely to solve the system cost mnmzaton RAP. Our study consders one of the latest meta-heurstcs, Varable Neghbourhood Descent (VND), to solve the system relablty maxmzaton RAP. A varaton of the varable neghbourhood search (VNS) method was ntroduced frst by Mladenovć (995). The VND method explores search space based on the systematc change of
3 96 Yun-Cha Lang Cha-Chuan u neghbourhoods wthn the process and has been successfully appled to dverse combnatoral optmsaton problems, e.g. mult-source problem (Brmberg et al. 2000), sngle machne schedulng (Besten and Stützle 200), arc routng problem (Hertz and Mttaz 200), clusterng (Hansen and Mladenovć 2002), mnmum spannng tree problem (Rbero and Souza 2002), and phylogeny problem (Rbero and Vanna 2005). Because of the proper neghbourhood structure of the RAP and lack of domnant soluton technques, t s a good canddate for other metaheurstc approaches ncludng the focus of ths paper, VND. Ths paper s organzed as follows. Secton 2 ntroduces the varable neghbourhood descent algorthm for RAP, and secton 3 provdes our dscusson on computatonal results. Fnally, secton 4 contans concludng remarks and suggestons for future research. 2. VARABLE NEGHBOURHOOD DESCENT ALGORTHM Hansen and Mladenovć (2003) provde a detaled summary of the state-of-the-art development of VNS and ts varatons. They descrbe VNS-type algorthms as meta-heurstcs, and employ a set of neghbourhood search methods to fnd the local optmum n each neghbourhood teratvely and hopefully to reach the global optmum at the end. f the change of neghbour-hoods s performed n a determnstc way, such a method s called VND. The VND algorthm for RAP (denoted as VND_RAP) s dscussed below. At the ntalzaton step, a set of neghbourhood structures ( N ; l =,..., l ) and the sequence of ther l max mplementaton are determned. Then a feasble ntal soluton s generated and set as the current soluton (y). n the man search loop, startng from the frst neghbourhood,.e., N, a complete neghbourhood search s performed. f the best neghbourng soluton (y') n ths neghbourhood s better than the current soluton (y), y s replaced by y' and l s reset to,.e., start from the frst neghbourhood agan wth the updated y. Otherwse, start the consecutve neghbourhood search wth y. The process contnues untl all neghbourhoods are vsted and no further mprovement can be obtaned to the current soluton. The VND_RAP procedure can be formalzed n the followng flow chart: Three key factors underle the proposed VND_RAP algorthm - how to generate a proper ntal soluton, how to defne a set of neghbourhood structures, and how to desgn a penalty functon to evaluate nfeasble solutons are dscussed n the followng sectons. 2. ntal Soluton Generaton To generate a feasble ntal soluton, s ntegers between k + e and n max - f (nclusve) are randomly selected to represent the number of components n parallel (n ) for each subsystem. e and f denote the constants that control the range of component selecton. Then, the n components are chosen under a unform dstrbuton to the a dfferent types. here a feasble soluton s calculated, the ntal soluton s found; otherwse, the process s repeated untl a feasble ntal soluton s obtaned. l = l + No St ar t Select the set of neghbourhood structures N l, l =,, l max Generate a feasble ntal soluton (y) l = Fnd the best neghbourng soluton (y') of y, y N (y) s y' better than y? No l = l max? St op Yes l Yes Fgure 2. Flow chart of VND_RAP algorthm 2.2 Neghbourhood Structure y' replaces y Ths secton depcts four knds of neghbourhood structures and llustrates wth an example, respectvely: Type structure: Ths structure consders changes on only one subsystem. Smultaneously replace one type of component wth a dfferent type wthn the same subsystem,.e., y j y j + and y m y m - for j m. All possbltes are enumerated and all subsystems are consdered. For example, f there are three avalable components (,, and ) n a subsystem, and the current
4 A Varable Neghbourhood Descent Algorthm for the Redundancy Allocaton Problem 97 component allocaton s as n Fgure 3(a). Fgures 3(b) to 3(e) show four combnatons of neghbourng solutons generated accordngly and the shaded components are newly added to replace the exstng ones. (a) (b) (c) (d) (e) Fgure 3. An example of neghbourhood type Type 2 structure: They are the same as n a Type structure and changes the number of a partcular component type by ether addng or subtractng one,.e., y j y j + or y j y j -. Each component avalable n a subsystem s ndependently consdered. For example, there are three component types (,, and ) avalable n a partcular subsystem and Fgure 4(a) represents the current allocaton wth one Type component and two Type components. Then, a total of fve possble combnatons of neghbourng solutons are derved as Fgures 4(b) to 4(f), where shaded boxes represent the added components, and the removed components are marked by the dashed box. (a) (b) (c) (d) (e) (f) Fgure 4. An example of neghbourhood type 2 Type 3 structure: Ths structure consders changes on two subsystems at a tme. Hence, smultaneously add one component to a certan subsystem and delete one component n another subsystem,.e., y j y j + and y om y om - for o. All possbltes are enumerated and all subsystems are consdered. For nstance, the current allocaton s demonstrated n Fgure 5(a). One possble neghbourng soluton s to add one Component n subsystem and delete Component from subsystem ; the result s n Fgure 5(b) where the shaded box s the added component wthout replacng any exstng one, and the dashed box s the elmnated one. 2 (a) 2 Fgure 5. An example of neghbourhood type 3 (b) Type 4 structure: They are the same as n a Type 3 structure. Ths neghbourhood extends the Type neghbourhood above to exchange components n two of many subsystems smultaneously,.e., (y j y j + and y m y m - ) ( y oj y oj + and y om y om - ) for j m and o. An example shown n Fgure 6 assumes three component optons (denoted by,, and ) avalable n each subsystem. The example of Fgure 6(a) shows the current status. n subsystem, a Component replaces one of Component s. Also, n subsystem a Component substtutes one of Component s. Fgure 6(b) shows the result of these two subsystems where the new components are shaded. 2 (a) 2 Fgure 6. An example of neghbourhood type Penalty Functon Cot and Smth (996b) suggest the use of a penalty functon to evaluate the objectve functon under a constraned problem. An approprate-desgned penalty functon wll encourage the algorthm to explore the feasble regon and nfeasble regon near the border of the feasble area, and dscourage, but permt, further search nto the nfeasble regon. After generatng all neghbourng solutons, the algorthm uses a penalty functon for nfeasble solutons (Lang and Smth 2004): R up u γc C = R Cu u γ where C u and u are total system cost and weght of soluton u respectvely. R u s the unpenalzed relablty of soluton u calculated usng equaton (). Then, the penalzed relablty R up for systems that exceed cost constrant C and/or weght constrant s calculated by multplyng the un-penalzed objectve wth two penalty factors C ( C ) u γ C and ( ) u γ (b) (5) where the exponents γ and γ C are preset amplfcaton parameters. 3. COMPUTATONAL RESULTS The VND_RAP s coded n Borland C++ Bulder 5.0 and run wth an ntel Pentum V 2.8GHz PC at 52 MB
5 98 Yun-Cha Lang Cha-Chuan u Table. Component data for test problems (Fyffe et al., 968) Component Alternatves (j) Sub-system () r c w r 2 c 2 w 2 r 3 c 3 w 3 r 4 c 4 w n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a RAM. All computatons use real float pont precson wthout roundng or truncatng values. The system relablty of the fnal soluton s rounded to four dgts behnd the decmal pont n order to compare them wth results n the lterature. The 33 varatons of the Fyffe et al. problem (968) as devsed by Nakagawa & Myazak (98) were used to test the performance of VND_RAP. The component optons for the benchmark problems are lsted n Table. Ths problem sets C = 30 and ncrementally decreased from 9 to 59. n Fyffe et al. (968) and Nakagawa & Myazak (98), the optmzaton approaches requre only dentcal components to be placed n redundancy; however, for the VND_RAP approach, dfferent types are allowed to resde n parallel (assumng that values of n max = 8 and k = for all subsystems). The parameters of the penalty functon are set as γ = c and γ = 2. Ten runs were made usng dfferent random number seeds for each problem nstance. The followng two settngs play key roles n the VND_RAP algorthm: the number of ntal components n each subsystem and the sequence of the neghbourhood structures. Therefore, detals of these two factors are nvestgated n sectons 3. and 3.2. n addton, consderng pror RAP work where component mxng was allowed on the heurstc benchmarks, the study chose GA of Cot and Smth (996a), TS of Kulturel-Konak et al. (2003), and ACO of Lang and Smth (2004) for comparson and wll be dscussed n secton Number of ntal Components The generaton of an ntal soluton s controlled by a range between k + e and n max - f (nclusve) determnng the number of components n parallel n each subsystem. n order to obtan a feasble ntal soluton close to the border between the feasble regon and the nfeasble regon, an nvestgaton s conducted. The algorthm consders both (e =, f = 4) and (e =, f = 5); n other words, 2 to 4 components and 2 to 3 components are selected for each subsystem. Fgure 7 ndcates the maxmum relablty over ten runs n 33 nstances. Under the least ( = 9~8) and moderate ( = 80~70) constraned problems, the opton of 2~4 components performs equal or better than that of 2~3 components n 4 out of 22 nstances. hen the weght constrant becomes strcter ( = 69~59), the opton of 2~3 components outperforms the 2~4 components one n 7 out of nstances. Then, wth the decrease of the value, Table 2 shows the computatonal expense of the 2~4 components opton grows tremendously. For the most constraned nstances, the average CPU tme ncreases to approxmately 96 seconds. However, the 2~3 components opton performs wth much less computatonally effort. Our results also show whether the constrants are loose or strct, the average CPU tme always appears lower than second. To balance soluton qualty and computatonal expense, the 2~4 components opton s adopted for the least and moderate constraned nstances,.e., = 9~70, and remanng nstances use the 2~3 components opton. Max Relablty over Ten Runs nstances (denoted by eght Constrant) e=,f=4 (2~4 components) e=,f=5 (2~3 components) Fgure 7. The effect of number of ntal components on system relablty
6 A Varable Neghbourhood Descent Algorthm for the Redundancy Allocaton Problem 99 Table 2. The effect of number of ntal components on average CPU tme (n seconds) 9~8 80~70 69~59 2~ ~ The Sequence of Neghbourhood Structures Hansen and Mladenovć (2003) ndcate that the key to successfully employng the VND conssts of the proper defnton of neghbourhood structures, and the sequence of neghbourhood structures, etc. Four types of neghbourhood structures are proposed n secton 2.2, so the number of possble search sequences s 4! = 24. Fgure 8 shows the average system relablty over 0 runs n each possble sequence of neghbourhood structures. The nstances are dvded nto three groups 9~8, 80~70, and 69~59 dependng on the severty of the weght constrant. The sequence of outperforms other sequences n all three groups of nstances. n addton, when startng wth a Type 2 neghbourhood, the average performance s better than startng wth other structures. Table 3 summarzes the average performance (denoted by R avg ), the best performance (denoted by R max ), and theaverage standard devaton (denoted by Stdev) over 0 runs n all 33 nstances for each possble se-quence. t agan confrms that the sequence of Type 2-Type 3-Type -Type 4 performs the best n all measures. That s ths sequence not only provdes the best soluton qualty but also s the most robust to the random number seed. Therefore, n next secton, ths sequence s used to compare other best-known heurstcs n the lterature. System Relablty Sequence of Neghbourhood Structures Fgure 8. The effect of sequence of neghbourhood structures on average system relablty 3.3 Comparson wth Other Metaheurstcs Consderng pror RAP works where component mxng was allowed on the heurstc benchmarks, the three best-known metaheurstcs - GA of Cot and Smth (996a), TS of Kulturel-Konak et al. (2003), and ACO of Lang and Smth (2004) were chosen for comparson. Each algorthm was run 0 tmes usng dfferent random number seeds for each nstance. Percentages of the devaton between VND_RAP and other meta-heurstcs, GA, ACO, and TS are dsplayed n Fgure 9. The performance measure s defned as ((other methods VND_RAP) / VND_RAP) 00%. The best soluton over 0 runs was used for comparson. The devatons for the less and moderate constraned nstances (the frst 22) scatter between 0.5% and 0.35%, and when the problems become more constraned (the last ), the devatons fluctuate between 0.45% and 0.0%. The Table 3. The effect of sequence of neghbourhood structures on R, R max, and Stdev avg Sequence R avg R max Stdev Sequence R avg R max Stdev
7 00 Yun-Cha Lang Cha-Chuan u average percentage of the devaton VND_RAP over all 33 nstances was less than 0.3% compared wth other three methods. n addton, the average standard devaton of VND_RAP over 330 runs (33 nstances wth 0 runs each) was Thus, VND_RAP was able to fnd comparable solutons to the best-known methods n the lterature and was robust to random number seeds. Percentage Devaton of VND_RAP versus Other Metaheurstcs nstances (from the least to the most constraned) GA ACO TS Fgure 9. Comparsons of VND_RAP versus GA, ACO, and TS t s dffcult to make a precse comparson on computatonal expense. CPU seconds vary accordng to hardware, software and programmer s codng skll. Therefore, the number of solutons generated may provde a better dea on how effcent an algorthm performs. The number of solutons generated n GA (Cot and Smth 996b) was 48,040 (a populaton sze of 40 and stopped after 200 teratons), the ACO algorthm n Lang and Smth (2004) needed about 00,000 evaluatons (a colony sze of 00 wth up to 000 teratons), and TS n Kulturel-Konak et al. (2003) evaluated an average of 350,000 solutons. The number of solutons searched n VND_RAP was approxmately 49,000 on average. That s, VND_RAP requred only a smlar number of evaluatons to GA, less than half of the ones n ACO, and /7 of TS to get the comparable performance. n addton, the average CPU tme of VND_RAP was 0.73 seconds that was consdered as a reasonable tme n solvng such a large system. 4. CONCLUSONS Ths paper uses a varable neghbourhood descent meta-heurstc method to solve the seres-parallel redundancy allocaton problem. The RAP s a well-known NPhard problem generally n a restrcted form where each subsystem must consst of dentcal components n parallel to make computatons tractable. The newer metaheurstc methods overcome ths lmtaton and offer a practcal way to solve large nstances of the relaxed RAP where dfferent components can be placed n parallel. Gven the well-structured neghbourhood of the RAP, varable neghbourhood descent method that has not been used n relablty desgn yet s lkely to be more effectve and more effcent than one that does not. A VND_RAP algorthm s proposed and tested on the most well known benchmark problems from the lterature. t has been shown that VND_RAP performs comparably well to other meta-heurstcs n soluton qualty and very effcently n computatonal expense consderaton. Therefore, VND and ts varatons seem very promsng for other NP-hard relablty desgn problems such as those found n networks and complex structures. ACKNOLEDGEMENT The authors would lke thank Dr. Shu-Ka S. Fan for hs precous comments on ths research. REFERENCES Bellman, R. and Dreyfus, S. (958), Dynamc Programmng and the Relablty of Multcomponent Devces, Operatons Research, 6, Besten, M. D. and Stützle, T. (200), Neghborhoods Revsted: an Expermental nvestgaton nto the Effectveness of Varable Neghborhood Descent for Schedulng, Proceedngs of the 4 th Metaheurstcs nternatonal Conference, Proto, Portugal, Brmberg, J., P. Hansen, Mladenovć, N. and Tallard, É. (2000), mprovements and Comparson of Heurstcs for Solvng the Multsource eber Problem, Operatons Research, 48(3), Bulfn, R. L. and Lu, C. Y. (985), Optmal Allocaton of Redundant Components for Large Systems, EEE Transactons on Relablty, R-34(3), Chern, M. S. (992), On the Computatonal Complexty of Relablty Redundancy Allocaton n a Seres System, Operatons Research Letters,, Cot, D.. and Lu, J. (2000), System Relablty Optmzaton wth k-out-of-n Subsystems, nternatonal Journal of Relablty, Qualty and Safety Engneerng, 7(2), Cot, D.. and Smth, A. E. (996a), Relablty Optmzaton of Seres-Parallel Systems Usng a Genetc Algorthm, EEE Transactons on Relablty, 45(2), Cot, D.. and Smth, A. E. (996b), Penalty Guded Genetc Search for Relablty Desgn Optmzaton, Computers & ndustral Engneerng, 30(4), Cot, D.. and Smth, A. E. (996c), Solvng the Redundancy Allocaton Problem Usng a Combned Neural Network/Genetc Algorthm Approach, Computers & Operatons Research, 23(6),
8 A Varable Neghbourhood Descent Algorthm for the Redundancy Allocaton Problem 0 Fyffe, D. E., Hnes,.. and Lee, N. K. (968), System Relablty Allocaton and a Computatonal Algorthm, EEE Transactons on Relablty, R-7(2), Ghare, P. M. and Taylor, R. E. (969), Optmal Redundancy for Relablty n Seres Systems, Operatons Research, 7, Hansen, P. and Mladenovć, N. (2002), J-Means: A New Local Search Heurstc for Mnmum Sum-of- Squares Clusterng, Pattern Recognton, 34, Hansen, P. and Mladenovć, N. (2003), Varable Neghborhood Search, n F.. Glover and G. A. Kochenberger (eds.), Handbook of Metaheurstcs, Kluwer Academc Publsher, Hertz, A. and Mttaz, M. (200), A Varable Neghborhood Descent Algorthm for the Undrected Capactated Arc Routng Problem, Transportaton Scence, 35, Huang, Y.-C. (2003), Optmzaton of the Seres-Parallel System wth the Redundancy Allocaton Problem Usng a Hybrd Ant Colony Algorthm, Master Thess, Yuan Ze Unversty, Tawan, R.O.C. Huang, Y.-C., Her, Z.-S. and Lang, Y.-C. (2002), Redundancy Allocaton Usng Meta-Heurstcs, Proceedngs of the 4 th Asa-Pacfc Conference on ndustral Engneerng and Management System (APEMS 2002), Tape, December 2002, Kulturel-Konak, S., Cot, D.. and Smth A. E. (2003), Effcently Solvng the Redundancy Allocaton Problem Usng Tabu Search, E Transactons, 35(6), Kuo,. and Prasad, V. R. (2000), An Annotated Overvew of System-relablty Optmzaton, EEE Transactons on Relablty, 49(2), Levtn, G., Lsnansk, A., Ben-Ham, H. and Elmaks, D. (998), Redundancy Optmzaton for Seres-Parallel Mult-State Systems, EEE Transactons on Relablty, 47(2), L, J. (996), A Bound Dynamc Programmng for Solvng Relablty Optmzaton, Mcroelectronc Relablty, 36(0), Lang, Y.-C. (200), Ant Colony Optmzaton Approach to Combnatoral Problems, Ph.D. Dssertaton, Auburn Unversty, USA. Lang, Y.-C. and Smth, A. E. (999), An Ant System Approach to Redundancy Allocaton, Proceedngs of the 999 Congress on Evolutonary Computaton, ashngton D.C., July 999, Lang, Y.-C. and Smth, A. E. (2004), An Ant Colony Optmzaton Algorthm for the Redundancy Allocaton Problem (RAP), EEE Transactons on Relablty, 53(3), Msra, K. B. and Sharma, U. (99), An Effcent Algorthm to Solve nteger-programmng Problems Arsng n System-Relablty Desgn, EEE Transactons on Relablty, 40(), 8-9. Mladenovć, N. (995), A Varable Neghborhood Algorthm - A New Metaheurstc for Combnatoral Optmzaton, Abstracts of papers presented at Optmzaton Days, Montréal, 2. Nakagawa, Y. and Myazak, S. (98), Surrogate Constrants Algorthm for Relablty Optmzaton Problems wth Two Constrants, EEE Transactons on Relablty, R-30(2), Rbero, C. C. and Souza, M. C. (2002), Varable Neghborhood Search for the Degree-Constraned Mnmum Spannng Tree Problem, Dscrete Appled Mathematcs, 8, Rbero, C. C. and Vanna, D. S. (2005), A GRASP/VND Heurstc for the Phylogeny Problem Usng a New Neghborhood Structure, nternatonal Transactons n Operatonal Research, 2, -4. Tllman, F. A., Hwang, C. L. and Kuo,. (977a), Optmzaton Technques for System Relablty wth Redundancy - A Revew, EEE Transactons on Relablty, R-26(3), Tllman, F. A., Hwang, C. L. and Kuo,. (977b), Determnng Component Relablty and Redundancy for Optmum System Relablty, EEE Transactons on Relablty, R-26(3),
An Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationA SEPARABLE APPROXIMATION DYNAMIC PROGRAMMING ALGORITHM FOR ECONOMIC DISPATCH WITH TRANSMISSION LOSSES. Pierre HANSEN, Nenad MLADENOVI]
Yugoslav Journal of Operatons Research (00) umber 57-66 A SEPARABLE APPROXIMATIO DYAMIC PROGRAMMIG ALGORITHM FOR ECOOMIC DISPATCH WITH TRASMISSIO LOSSES Perre HASE enad MLADEOVI] GERAD and Ecole des Hautes
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationOptimum Design of Steel Frames Considering Uncertainty of Parameters
9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationA HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM
IJCMA: Vol. 6, No. 1, January-June 2012, pp. 1-19 Global Research Publcatons A HYBRID DIFFERENTIAL EVOLUTION -ITERATIVE GREEDY SEARCH ALGORITHM FOR CAPACITATED VEHICLE ROUTING PROBLEM S. Kavtha and Nrmala
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationDecision Science Letters
Decson Scence Letters (5) 89 Contents lsts avalable at GrowngScence Decson Scence Letters homepage: www.growngscence.com/dsl Mult-objectve avalablty-redundancy allocaton problem for a system wth reparable
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationBayesian predictive Configural Frequency Analysis
Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationOptimal Solution to the Problem of Balanced Academic Curriculum Problem Using Tabu Search
Optmal Soluton to the Problem of Balanced Academc Currculum Problem Usng Tabu Search Lorna V. Rosas-Téllez 1, José L. Martínez-Flores 2, and Vttoro Zanella-Palacos 1 1 Engneerng Department,Unversdad Popular
More informationGlobal Optimization Using Hybrid Approach
Tng-Yu Chen, Y Lang Cheng Global Optmzaton Usng Hybrd Approach TING-YU CHEN, YI LIANG CHENG Department of Mechancal Engneerng Natonal Chung Hsng Unversty 0 Kuo Kuang Road Tachung, Tawan 07 tyc@dragon.nchu.edu.tw
More informationBALANCING OF U-SHAPED ASSEMBLY LINE
BALANCING OF U-SHAPED ASSEMBLY LINE Nuchsara Krengkorakot, Naln Panthong and Rapeepan Ptakaso Industral Engneerng Department, Faculty of Engneerng, Ubon Rajathanee Unversty, Thaland Emal: ennuchkr@ubu.ac.th
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationStatistics II Final Exam 26/6/18
Statstcs II Fnal Exam 26/6/18 Academc Year 2017/18 Solutons Exam duraton: 2 h 30 mn 1. (3 ponts) A town hall s conductng a study to determne the amount of leftover food produced by the restaurants n the
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationBoostrapaggregating (Bagging)
Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationHopfield Training Rules 1 N
Hopfeld Tranng Rules To memorse a sngle pattern Suppose e set the eghts thus - = p p here, s the eght beteen nodes & s the number of nodes n the netor p s the value requred for the -th node What ll the
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationChapter 2 A Class of Robust Solution for Linear Bilevel Programming
Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed
More informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
More informationSuccess of Heuristics and the Solution Space Representation
Magyar Kutatók 7. Nemzetköz Szmpózuma 7 th Internatonal Symposum of Hungaran Researchers on Computatonal Intellgence Success of Heurstcs and the Soluton Space Representaton Sándor Csszár Department of
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationNeuro-Adaptive Design - I:
Lecture 36 Neuro-Adaptve Desgn - I: A Robustfyng ool for Dynamc Inverson Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationMaximizing Overlap of Large Primary Sampling Units in Repeated Sampling: A comparison of Ernst s Method with Ohlsson s Method
Maxmzng Overlap of Large Prmary Samplng Unts n Repeated Samplng: A comparson of Ernst s Method wth Ohlsson s Method Red Rottach and Padrac Murphy 1 U.S. Census Bureau 4600 Slver Hll Road, Washngton DC
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More information8. Modelling Uncertainty
8. Modellng Uncertanty. Introducton. Generatng Values From Known Probablty Dstrbutons. Monte Carlo Smulaton 4. Chance Constraned Models 5 5. Markov Processes and Transton Probabltes 6 6. Stochastc Optmzaton
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationIrene Hepzibah.R 1 and Vidhya.R 2
Internatonal Journal of Scentfc & Engneerng Research, Volume 5, Issue 3, March-204 374 ISSN 2229-558 INTUITIONISTIC FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM (IFMOLPP) USING TAYLOR SERIES APPROACH
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationSOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Kim Gaik Universiti Tun Hussein Onn Malaysia
SOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Km Gak Unverst Tun Hussen Onn Malaysa Kek Se Long Unverst Tun Hussen Onn Malaysa Rosmla Abdul-Kahar
More informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationDETERMINATION OF UNCERTAINTY ASSOCIATED WITH QUANTIZATION ERRORS USING THE BAYESIAN APPROACH
Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata Proceedngs, XVII IMEKO World Congress, June 7, 3, Dubrovn, Croata TC XVII IMEKO World Congress Metrology n the 3rd Mllennum June 7, 3,
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More information