Solution of Strip Packing Problems

Size: px
Start display at page:

Download "Solution of Strip Packing Problems"

Transcription

1 From Tme Representaton n Schedulng to the Soluton of Strp Packng Problems Pedro M. Castro * and gnaco E. Grossmann Undade de Modelação e Optmzação de Sstemas Energétcos Laboratóro Naconal de Energa e Geologa Lsboa Portugal Department of Chemcal Engneerng Carnege Mellon Unversty Pttsburgh PA USA Abstract We propose two med-nteger lnear programmng based approaches for the 2-D orthogonal strp packng problem. Usng knowledge from the alternatve forms of tme representaton n schedulng formulatons we show how to effcently combne three dfferent concepts nto the - and y- dmensons. One model features a dscrete representaton on the -as (strp wdth) and a contnuous representaton wth general precedence varables on the y-as (strp heght). The other features a full contnuous-space representaton wth the same approach for the y-as and a sngle non-unform grd made up of slots for the -as. Through the soluton of a set of twenty nne nstances from the lterature we show that the former s a better approach even when compared to three alternatve MLP models rangng from a pure dscrete-space to a pure contnuous-space wth precedence varables n both dmensons. All models are avalable n Keywords: Optmzaton; nteger programmng; Search algorthm; Event ponts. * Correspondng author. Tel.: E-mal: pedro.castro@lneg.pt. 1

2 1. ntroducton Tme representaton s perhaps the most mportant classfcaton crteron for schedulng models. Mathematcal formulatons can ether be classfed as dscrete- or contnuous-tme and several dfferent alternatves have been proposed. Overall there are essentally four man concepts beng used whch are llustrated n Fgure 1. Dscrete tme grd U2 T5 T6 Contnuous tme wth sngle grd U2 T5 T6 U1 T1 T2 T3 T4 U1 T1 T2 T3 T mmedate Precedence (through sequencng varables) General 1 Contnuous tme wth multple grds 2 U2 T5 T6 U2 T5 T6 U1 T1 T2 T3 T4 U1 T1 T2 T3 T Fgure 1. Tme representaton alternatves n schedulng formulatons. Table 1. Classfcaton of schedulng approaches accordng to tme representaton Contnuous-tme Dscrete-tme Sngle grd Multple grds Precedence Kondl et al. (1993) Zhang & Sargent Pnto & Grossmann Méndez et al. (2000) (1996) (1995) Shah et al. (1993) Schllng & Panteldes earapetrtou & Méndez et al. (2001) (1996) Floudas (1998) Panteldes (1994) Castro et al. (2001) Gannelos & Harjunkosk & Georgads (2002) Grossmann (2002) Glsmann & Gruhn Maravelas & Castro & Gupta & Karm (2003) (2001) Grossmann (2003b) Grossmann (2005) Maravelas & Castro et al. (2004) Lu & Karm Prasad & Maravelas Grossmann (2003a) (2007) (2008) Castro et al. (2008) Sundaramoorthy & Castro & Novas Sundaramoorthy & Karm (2005) (2008) Maravelas (2008) Sundaramoorthy & Gménez et al. (2009) Shak & Floudas Ferrer-Nadal et al. Maravelas (2011a) (2009) (2008) Wassck & Ferro (2011) Castro et al. (2009) Susarla & Karm Capón-Garca et al. (2010) (2009) Table 1 provdes a lst of some of the most mportant schedulng references n the Process Systems Engneerng lterature n the last 20 years classfed accordng to the tme representaton concept 2

3 used. t s apparent that no partcular opton s becomng more common clearly reflectng that the best opton for a problem s very much dependent on ts features. Whle predctng the best performer s often dffcult some gudelnes can be gven. The dscrete-tme approach s perhaps the most powerful and has been shown capable of handlng problems of ndustral relevance (Wassck 2009; Wassck & Ferro 2011). The tme horzon of nterest s dvded nto a fed number of tme slots of predetermned duraton wth one knowng a pror the locaton of all tme ponts. Ths makes t straghtforward to handle holdng and backlog costs (Sundaramoorthy & Maravelas 2011b) thus allowng for easy ntegraton wth the hgher level plannng model (Maravelas & Sung 2009) ntermedate events such as release/due dates equpment mantenance as well as tme-dependent utlty prcng and avalablty (Castro et al ). On the downsde fed processng tmes need to be assumed and appromated to a multple of the nterval length. Contnuous-tme models on the other hand are more accurate and senstve to small changes n the duraton of processng and changeover tasks whch can be of a dfferent order of magntude. They are thus more approprate for ntegraton wth the lower level control layer (Capón-Garca et al. 2011). Decdng for a contnuous-tme model needs to be followed by the choce of the concept used to keep track of events takng place. Precedence based models (Méndez et al ) were the frst to appear and are known for ther ablty to provde hgh qualty solutons wth lmted computatonal resources even though t may be dffcult to prove optmalty. The concept of general precedence s used more frequently when compared to mmedate precedence snce t gves rse to smaller models that typcally perform better. Precedence based models tend to be less general than ther tme grd counterparts and are thus more commonly found for multstage plants where they are more effcent. n facltes wth a network structure nvolvng resource constrants other than equpment and unt avalablty.e. multpurpose plants tme grd based models become the only opton. Due to process complety they are lnked to unfed frameworks for process representaton the State-Task (Kondl et al. 1993) and Resource-Task (Panteldes 1994) Networks. When compared to the dscrete-tme representaton the tme horzon s also dvded nto a fed number of slots but now the grd(s) s/are 3

4 non-unform wth the duraton of the slots beng determned through a set of contnuous varables. Fewer slots are requred to represent the soluton more so f multple tme grds are employed. However the number of prespecfed slots has also a stronger nfluence on both soluton qualty and computatonal effort wth one typcally requrng an teratve search procedure to fnd the global optmal soluton (Méndez et al. 2006). Whle t s easer to rely on a sngle grd such opton forces allowng batch tasks to spread across multple slots whch severely compromses ther performance. Wth multple tme grds more effcent unt-specfc models can be used even though there s stll no general model of such type that can handle all dfferent types of resources and storage polces Gong multdmensonal n the contet of N-dmensonal allocaton problems (Westerlund 2005) schedulng problems can be vewed as one dmensonal wth the relevant dmenson beng tme. Strp packng problems are a class of 2-dmensonal allocaton problems (Amossen & Psnger 2010) that are open dmensonal (Wascher et al. 2007) meanng that all tems need to be packed nto a strp of a gven wdth so as to mnmze ts heght. n the paper ndustry for eample one goal s cuttng jumbo reels of paper nto smaller reels so as to mnmze trm losses. Beng a smple to defne albet challengng problem of ndustral relevance s probably the reason t has been wdely studed by the research communty and several soluton approaches have been proposed. Dependng mostly on problem sze and the tme avalable to generate a soluton one may rely on heurstcs (We et al. 2009; Ortmann et al. 2010) eact algorthms (Kenmoch et al. 2009; Martello et al. 2003; Bekrar et al. 2007; Alvarez- Valdes et al. 2009; Grancolas & Pnto 2010) or mathematcal programmng models (Castro & Olvera 2011). The latter two have the advantage of establshng f the best found soluton s ndeed optmal whle nformng of the mamum possble dstance to such optmum whch can be qute relevant. The drawback s ther sharp decrease n performance wth respect to problem sze. Mathematcal programmng approaches are more adaptable to changes n the problem constrants or objectve functon an essental feature consderng that ndustral problems rarely fall wthn the eact boundares of a standard problem defnton. For nstance Dow Chemcal has recently reported (Wassck & Ferro 2011) the soluton of a non-classcal packng problem consstng on loadng a 4

5 sem-traler wth packages of dfferent szes and weghts so that the traler payload weght and also the rear ale weght are kept below hghway allowable lmts. The soluton method was a mednteger lnear programmng (MLP) model that etended a dscrete-tme schedulng model (Wassck 2009) from one to two dmensons. The recently proposed MLP-based approaches by Castro and Olvera (2011) for 2-D packng problems were also nspred by schedulng models. The man novelty has been the combnaton of two dfferent concepts a dscrete-space representaton wth respect to the -as and a contnuousspace representaton for the y-as. Combnng dscrete wth contnuous representatons s known to be an effectve approach for plannng and schedulng wth a rollng-horzon strategy (Dmtrads et al. 1997; Castro et al. 2011). Lke n schedulng contnuous-space representatons for 2-D packng are more accurate snce the rectangles wdths and heghts do not need to be multples of the characterstc dmensons of the mesh used to dscretze the strp see Fgure 2 on the left. Classcal MLP models for 2-D packng problems feature contnuous varables to determne the (y) coordnates of a gven rectangle pont n the strp (see Fgure 2 on the rght) a concept that can naturally be etended to three (Wu et al. 2010) and hgher dmensonal allocaton problems (Westerlund et al. 2007). They can be derved from a Generalzed Dsjunctve Programmng formulaton featurng four sets of Boolean varables to dentfy the locaton of a rectangle wth respect to another followed by ether a conve-hull or bg-m reformulaton (Sawaya & Grossmann 2005). A closely related model usng the centrod coordnate nstead of the upper-left corner as the reference pont was proposed by Castllo et al. (2005) and reported to have a better computatonal performance so t s the one consdered n ths artcle for comparatve purposes. y Dscrete space n y as Contnuous space n y as H wth postonng varables H W W Fgure 2. Classcal representaton alternatves for 2-D allocaton problems. 5

6 The bnary postonng varables n the contnuous-space models are the N-dmensonal equvalents to the general precedence sequencng varables n schedulng. Models relyng on ths concept can be used as standalone procedures whereas the soluton from those relyng on one or multple spatal grds s dependent on the number of slots specfed and thus requres an teratve search procedure to fnd the global optmal soluton whch mght termnate wth a suboptmal soluton due to a temporary plateau n the value of the objectve functon. To overcome ths lmtaton we now propose a new hybrd dscrete/contnuous-space model featurng sequencng varables n the y-as whch can not only guarantee global optmalty but s also able to mprove the performance of the recent hybrd model of Castro & Olvera (2011). We also present a full contnuous-space model that reles on the same set of varables for the y-as and on a sngle grd for the -as. We have therefore combned all four major concepts for spatal representaton gven n Fgure 1 and effcently as wll be shown later on. The rest of the paper s structured as follows. Gven the problem defnton n secton 2 we dscuss the new 2-D representaton alternatves n secton 3. The contnuous-space model of Castllo et al. (2005) that s part of the computatonal studes s brefly descrbed n secton 4 whle the new MLP models are presented net. Secton 5 concerns the new hybrd dscrete/contnuous-space approach wth secton 6 dealng wth the new contnuous-space approach. The computatonal results are then the subject of secton 7. n secton 8 we summarze the advantages and lmtatons of the dfferent spatal representaton concepts studed wth the conclusons beng left for secton Problem Defnton We consder the two-dmensonal orthogonal strp packng problem. Gven are a set of rectangles wth wdth w and heght h. The objectve s to place the rectangles wthout overlap nto a strp of a gven wdth W so as to mnmze the heght H. The focus s set on the soluton of problems wth nteger data and no rotatons are allowed. Nevertheless the contnuous-space models that are presented net naturally handle real values for the wdths and heghts. 6

7 3. Prevous and Newly Proposed Spatal Representaton Alternatves n the hybrd model of Castro & Olvera (2011) the strp s dvded along ts wdth W (-as) nto vertcal strps of untary wdth. Each elementary strp has ts own vertcal grd made of allocaton ponts that can be lnked to the left-bottom corner of a partcular rectangle. All W grds have the same number of allocaton ponts but ther y-coordnate wll typcally be dfferent unless adjacent elementary strps share the same rectangle. Ths s llustrated on the left of Fgure 3. y Dscrete space n as Dscrete space n as Contnuous space n as Contnuous space n y as Contnuous space n y as wth sngle spatal grd wth multple spatal grds wth sequencng varables Contnuous space n y as H H H wth sequencng varables W W W Fgure 3. New representaton alternatves for 2-D packng problems. The newly proposed hybrd dscrete/contnuous-space model uses sequencng varables nstead of spatal grds to properly place rectangles wth respect to the y-as. Contnuous varables gve the y- coordnate of the bottom-edge of the dfferent rectangles wth the possblty of the same coordnate beng shared by two rectangles provded there s enough horzontal space among them. Fgure 3 on the mddle llustrates ths aspect showng a drect correspondence to the placement of the allocaton ponts from the other hybrd model (Castro & Olvera 2011) that are shown on the left (horzontal segments). Ths novel approach s not cursed by the uncertanty n the number of allocaton ponts meanng that the soluton of a sngle MLP wll gve the global optmal soluton to the problem. We also propose a somewhat related hybrd contnuous-space model that keeps the postonng varables n the y-as but uses a sngle horzontal contnuous grd nstead of a dscrete spatal grd. We thus return to the use of allocaton ponts and the need for an teratve search procedure to fnd the global optmal soluton. Ths alternatve s llustrated on the rght of Fgure 3. Note that 7

8 8 rectangles can span over multple slots so the vertcal lnes do not necessarly correspond to gullotne cuts. 4. A Contnuous-Space Model wth Postonng Varables (CS) Two-dmensonal contnuous-space models typcally employ ( y ) varables to defne the rectangle coordnates on the and y-as. n order to provde a comparson wth the newly proposed models we consder the adaptaton of the BLDP1 block layout desgn model by Castllo et al. (2005) for the strp packng problem. The bg-m formulaton by Sawaya and Grossmann (2005) s smlar but nvolves four sets of bnary varables n the no-overlap constrants where at most one can be actve. The objectve s the mnmzaton of the strp heght eq. (1). Contnuous varables ( y ) denote the coordnates of the center of rectangle whle bnary varables P and Q are sets of bnary varables (Westerlund et al. 2007) used n the overlap preventon constrants eqs. (2-5). Specfcally (2) and (3) are concerned wth vald placement of rectangle to the rght and left of rectangle whle (4) and (5) ensure vald placement of rectangle on top or below rectangle. Eqs. (6-9) ensure that the edges of every rectangle are wthn the boundares of the strp whle the doman of the model varables s gven by (10-13). mn H (1) Q P W w w ) ( ) ( 2 1 (2) Q P W w w ) (1 ) ( 2 1 (3) Q P M y y h h ) (1 ) ( 2 1 (4) Q P M y y h h ) (2 ) ( 2 1 (5) w 2 1 (6) w W 2 1 (7)

9 1 y h 2 (8) y H 1 2 h (9) P {01} > (10) Q {01} > (11) 0 (12) y 0 (13) 5. New Hybrd Dscrete-Space Approach (NDCS) We now propose a new model that s dscrete n the -as doman and contnuous n the y-as. The y dmenson s preferred for contnuous representaton to avod the teratve procedure nvolved n the effcent determnaton of the strp heght (Castro & Olvera 2011) whch can now be defned as a contnuous varable H. Let X={1 W} be the set of vertcal slots n the -as. Two sets of bnary varables are used: N to dentfy the assgnment of the left-edge of rectangle to the start of slot ; Z to specfy f the top-edge of rectangle s below the bottom-edge of rectangle ( >) provded that one bo s at least partly above the other see Fgure 4 and Fgure 5. The y- coordnate of the bottom-edge of rectangle s gven by varable Y. Z ={01} Z =1 f > Z =0 f > y y y y Fgure 4. Value of y-as sequencng varables Z for dfferent arrangements. 9

10 10 Fgure 5. Values of the varables for the new med dscrete-space approach (NDCS). Consder the eample n Fgure 5 that dentfes whch varables Z need to be fed for the arrangement shown. Rectangle 1 s beneath the others and so Z 12 = Z 13 = Z 14 =1. Rectangle 4 s below 2 whch s the same as sayng that 2 s above 4.e. Z 24 =0. Wth respect to the nteracton between (23) and (34) they do not occupy the same horzontal slots and so the values of the correspondng varables are rrelevant. Ths s apparent from bg-m constrants (14-15) whch are wrtten for every par of rectangles and every slot. f the left edge assgnments of rectangles and make them occupy slot then both summatons nsde the brackets on the rght-hand sde wll be equal to 1. Then there are two possbltes: Z =1 or 0. Wth the former the bg-m term n eq. (14) dsappears and the constrant Y Y +h s enforced.e. the bottom-edge of rectangle s above the top-edge of rectangle as ntended by the defnton of the bnary varables. For the latter opton t s the bg-m term n eq. (15) that s equal to zero leadng to Y Y +h.e. rectangle s above. For all other cases the constrants are relaed. X N N Z M h Y Y w X w X ) (3 1 1 (14) X N N Z M h Y Y w X w X ) (2 1 1 (15) Eq. (16) ensures that the top edge of every rectangle s below the strp heght. The same apples to the sum of the heghts of all rectangles occupyng a gven slot eq. (17). Then any gven rectangle can be assgned to a sngle slot eq. (18). Eqs. (19-22) gve the doman of the model varables whle the objectve functon n eq. (1) also apples. H 2 Y 2=7 N 23=1 Z 24=0 3 4 Y 4=3 N 42=1 Y 3=2 Z 14=1 N 35=1 1 Z 12=1 Y 1=0 N 11=1 Z 13= W

11 Y h H (16) X w 1 h N H X (17) N (18) X 1 ={:+w W+1} X (19) N {01} X (20) Z {01} > (21) Y 0 (22) 6. New Contnuous-Space Approach (NCS) Usng the same set of sequencng varables Z we now propose a new contnuous-space model that uses a sngle spatal grd n the -as. Let E={e 1 e E } be the set of allocaton ponts n the - as that mplctly fes the mamum number of rectangles that can be placed on a gven horzontal slce of the strp to E -1 see Fgure 6. Rectangles wll occupy one or more slots wth bnary varables N dentfyng the assgnment of the left-edge of rectangle to allocaton pont e and the e e rght-edge to pont e (e >e). The -coordnate of allocaton pont e wll be gven by contnuous varables X e. Usng the same smple eample we llustrate the value of the model varables n Fgure 7. Notce that rectangle 2 occupes a sngle slot startng at allocaton pont e 3 and endng at allocaton pont e 4 thus N 1. The same goes for 3 whle 4 occupes 2 slots and rectangle 1 4. t s mportant 234 to hghlght that the rght edge of the rectangle may not concde wth the -coordnate of the endng allocaton pont (e.g. e 5 ). Ths avods the need for further allocaton ponts n cases where the empty space cannot be occuped and s reflected n eqs. (23-24). t states that the dfference n the - coordnates of allocaton ponts e (replaced by the strp wdth W f e = E eq. 24) and e must be greater than the wdth of the rectangle provded that ts left and rght edges are assgned to such ponts. Notce that the coordnate of the frst allocaton pont s equal to zero eq (25). 11

12 slot1 slot 2 slot E 2 slot E E 2 E 1 1 E allocaton X 1 X 2 ponts X 3 X E 2 X E 1 W Fgure 6. Sngle non-unform spatal grd n the -as used by new contnuous-space approach H Y 2=7 2 N 234=1 Z24=0 3 4 Y 4=3 N 424=1 Y 3=2 Z 14=1 N 345=1 1 Z12=1 Y1=0 N115=1 Z13=1 e 1 e 2 e 3 e 4 e 5 X 1=0 X 3=2 X 4=4 W X 2=1 Fgure 7. Values of the varables for the new contnuous-space approach (NCS). X e W X X w N e E e E e e e E (23) e e e e w N e e e E e E e e (24) X 1 =0 (25) The other sets of constrants are conceptually smlar to those of the hybrd dscrete/contnuousspace model consderng that nde has been replaced by nde e. n Eq. (26) the bg-m term s equal to zero whenever the top-edge of rectangle s below the bottom-edge of rectangle and both and occupy slot e of the -doman grd meanng that ther left-edges are allocated to some allocaton pont e matchng or located to the left of allocaton pont e and that ther rght-edges are assgned to some pont e that s located to the rght of both allocaton ponts e and e. f on the other-hand rectangle s above then t s eq. (27) that s enforced. Y Y h M [3 Z ( N e e N e e )] e E e E (26) e E e E ee e e e e Y Y h M [2 Z ( N e e N e e )] e E e E (27) e e e E e E e e e e 12

13 Eqs. (1) (16) (21-22) are shared wth NDCS whle eq. (28) states that the total heght of all rectangles occupyng a gven slot e must be lower than the strp heght. Eq. (29) states that the left and rght edges of every rectangle must be assgned to eactly one par of allocaton ponts (ee ) wth e >e. The doman of the new set of bnary varables s gven by eq. (30). Notce that contrary to NDCS there can be no doman reducton for the left-edge allocaton pont. e e e E e e e E e e h N e e H e E e E (28) ee e e E e N e e 1 (29) N e e {01} e E e E e e (30) 6.1. Heurstc search for the global optmal soluton The new contnuous-space model can fnd the optmal soluton for a gven number of allocaton ponts. Wth a mnmum of two ponts.e. one slot a feasble soluton wth H h can be obtaned by packng all rectangles on top of each other provded that the bg-m value n eqs. (26-27) s greater than H. n contrast the hybrd dscrete/contnuous-space model n (Castro & Olvera 2011) normally requres a few allocaton ponts to ensure feasblty. n general however two allocaton ponts wll be nsuffcent to fnd the real optmal soluton to the problem and a hgher value wll need to be specfed. The dffculty s that there s no eact method to predct the value to use even for one-dmensonal schedulng problems and despte recent efforts (L & Floudas 2010). Ths s a serous ssue consderng that one typcally gets a one order of magntude ncrease n computatonal effort followng a sngle ncrease n the number of allocaton ponts.e. events (see Castro & co-workers ). Snce global optmalty can only be ensured n the lmt of E = +1 whch wll almost certanly compromse tractablty a proper search procedure s needed. We adapt the teratve search procedure from (Castro & Olvera 2011) that s n turn borrowed from event-based schedulng models (Méndez et al. 2006). Startng wth E =2 we keep ncreasng the number of allocaton ponts and solvng the optmzaton problem untl the objectve functon 13

14 stops mprovng. Snce the soluton space for E +1 ponts ncludes the feasble space for E and to enhance computatonal performance we remove the current best soluton from the feasble space through the use of a cutoff value see eq. (31). Wth the purpose of solely searchng for a better soluton we make the problem nfeasble f the global optmal soluton has already been found. One can also specfy an absolute optmalty tolerance for the MLP solver ε whch s partcularly useful n the case of nteger data for the rectangles dmensons lke n the problems consdered n ths artcle.e. ε= The detaled search algorthm for the contnuous-space model NCS s gven n Fgure 8. Hcutoff (31) ntalzaton E =2 absolute optmalty tolerance=ε Solve MLP E = E +1 mn H (1) s.t. eqs. ( ) store soluton cutoff=h ε NO problem nfeasble? YES Output Strp heght H Placements nto strp Fgure 8. Search algorthm for new slot-based contnuous-space approach (NCS) The Temporary Plateau Lmtaton Although the teratve search procedure works qute well n practce (the frst teratons can be solved rather rapdly) t s mportant to hghlght that the plateau n the objectve functon may only be temporary meanng that there s no guarantee that the global optmal soluton wll result even f all teratons are solved to optmalty. n fact ths phenomenon was observed n 2 out of the 29 test problems solved contrary to what happened wth the hybrd dscrete/contnuous-space model from (Castro & Olvera 2011) where a smple eample had to be used for llustratve purposes. 14

15 Takng the well-known ngcut08 problem as an eample the search for the optmal strp heght starts wth H=149 for 2 allocaton ponts. For a sngle ncrement n the number of allocaton ponts there s a substantal decrease n heght H=75. The soluton contnues to mprove for 4 and 5 ponts wth the optmal arrangements gven n Fgure 9. Notce that the soluton for E =4 stll generates a consderable amount of waste and that the locaton of e 2 and e 3 defne gullotne cuts. The same can be sad for e 2 and e 3 concernng the soluton on the rght but not for e 4 snce rectangle 2 s located between e 3 and e 5. The search contnues for E =6 that features an optmal strp heght equal to 36. The same optmal soluton s returned for E =7 leadng to the termnaton of the search wth a best soluton that s n fact suboptmal. More specfcally f model NCS s solved for E =8 the global optmal soluton can be found (H=33). These two solutons are shown n Fgure 10. n the one on the rght there are already seven rectangles ( ) for whch the actve bnary varable N features e e e >e+1. n partcular rectangle 8 spreads across three slots wth the left-edge assgned to allocaton pont e 5 and the rght-edge to pont e 8. 15

16 H= H= e1 e2 e3 e4 e1 e2 e3 e4 e5 Fgure 9. nfluence on the number of allocaton ponts on the optmal soluton for E16 part 1. On the left E =4 and H=50. On the rght E =5 and H=40. 16

17 H=36 4 H= e1 e2 e3 e4 e5 e6 e1 e2 e3 e4 e5 e6 e7 e8 Fgure 10. nfluence on the number of allocaton ponts on the optmal soluton for E16 part 2. On the left E =6 and H=36. On the rght E =8 and H=33 whch s a global optmal soluton. 7. Computatonal Results The performance of the gven soluton approaches (NDCS NCS and CS) s now llustrated through the soluton of 29 strp packng problems and compared to that of two recent soluton strateges (DS and DCS see Castro & Olvera 2011) that have been evaluated under the same software and hardware. More specfcally the models and search algorthms were mplemented n GAMS 23.2 usng CPLEX 12.1 as the MLP solver wth a sngle thread an absolute optmalty tolerance equal to (recall that all data are nteger) and a mamum computatonal tme per run equal to 7200 CPU s. n the case of the search algorthms a new teraton started only f the accumulated computatonal tme was below 7200 CPU s makng t possble for the total computatonal tme to go up to 4 hours. n eqs. ( ) we have used M=300 ecept for cgcut02 (M=3000 so that the soluton for E =2 s feasble). The hardware conssted of a laptop wth 17

18 an ntel Core2 Duo T GHz processor wth 4 GB of RAM runnng Wndows Vsta Enterprse. The GAMS nput fles of all fve mathematcal programmng models and assocated search algorthms are avalable through the CMU-BM Cybernfrastructure for MNLP collaboratve ste n the MNLP lbrary of problems under the ttle: 2-D Orthogonal Strp Packng Key performance ndcators The ultmate goal of any optmzaton approach s to determne the global optmal soluton whch frst nvolves fndng such soluton and then provng t cannot be mproved further. For two of the approaches under evaluaton (CS and NDCS) ths nvolves solvng a smple MLP problem per eample whle for the others a few teratons may be nvolved. n partcular t s possble for DCS and NCS to termnate wth a suboptmal soluton snce the search strategy for the global optmal soluton s not rgorous but heurstc. n fact ngcut08 and ht02 led to temporary plateaus for NCS (see secton 6.2) whle the phenomena was not observed for DCS. When falng to fnd the optmal soluton most methods are capable of fndng near optmal solutons the ecepton beng DS for whch the frst feasble soluton s also optmal. Table 2 provdes the values for a comparatve analyss of these 4 performance ndcators. Table 2. Key performance ndcators on the soluton of 29 test problems Optmal solutons Suboptmal solutons No solutons Best performer Approach Reference Found Proven Dscrete-space (DS) (Castro & Olvera 2011) Hybrd (Castro & dscrete/contnuous (DCS) Olvera 2011) Contnuous-space (CS) (Castllo et al. 2005) New hybrd Ths work dscrete/contnuous (NDCS) New contnuous-space Ths work (NCS) Total 29 18

19 Table 3. Best soluton found and total computatonal effort for dfferent approaches (best performer n bold suboptmal solutons n talc) Prevous work New work Prevous work New work Approach DS DCS CS NDCS NCS DS DCS CS NDCS NCS Problem W H CPU s E E E a 7200 a E a a 7200 a E SCP b cgcut a a cgcut a 7201 a 7200 a 7200 a 8720 a ngcut ngcut a a 5182 b ngcut a 7200 a a ngcut ngcut a ngcut c 8194 a 6235 b ngcut ngcut a 7200 a ngcut a 7200 a 7200 a 7200 a a ngcut a 7200 a 4198 c 5118 b 3665 ngcut a a 7200 a 7200 a a ngcut a 7202 a 5235 b ht a a ht a 7200 a ht a ht a 7200 a 7200 a 7203 a ht a 7200 a 7200 a a ht a a ht a 7200 a 7200 a 7203 a ht a 7201 a 7200 a 7204 a 7200 a ht a 7201 a 7200 a 7204 a a a Mamum computatonal tme termnaton. b Out of memory termnaton. c Abnormal termnaton wth suboptmal soluton. The new hybrd dscrete/contnuous-space model (NDCS) s the best overall performer. t s able to fnd the same 21 optmal solutons as ts DCS counterpart and was able to prove optmalty n 6 more cases. When added to the fact that no teratve procedure for the global optmal soluton s needed t shows that t s preferable to use sequencng varables than multple spatal grds for the y- as. The same number of proven optmal solutons (19) was obtaned by the dscrete-space approach whose man drawback s ether fndng an optmum or no soluton at all. t thus has to be consdered the thrd best performer. Further down the lne come the two contnuous-space approaches that ehbted a lower success rate n terms of fndng and provng optmalty wth the 19

20 new one havng the edge due to the hgher number of proven optmal solutons (15 vs. 6). t s thus better to employ a sngle tme grd on the -as than postonng varables despte the dsadvantage of the heurstc search procedure. The last column n Table 2 gves the number of problems n whch a gven formulaton was the best performer. To make the decson we frst consdered soluton qualty and then computatonal tme (see Table 3). Whenever two approaches had the same tme (e.g. DCS and NDCS n SCP16) we chose the one not requrng an teratve search procedure (NDCS). n ngcut11 we broke the te between CS and NDCS by pckng the one wth the hghest relaaton (best possble soluton) at the tme of termnaton (43.0 vs. 50.8). The most nterestng result s that a partcular formulaton s the best performer n at least two problems meanng that they all can be potentally useful. n the days of parallel computng where even a relatve nepensve computer features a few threads t s already possble to rely on multple approaches for decson-makng. Nevertheless a few recommendatons can be made that are the subject of secton 8. But frst let us dscuss the computatonal statstcs related to problem sze Computatonal Statstcs n Table 4 we show the number of enttes related to problem sze together wth the root node relaaton for the models that do not requre an teratve search procedure CS and NDCS (note that the dscrete-space model DS uses a dfferent objectve functon and that the relaaton for the slot based models DCS and NCS changes wth E ). The values n columns 2 and 3 show that the new hybrd dscrete/contnuous-space MLP model s consderably tghter than the contnuous-space model of Castllo et al. (2005). n fact the relaaton of the former s equal to the well-known contnuous lower bound (Martello et al. 2003) gven by eq. (32). The same apples to hybrd model DCS whle the relaaton of the new contnuous-space approach (NCS) les somewhere n between CS and NDCS. As an eample the largest ntegralty gap was for ngcut12 wth an optmal soluton H=87 and a root node relaaton equal to 24 (CS) 41.6 (NCS) and 83.5 (DCS and NDCS). w h /W (32) 20

21 Wth respect to problem sze the opton of dscretzng both dmensons leads to the largest number of bnary and total varables whch can easly go past the tens of thousands lsted n Table 4. Ths was hardly unepected consderng the use of three-nde bnary varables (y) n DS where X =W and Y =H. DCS also features three-nde bnares (e) but now the number of allocaton ponts n the y-as requred to fnd the optmal soluton s consderably lower than the strp heght. n terms of the models gven n ths paper NCS also features three ndces (ee ) but two of them are event based resultng n typcally fewer bnary varables than the two-nde () model NCS. The lowest number of bnares often results from the two-nde ( ) model CS. A smlar trend s observed n terms of total varables whle for total constrants the results are not as conclusve wth DS DCS and CS sharng top spot. The number of constrants for the new hybrd model (NDCS) s typcally one order of magntude larger wth NCS lyng n fourth place. Notce that the large majorty of the constrants for NDCS arse from the y-as no overlap constrants whch feature three-ndces ( ) whereas n the correspondng NCS constrants the frst s an allocaton pont nde (e ). The other three approaches have just two ndces n the no overlap constrants: one set of (y) equatons n DS; 3 sets of (e) constrants n DCS; and 2 sets of ( ) equatons n CS. Wth respect to the comparson between the two hybrd dscrete/contnuous-space models movng from DCS to NDCS can be vewed as swtchng the complety from the bnary varables to the constrants sde. Overall t s clear that an analyss based solely on problem sze s hardly sutable to predct the best performer. 21

22 Table 4. Statstcs for last problem solved (RMP=root node relaaton DV=dscrete varables TV=total varables SE=sngle equatons) Approach CS NDCS DS DCS CS NDCS NCS DS DCS CS NDCS NCS DS DCS CS NDCS NCS Problem RMP DV TV SE E E E E E SCP cgcut cgcut ngcut ngcut ngcut ngcut ngcut ngcut ngcut ngcut ngcut ngcut ngcut ngcut ht ht ht ht ht ht ht ht ht

23 Table 5. Man Characterstcs of Tested Approaches for 2-D Strp Packng Problems Spatal Approach Full Dscrete Hybrd dscrete/contnuous Full Contnuous Name DS DCS NDCS CS NCS -as Sngle unform grd Sngle unform grd Sngle unform grd General precedence Sngle slot-based grd y-as Sngle unform grd Multple slot-based grd General precedence General precedence General precedence A pror Sze of squares (rectangles) n the mesh Wdth of unform tme slots Wdth of unform tme None Number of allocaton decsons that (-as); number of slots (-as) ponts and number of can affect allocaton ponts of dfferent slots a rectangle can span soluton grds (y-as) (-as) Need for teratve Yes Yes No No Yes search procedure Strengths Perfect packng problems; possblty of usng a Tghtest formulaton (same Best overall performer; Ablty to fnd good Problem sze ndependent courser grd to keep problem tractable (data rounded relaaton as NDCS) tghtest formulaton solutons fast; leads to of strp dmensons. to multples of slot wdth and heght). (same relaaton as the smallest problem DCS) szes Drawbacks Optmal soluton s the frst feasble soluton from Soluton dependence on Strp wdth affects Not partcularly tght teratve search procedure search procedure; can lead to prohbtvely large number of allocaton ponts; problem sze meanng that global may end wth suboptmal problem szes when consderng large strp areas and Strp wdth affects problem optmalty may be soluton accurate data; soluton dependence on mesh sze sze dffcult to prove 23

24 8. Overvew of the Man Features of Alternatve Approaches The characterstcs strengths and drawbacks of the fve alternatve approaches tested are summarzed n Table 5. The frst aspect to hghlght s related to the motvaton behnd ths paper and concerns the type of spatal representaton employed. The deal formulaton should be fully contnuous-space to be ndependent of problem data and allow consderng real and not just nteger data for the rectangles wdths and heghts. f not we may need to employ the fnest dscretzaton possble (e.g. strp dvded n 11 squares) to consder the real accurate problem whch may lead to grds wth too many slots n other words to an ntractable problem. Ths property can also be consdered an advantage snce t gves an obvous way to reduce the problem sze and hence complety. By ncreasng the slot sze (coarser grd) and roundng up problem data an appromaton verson of the problem can stll be solved. Whle t s beyond the scope of ths paper to evaluate ths opton t s relevant to hghlght that ths strategy s frequently employed for the effectve soluton of ndustral szed schedulng problems (Méndez et al. 2006). A full dscrete-space approach (DS) has been shown partcularly effcent n zero-waste perfect packng problems where addng the constrant of no empty elementary squares has had a major mpact on effcency (Castro & Olvera 2011). Dscrete approaches are known to be consderably tghter than ther contnuous counterparts thus compensatng the larger sze of ther resultng mathematcal programmng problems. By keepng one of the dmensons dscrete (-as) we have kept the relaaton as tght as possble equal to the contnuous lower bound. Ths s somewhat related to a hgher lkelhood of fndng and provng optmalty as can be seen n Table 2. The advantage of usng general precedence sequencng varables nstead of multple grds n the y-as s that t avods the heurstc search procedure for the global optmal soluton whch can n theory lead to termnaton wth a suboptmal soluton (Castro & Olvera 2011). Such a drawback was ndeed observed for the new contnuous-space formulaton (NCS) suggestng that t may be more frequent when usng sngle rather than multple grds. Nevertheless NCS was tghter than ts general precedence counterpart (CS) whch can eplan why more problems were solved to global optmalty. However both are consderably less tght than DCS and 24

25 NDCS. The worst performance of CS n terms of provng optmalty s compensated by the generaton of the smallest MLPs of the lot whch s translated nto the ablty of fndng very good solutons n the early nodes of the search tree. 9. Conclusons Ths paper has presented two new med-nteger lnear programmng approaches for the 2- dmensonal strp packng problem the NDCS and NCS models. Contrary to the approach of relyng on two sets of bnary postonng varables to locate a partcular rectangle wth respect to another we keep the set of postonng varables for the y-as but use a dfferent approach for the -as. Whle n one model (NDCS) the -as s dscretzed through the use of a unform spatal grd consstng of a few slots n the other (NCS) a non-unform contnuous tme grd wth fewer slots s employed. Both can be vewed as hybrd models n the sense that dfferent concepts for spatal representaton are beng combned. The performance of the new models has been tested n several problems taken from the lterature and compared to three other MLP-based approaches both quanttatvely by usng the same hardware and software and qualtatvely by hghlghtng the man advantages and lmtatons of each partcular approach. The new hybrd dscrete/contnuous-space model was shown to be the best performer n key performance ndcators lke number of optmal solutons found and proven whle the new contnuous-space approach more than doubled the number of problems solved to optmalty wth respect to a prevously publshed contnuous-space model wth two sets of postonng varables. Overall t was nterestng to fnd out that all tested methods can be potentally useful snce each approach was the best performer n at least 2 out of 29 problems. Acknowledgments The authors gratefully acknowledge fnancal support from Luso-Amercan Foundaton and the Natonal Scence Foundaton under the 2011 Portugal U.S. Research Networks Program. 25

26 References Alvarez-Valdes R. Parreño F. & Tamart J.M. (2009). A Branch and Bound Algorthm for the Strp Packng Problem. OR Spectrum Amossen R.R. & Psnger D. (2010). Mult-dmensonal Bn Packng Problems wth Gullotne Constrants. Computers & Operatons Research Bekrar A. Kacem. & Chu C. (2007). A Comparatve Study of Eact Algorthms for the Two Dmensonal Strp Packng Problem. Journal of ndustral and Systems Engneerng Vol. 1 No Capón-Garca E. Ferrer-Nadal S. Graells M. Pugjaner L. (2009). An Etended Formulaton for the Fleble Short-Term Schedulng of Multproduct Semcontnuous Plants. nd. Eng. Chem. Res Capón-Garca E. Moreno-Bento M. Espuña A. (2011). mproved Short-Term Batch Schedulng Fleblty usng Varable Recpes. nd. Eng. Chem. Res Castllo. Westerlund J. Emet S. Westerlund T. (2005). Optmzaton of block layout desgn problems wth unequal areas: A comparson of MLP and MNLP optmzaton models. Comput. Chem. Eng Castro P. Barbosa-Póvoa A.P.F.D & Matos H. (2001). An mproved RTN contnuous-tme formulaton for the short-term schedulng of multpurpose batch plants. ndustral and Engneerng Chemstry Research Castro P.M. Barbosa-Póvoa A.P. Matos H.A. & Novas A.Q. (2004). Smple Contnuous- Tme Formulaton for Short-Term Schedulng of Batch and Contnuous Processes. nd. Eng. Chem. Res Castro P.M. & Olvera J.F. (2011). Schedulng nspred Models for Two-Dmensonal Packng Problems. European Journal of Operatonal Research Castro P.M. & Novas A.Q. (2008). Short-Term Schedulng of Multstage Batch Plants wth Unlmted ntermedate Storage. nd. Eng. Chem. Res Castro P.M. Novas A.Q. & Carvalho A. (2008). Optmal Equpment Allocaton for Hgh Plant Fleblty: An ndustral Case Study. nd. Eng. Chem. Res Castro P.M. Harjunkosk. & Grossmann.E. (2009). New Contnuous-Tme Schedulng Formulaton for Contnuous Plants under Varable Electrcty Cost. nd. Eng. Chem. Res. 48:

27 Castro P.M. Harjunkosk. & Grossmann.E. (2011). Optmal Schedulng wth Energy Constrants. Computers & Chemcal Engneerng Dmtrads A.D. Shah N. & Panteldes C.C. (1997). RTN-based Rollng Horzon Algorthms for Medum Term Schedulng of Multpurpose Plants. Computers & Chemcal Engneerng 21 S1061. Ferrer-Nadal S. Capón-Garca E. Méndez C.A. & Pugjaner L. (2008). Materal Transfer Operatons n Batch Schedulng. A Crtcal Modelng ssue. nd. Eng. Chem. Res Gannelos N. F. & Georgads M. C. (2002). A Smple Contnuous-Tme Formulaton for Short- Term Schedulng of Multpurpose Batch Processes. nd. Eng. Chem. Res Gménez D.; Hennng G.; Maravelas C. (2009). A Novel Network-based Contnuous-Tme Representaton for Process Schedulng: Part. Man Concepts and Mathematcal Formulaton. Computers and Chemcal Engneerng Glsmann K. Gruhn G. (2001). Short-term Schedulng and Recpe Optmzaton of Blendng Processes. Computers and Chemcal Engneerng Grancolas S. & Pnto C. (2010). A SAT Encodng for Mult-dmensonal Packng Problems. n: Lod A Mlano M Toth P edtors. ntegraton of A and OR Technques n Constrant Programmng for Combnatoral Optmzaton Problems Berln Hedelberg: Sprnger-Verlag Gupta S. & Karm. A. (2003). An mproved MLP formulaton for schedulng multproduct multstage batch plants. ndustral and Engneerng Chemstry Research Harjunkosk. & Grossmann. E. (2002). Decomposton Technques for Multstage Schedulng Problems usng Med-nteger and Constrant Programmng Methods. Comput. Chem. Eng erapetrtou M.G. & Floudas C.A. (1998). Effectve contnuous-tme formulaton for short-term schedulng. 1. Multpurpose batch processes. ndustral and Engneerng Chemstry Research Kenmoch M. mamch T. Nonobe K. Yagura M. & Nagamoch H. (2009). Eact Algorthms for the Two-Dmensonal Strp Packng Problem wth and wthout Rotatons. European Journal of Operatonal Research Kondl E. Panteldes C.C. & Sargent W. H. (1993). A general algorthm for short-term schedulng of batch operatons. MLP formulaton. Computers and Chemcal Engneerng

28 L J. Floudas C.A. (2010). Optmal Event Pont Determnaton for Short-Term Schedulng of Multpurpose Batch Plants va Unt-Specfc Event-Based Contnuous-Tme Approaches. nd. Eng. Chem. Res Lu Y. & Karm. A. (2007). Schedulng multstage multproduct batch plants wth nondentcal parallel unts and unlmted ntermedate storage. Chemcal Engneerng Scence Maravelas C. T. & Sung C. (2009). ntegraton of producton plannng and schedulng: Overvew Challenges and Opportuntes. Computers and Chemcal Engneerng Maravelas C.T. & Grossmann. E. (2003a). Mnmzaton of the Makespan wth a Dscrete- Tme State-Task Network Formulaton. nd. Eng. Chem. Res Maravelas C.T. & Grossmann. E. (2003b). A New General Contnuous-Tme State Task Network Formulaton for Short Term Schedulng of Multpurpose Batch Plants. nd. Eng. Chem. Res Martello S. Monac M. & Vgo D. (2003). An eact approach to the strp-packng problem. nforms Journal on Computng Méndez C. A. Hennng G. P. & Cerdá J. (2000). Optmal schedulng of batch plants satsfyng multple product orders wth dfferent due-dates. Computers and Chemcal Engneerng Méndez C. A. Hennng G. P. & Cerdá J. (2001). An MLP contnuous-tme approach to shortterm schedulng of resource-constraned multstage flowshop batch facltes. Computers and Chemcal Engneerng Méndez C.A. Cerdá J. Grossmann.E. Harjunkosk. & Fahl M. (2006). State-of-the-art Revew of Optmzaton Methods for Short-term Schedulng of Batch Processes. Comput. Chem. Eng Ortmann F.G. Ntene N. & van Vuuren J.H. (2010). New and mproved Level Heurstcs for the Rectangular Strp Packng and Varable-szed Bn Packng Problems. European Journal of Operatonal Research Panteldes C.C. (1994). Unfed frameworks for optmal process plannng and schedulng. n: Proceedngs of the Second Conference on Foundatons of Computer-Aded Process Operatons CACHE publcatons New York

29 Pnto J. & Grossmann. A. (1995). Contnuous Tme Med nteger Lnear Programmng Model for the Short-Term Schedulng of Multstage Batch Plants. nd. Eng. Chem. Res Prasad P.; Maravelas C.T. (2008). Batch selecton assgnment and sequencng n mult-stage mult-product processes. Comput. Chem. Eng; 32: Sawaya N.W. & Grossmann.E. (2005). A Cuttng Plane Method for Solvng Lnear Generalzed Dsjunctve Programmng Problems. Comput. Chem. Eng Schllng G. & Panteldes C.C. (1996). A Smple Contnuous-Tme Process Schedulng Formulaton and a Novel Soluton Algorthm. Comput. Chem. Eng. 20 S1221-S1226. Shah N. Panteldes C.C. & Sargent R. (1993). Optmal Perodc Schedulng of Multpurpose Batch Plants. Annals of Operatons Research Shak M. & Floudas C. (2009). Novel Unfed Modelng Approach for Short-Term Schedulng. nd. Eng. Chem. Res Sundaramoorthy A. & Maravelas C.T. (2011b). Computatonal Study of Network-Based Med- nteger Programmng Approaches for Chemcal Producton Schedulng. nd. Eng. Chem. Res Sundaramoorthy A. & Maravelas C. T. (2011a). A General Framework for Process Schedulng. Ache Journal 57(3) Sundaramoorthy A. Karm.A. (2005). A smpler better slot-based contnuous-tme formulaton for short-term schedulng n multpurpose batch plants. Chem. Eng. Sc. 60: Sundaramoorthy A.; Maravelas C.T. (2008). Smultaneous batchng and schedulng n multstage multproduct processes. nd. Eng. Chem. Res. 47: Susarla N. L J. & Karm.A. (2010). A Novel Approach to Schedulng Multpurpose Batch Plants Usng Unt-Slots. AChE J Wascher G. Haussner H. & Schumann H. (2007). An mproved typology of cuttng and packng problems. European Journal of Operatonal Research 183 (3) Wassck J. (2009). Enterprse-wde optmzaton n an ntegrated chemcal comple. Computers & Chemcal Engneerng Wassck J.M. & Ferro J. (2011). Etendng the Resource Task Network for ndustral Applcatons. Computers and Chemcal Engneerng

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

A Facet Generation Procedure. for solving 0/1 integer programs

A Facet Generation Procedure. for solving 0/1 integer programs A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

INTRODUCTION INTRODUCTION. Moisès Graells Semi-continuous processes

INTRODUCTION INTRODUCTION. Moisès Graells Semi-continuous processes INTRODUCTION Mosès Graells (moses.graells@upc.edu) Barcelona / Catalona / Span Unverstat Poltècnca de Catalunya CEPIMA, PSE research group Emertus Prof. Lus Puganer IECR Specal Issue INTRODUCTION Sem-contnuous

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

A Modelling and a New Hybrid MILP/CP Decomposition Method for Parallel Continuous Galvanizing Line Scheduling Problem

A Modelling and a New Hybrid MILP/CP Decomposition Method for Parallel Continuous Galvanizing Line Scheduling Problem ISIJ Internatonal, Vol. 58 (2018), ISIJ Internatonal, No. 10 Vol. 58 (2018), No. 10, pp. 1820 1827 A Modellng and a New Hybrd MILP/CP Decomposton Method for Parallel Contnuous Galvanzng Lne Schedulng Problem

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15 CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

CS1100 Introduction to Programming

CS1100 Introduction to Programming Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

Control strategies for network efficiency and resilience with route choice

Control strategies for network efficiency and resilience with route choice Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

11. APPROXIMATION ALGORITHMS

11. APPROXIMATION ALGORITHMS Copng wth NP-completeness 11. APPROXIMATION ALGORITHMS load balancng center selecton prcng method: vertex cover LP roundng: vertex cover generalzed load balancng knapsack problem Q. Suppose I need to solve

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Announcements. Supervised Learning

Announcements. Supervised Learning Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples

More information

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Desgn and Analyss of Algorthms Heaps and Heapsort Reference: CLRS Chapter 6 Topcs: Heaps Heapsort Prorty queue Huo Hongwe Recap and overvew The story so far... Inserton sort runnng tme of Θ(n 2 ); sorts

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information