POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with and"

Transcription

1 POLYSA: A Polynomal Algorthm for Non-bnary Constrant Satsfacton Problems wth and Mguel A. Saldo, Federco Barber Dpto. Sstemas Informátcos y Computacón Unversdad Poltécnca de Valenca, Camno de Vera s/n Valenca, Span {msaldo, Abstract. Nowadays, many real problems can be naturally modelled as Constrant Satsfacton Problems (CSPs). It s well known that any non-bnary CSP can be transformed nto an equvalent bnary one, usng some of the current technques. However, ths transformaton may not be practcal n problems wth certan propertes. Therefore, t s necessary to manage these non-bnary constrants drectly. In ths paper, we propose a heurstc called "POLYSA" that solves non-bnary constrant satsfacton problems n a natural way as an ncremental and non-bnary CSP solver. Ths non-bnary CSP solver carres out the search through a polyhedron that mantans n ts vertces those solutons that satsfy all non-bnary constrants. 1. Introducton Nowadays, many problems n the 'real world' can be effcently modelled as constrant satsfacton problems and solved usng constrant programmng technques. These nclude problems from felds such as artfcal ntellgence, operatonal research, databases, expert systems, etc. Most of these problems can be modelled naturally as non-bnary constrant satsfacton problems. Modellng a problem wth non-bnary constrants has several advantages. It facltates the expresson of the problem, enables more powerful constrant propagaton as more global nformaton s avalable, etc. It s well known that any non-bnary CSP can be solved drectly by means of non-bnary CSPs solvers or transformed nto a bnary one [10]. However, ths transformaton has several drawbacks: - The translaton process generates new varables, so t produces a sgnfcant ncrease n the problems sze, causng extra memory requrements for algorthms. In some cases, solvng the bnary formulaton can be very neffcent [1] [3] [8]. - In any case, ths forced bnarzaton generates unnatural formulatons, whch cause extra dffcultes for constrant solver nterfaces wth human users [2]. In ths paper, we propose an algorthm called "Polyhedron Search Algorthm " (POLYSA) that manages non-bnary CSPs n a natural way as an ncremental and non-bnary CSP solver. Ths algorthm s based on HSA [11][12] whch s the

2 complete algorthm because t mantans all the vertces generated by the Cartesan Product of the varable doman bounds. Although HSA obtans good expermental results, ts computatonal complexty s O(2 n ), so the use of heurstcs s necessary to solve these problems n polynomal tme. Therefore, we present POLYSA whch shares the same phlosophy as HSA, (.e) the vertces are generated by the Cartesan Product of some varable doman bounds. However ts computatonal complexty s reduced to O(n 3 ), although POLYSA s not a complete algorthm. POLYSA effcently manages non-bnary CSPs wth many varables, many constrants and very large domans. Ths proposal overcomes some of the weaknesses of other typcal technques, lke Forward-Checkng and Real Full Look- Ahead, snce ts complexty does not change when the doman sze and the number of dsequatonal constrants ncrease. Moreover, we can manage constrants (nequaltes ) and (dsequatons ) that can be nserted ncrementally and dynamcally nto the problem wthout havng to solve the whole problem agan. Thus, we can manage non-bnary dynamc constrants whch are very frequent n many real applcatons. Ths paper s structured as follows: Frst, we present the prelmnares and the constrant typology that POLYSA can manage. Then, we present the algorthm and evaluate ts behavour wth some of the current technques. Fnally, we present the conclusons and future work proposals. 2. Prelmnares Brefly, a constrant satsfacton problem (CSP) that POLYSA manages conssts of: A set of varables X = { x 1,..., x n }. For each varable x X there s a doman of possble values D. A set of constrants C = { c 1,..., c p } restrctng the values that the varables can smultaneously take. A soluton to a CSP s an assgnment of a value from ts doman to every varable, such that all constrants are satsfed. The objectve n a CSP may be: - to determne whether a soluton exsts - to fnd one soluton, (wth no preference as to whch one), many or all solutons - to fnd the varable domans - to fnd an optmal, or a good soluton by means of an objectve or multobjectve functon defned n terms of certan varables. 2.1 Notaton and defntons We wll summarze the notaton that we wll use n ths paper.

3 Generc: The number of varables n a CSP wll be denoted by n. The doman of the varable x wll be denoted by D. The constrants wll be noted by c, and all the constrants have the maxmum arty n. We wll always use ths notaton when analysng the complextes of algorthms. Varables: To represent varables we wll use x wth an ndex, for example, x 1, x, x n. Domans: The doman of the varable x wll be denoted by D [ l, u ] =, so the doman length of the varable x s u l. It s mportant to realse that the doman s contnuous. Constrants: Let X = { x 1,..., x n } be a set of real-valued varables. Let α be a n polynomal of degree n (.e., α = p x ) over X and b an nteger. A lnear relaton = 1 over X s an expresson of the form αrb where r {<,, =,,, >}. A lnear dsequaton over X s an expresson of the form α b. A lnear equalty over X s an expresson of the form α = b. The constrants that we are gong to manage are lnear relatons and lnear dsequatons of the form: Inequaltes: n p x b =1 (1) Dsequatons: n p x = 1 b F( x) b : F( x) non lnear (2) where are varables rangng over contnuous ntervals x l, u, b s a real constant, and n 1. Usng the above constrants, equaltes can be wrtten as conjunctons of two nequaltes. Smlarly, strct nequaltes can be wrtten as the conjuncton of an nequalty and an dsequaton. Thus, we can manage all possble combnatons: {<,, =,,, >}. x [ ] Defnton 1. Gven two ponts x,y R n, a convex combnaton of x and y s any pont of the form z = λx + ( 1 λ) y where 0 λ 1. A set S R n s convex ff t contans all convex combnatons of all pars of ponts x,y S. Defnton 2. Let r {,, }. A Koubaraks formula [7] s a formula of ether of the two forms (1) (x-y) r c or (2) x r c.

4 Defnton 3. A smple temporal constrant [4] s a formula of the form c (x-y) d. Defnton 4. A smple metrc constrant [6] s a formula of the form -c r 1 (x-y) r 2 d where r 1, r 2 {<, }. Defnton 5. A CPA/sngle nterval formula [9] s a formula of one of the followng two forms: (1) c r 1 (x-y) r 2 d; or (2) x r y where r {<,, =,,, >} and r 1, r 2 {<, }. Defnton 6. A TG-II formula [5] s a formula of one of the followng forms: (1) c x d, (2) c x-y d or (3) xry where r {<,, =,,, >}. Note that the tractable formalsms defned n Defntons 2-6 can be trvally expressed n order to be managed by our proposal POLYSA. 2.2 Constrants We now gve more defntons on constrants and dstngush between bnary and non-bnary constrants. The arty of a constrant s the number of varables that the constrant nvolves. A unary constrant s a constrant nvolvng one varable. A bnary constrant s a constrant nvolvng a par of varables. A non-bnary constrant s a constrant nvolvng an arbtrary number of varables. When referrng to a non-bnary CSP we mean a CSP where some or all of the constrants have an arty of more than 2. POLYSA s a CSP solver that manages non-bnary constrants. Example. The followng are examples of non-bnary constrants: ( x 6x + 3x 9x 4 ), ( x x 2x 3x 4 ), ( x x 4x + x 4 ) < The frst and second constrants are managed drectly by POLYSA, the last constrant s transformed nto two constrants: x 2x 4x + x < 4 ) ( x 2x 4x + x 4 ) ( x 2x 4x + x 4 ) ( Specfcaton of the Polyhedron Search Algorthm Intally, POLYSA can be consdered as a classc CSP solver, where there s a statc set of constrants that the soluton must satsfy. The man steps are shown n

5 Fg1. POLYSA generates an ntal polyhedron (step 1) wth 2n 3 vertces created by means of the Cartesan product of the varable doman bounds ( D 1 D2 L Dn ), but randomly selectng the vertces such that each polyhedron face mantans n 2 vertces that have not ever been selected by any other adjacent face. For each nput ( ) constrant, POLYSA carres out the consstency check (step 2). If the ( ) constrant s not consstent, POLYSA returns not consstent problem; otherwse, POLYSA determnes whether the ( ) constrant s not redundant, and updates the polyhedron (step 3), (.e.) POLYSA elmnates the not consstent vertces and creates the new ones. When all statc ( ) constrants are studed, MAS checks the consstency wth the ( ) constrants (step 4). Thus, solutons to CSP are all vertces and all convex combnatons between any two vertces satsfyng all dsequatonal constrants. Fnally, POLYSA can obtan some mportant results such as: (1) the problem consstency; (2) one or many problem solutons; (3) the new varable domans; and (4) the vertex of the polyhedron that mnmses or maxmses some objectve or multobjectve functon. It must be taken nto account that the POLYSA mght fal due to the fact that the polyhedron generated by the heurstc does not mantan all the vertces of the complete polyhedron. Furthermore, when POLYSA fnshes ts statc behavour (classc CSP solver), new constrants can be ncrementally nserted nto the problem, and POLYSA studes the consstency check as an ncremental CSP solver. Varable Domans x l, u [ ] Polyhedron Creaton (Step 1) n p x b =1 For each constrant Consstent? No Not consstent Problem (Step 2) (Step 3) Yes Redundant? Yes No Polyhedron Updatng (Step 4) Problem Consstency wth ( ) -Consstent Problem -One, many or all Solutons -Mnmal Domans -Optmal pont of Multobjectve functons Fg. 1. General Scheme of the Polyhedron Search Algorthm.

6 3.1 The Polyhedron Search Algorthm The man goal of POLYSA s to solve a problem as an ncremental and non-bnary CSP solver. The man specfcaton of POLYSA s defned n Fg. 4. Ths specfcaton ncludes three procedures: Polyhedron_Creaton (Dmenson, domans) (Fg 2) s a module that generates the polyhedron vertces by means of the Cartesan Product of the varable domans obtanng some of the polyhedron vertces: v l, l, L, l ), L, v = ( l, l, L, l, u, L, u ), L, v = ( u, u, L, u ) 1 = ( 1 2 n 1 2 j j+ 1 n n 1 2 n Polyhedron_creaton (Dmenson, Domans) { For =0 to 2*Dmensons do: // For each face do the followng { For j=0 to Dmensons*Dmensons do: { Make(NewVertex); // New empty vertex s generated NewVertex Assgns a new unrepeated vertex n the current face LstV NewVertex; } } Return LstV ; // the module returns a lst wth 2*Dmenson 3 vertces. } Fg. 2. Polyhedron_creaton (step 1) Satsfy(C, v ) s a module that determnes whether the vertex v satsfes the constrant C. Thus, ths functon only returns true f the result s b, when the varables ( x 1, x2, L, x n ) are set to values v =( v 1, v2, L, v n ). Polyhedron_Updaton (v, L, ) (Fg 3) s a module that updates the yes L no polyhedron elmnatng all nconsstent vertces ( L no are the vertces that do not satsfy the constrant) and ncludes the new vertces generated by the ntersecton between arcs that contan a consstent extreme (vertex) and the other v. Polyhedron_Updaton ( v, L, L ) yes no { For each adjacent vertex v of v do: POLYSA obtans the straght lne l that untes both v and v ponts. POLYSA ntersects l wth the polyhedron obtanng the new pont v L yes L yes v return L yes ; } Fg. 3. Polyhedron_Updaton (step 3)

7 POLYSA (Dmenson, Domans, Constrants,Constrants, Solutons) { Step 1 LstV Polyhedron_Creaton (Dmenson, Domans, Constrants ); L φ; L φ; Step 2..For each C Constrants do: { v LstV do: If { If Satsfy(C, v ) then: // checks f the v satsfes the constrant C L L { v } ; // C s consstent wth the system yes yes else L L { v } ; no no } = φ STOP ; // C s not consstent wth the system L yes no = φ If L " C s consstent and redundant "; else Step 3 v L no Polyhedron_Updaton ( v, L yes, L no ) ; } Step 4 Satsfacton(Constrants, L yes, Solutons); // see secton 3.2 return output; // OFHH returns the consstency check, and some extreme solutons } yes no Fg. 4. Polyhedron Search Algorthm. Theorem 1: POLYSA s correct n N. Proof: POLYSA s correct n N because the resultng polyhedron s convex and s a subset of the resultng convex polyhedron obtaned by the complete algorthm HSA[12]. So, we can conclude that POLYSA s correct n N. Theorem 2: For n < 10, POLYSA s complete. Proof: Suppose by contradcton that POLYSA s not complete for n<10. The ntal polyhedron whch s generated by the Cartesan Product of the varable doman bounds, contans 2n faces and 2 n vertces. POLYSA generates n 2 unrepeated vertces n each face. Thus, POLYSA generates 2 3 2n n = 2n vertces. If POLYSA s not complete for n<10, then there are some vertces that POLYSA does not mantan for n<10. So 2n 3 < 2 n for n<10. Ths s a contradcton, because 2 n < 2n 3 for n<10. So, POLYSA s complete for n<10.

8 3.2 Consstency study wth constrants In ths secton, we present the behavor of POLYSA when there are some ( ) constrants. The consstency study of constrants of ths type has a lnear complexty wth the number of ( ) constrants. Followng, n Fg. 5, we present an example n R 2 that summarzes the possble stuatons that mght be reached. - Polyhedron (1) represents the ntal polyhedron created by the Cartesan Product of the two varables. - Polyhedron (2) represents the resultng polyhedron when all the ( ) constrants have been analyzed. So, when POLYSA has checked the problem consstency wth the constrants ( ) and t s consstent, POLYSA carres out the consstency check of the constrants ( ). Therefore, POLYSA mantans n a lst, L yes, all the resultng polyhedron vertces. The consstency check wth the constrants ( ) and the lst, L yes, can generate four dfferent cases: (a) Some vertces of the lst, L yes, are consstent wth all the ( ) constrants. In ths case, the problem s consstent. (b) Any vertex of the lst ' L yes ' s consstent wth all the ( ) constrant. However, some convex combnatons between two vertces are consstent wth the ( ) constrant. In ths case, the problem s consstent. (c) There s a ( ) constrant that reduces the polyhedron to a unque face, and the resultant vertces are not consstent wth the ( ) constrants. However, some convex combnatons between two vertces are consstent wth the constrant ( ). In ths case, the problem s consstent. (d) The last stuaton occurs when there s a (<) constrant, that s, a ( ) constrant that reduces the polyhedron to a unque face and a ( ) constrant that elmnates ths face. Thus, no vertex s consstent wth the constrants and no convex combnaton s consstent. Therefore, the problem s not consstent. These constrants can be dynamcally nserted or deleted from the problem due to the fact that the management of the ( ) constrants has a low computatonal complexty. When a new ( ) constrant s nserted, the consstent vertces to ths pont are checked wth the new one. It must be taken nto account that f at least one vertex s consstent, the whole problem wll be consstent. If a non-bnary ( ) constrant s deleted from the problem, the algorthm looks for the vertces that have been elmnated by ths constrant and determne whether these vertces have also been elmnated by other constrants. The vertces whch have been elmnated by ths constrant only are returned to the lst ' L yes '. If ths lst s not empty, the problem s consstent. Otherwse, the problem contnues to be not consstent.

9 R 2 (a) Consstent (1) (b) Consstent (2) Constrant types (c) Consstent (d) Not Consstent Consstent Not consstent Fg. 5. Dfferent stuatons n ( ) constrants. 3.3 Graphcal Interface POLYSA allows the user to ntroduce the necessary parameters n order to randomly or manually run problems. The graphcal nterface s presented n Fg 6. The upper part of the screen shows the parameters that the user must confgure: the number of varables, the number of ( ) constrants, the number of ( ) constrant, the doman length, the number of desred solutons f the problem s consstent, and fnally, the number of problems f the user wants the program to generate several random problems. Then, when the parameters are set, the selected problems are randomly generated and solved by POLYSA. However, f the user wants to manually generate a problem, t s possble to ntroduce the varable domans and the selected constrants n the correspondng parameters. The problems generated and solved n the lower wndow of Fg. 6 are shown. Ths screen shows the selected parameters, the random or manual varable domans and constrants. Also, ths screen dsplays some nformaton about the executon, showng a partal soluton and the CPU tme for checkng each ( ) constrant. Fnally, ths screen dsplays the consstency problem and the total CPU tme. If the problem s consstent, the desred solutons are shown.

10 Fg. 6. Graphcal Interface 4. Analyss of the Polyhedron Search Algorthm POLYSA spatal cost s determned by the number of vertces generated. Intally, POLYSA generates 2n 3 vertces, where n s the number of problem varables. For each ( ) constrant (step 2), POLYSA mght generate n new vertces and elmnate only one. Thus, the number of polyhedron vertces s 2n 3 +k(n-1) where k s the number of constrants. Therefore, the spatal cost s O(n 3 ). However, HSA spatal cost s O(2 n ) due to the fact that the algorthm generates all the polyhedron vertces, and t would be mpractcal n problems wth many varables. The temporal cost s dvded nto three steps: ntalsaton, consstency check and actualsaton. The ntalsaton cost (step 1) s O(n 3 ) because the algorthm only generates 2n vertces. For each ( ) constrant (step 2), the consstency check cost depends lnearly on the number of polyhedron vertces, but not on the varable domans. Thus, the temporal cost s O(n 3 ). Fnally, the actualsaton cost (step 3) depends on the number of varables O(n 3 ). Thus, the temporal cost s: O( n ) + k O( n ) + O( n ) O( k n. ( ) )

11 5. Evaluaton of the Polyhedron Search Algorthm In ths secton, we compare the performance of POLYSA wth some of the more current CSP solvers. We have selected Forward-checkng (FC) and Real Full Lookahead (RFLA) 1 because they are the most approprate technques that can manage ths problem typology. To evaluate ths performance, the computer used for the tests was a PIII-800 wth 128 Mb. of memory and Wndows NT operatng system. The problems generated to evaluate the performance depended on four parameters <v,c,c,d>, where v was the number of varables, c the number of ( ) constrants, c the number of ( ) constrants and d the length of the varable domans. The problems were randomly generated by modfyng the parameters and the c and c constrants were constrants of type (1) and (2), respectvely, wth the coeffcents p 0. Thus, each of the graphs shown sets three parameters and vares the other n order to evaluate the algorthm performance when ths parameter ncreases. We tested 100 test cases for each problem and the value of the varable parameter, and we present the mean CPU tme for each of the technques. Followng, four sets of graphs are shown. (Fgures 7,8,9,10) correspondng to the four sgnfcant parameters. Each set summarses the algorthm behavour from two dfferent perspectves. (a) Mean CPU tme for each technque. It must be taken nto account that the unsolved problems were assgned a 200-second run-tme Thus, ths graph contans a horzontal asymptote n tme=200. (b) Number of unsolved problems. That s, those problems that were not solved n 200 seconds and problems that dd not obtan the desred soluton. In Fg.7, the number of ( ) and ( ) constrants and doman length were set <v,6,20,2000>, and the number of varables was ncreased from 3 to 13. Mean CPU tme n problems <v,6,20,2000> Number of unsolved problems FC RFLA POLYSA FC RFLA POLYSA Number of varables Number of Varables Fg. 7. Temporal Cost n problems <v,6,20,2000>. 1 Forward-checkng and Real Full Look-ahead were obtaned from CON'FLEX, that s a C++ solver that can handle constrant problems wth nterval varables. It can be found n:

12 The graph shows a global vew of the behavour of the algorthms. The mean CPU tme n FC and RFLA ncreased exponentally wth the number of varables. POLYSA only ncreased ts temporal complexty polynomally. When the unsolved problems were set to tme=200, and the others mantaned ther real tme cost, we observed that FC was worse than RFLA. However, as the number of varables ncreased, POLYSA had a better behavour. The number of unsolved problems ncreased n FC and RFLA. POLYSA was able to solve all problem satsfactorly. In Fg.8 the number of varables, the number of ( ) constrants and the doman length were set <15, c, 40, 2000>, and the number of random ( ) constrants ranged from 2 to 10. Mean CPU tme n problems <15,c,40,2000> Number of unsolved problems Number of nequatonal constrants FC RFLA POLYSA FC RFLA POLYSA Number of nequatonal constrants Fg. 8. Temporal Cost n problems <15, c, 40, 2000> The graph shows that the mean CPU tmes n FC and RFLA ncreased exponentally and were near the horzontal asymptote for problems wth 10 ( ) constrant, however, RFLA had a better behavour than FC. POLYSA only ncreased ts temporal complexty polynomal, but when the number of constrants ncreased, the probablty of falure also ncreased. The number of unsolved problems ncreased n FC and RFLA much more than n POLYSA, whch was unable to solve only 10% of the problems wth 10 ( ) constrants. In Fg.9, the number of varables, the number of ( ) constrants and doman length were set <15, 6, c, 2000>, and the number of random ( ) constrants ranged from 10 to Mean CPU tme n problems <15,6,c,2000> Number of unsolved problems Number of dsequatonal constrants FC RFLA POLYSA FC RFLA POLYSA Number of dsequatonal constrants Fg.9. Temporal Cost n problems <15, 6, c, 2000>

13 The graph shows that the behavor of FC and RFLA got worse when the number of ( ) constrants ncreased. POLYSA dd not ncrease ts temporal complexty due to the fact that t carred out the consstency check of the ( ) constrants n lnear complexty. The number of unsolved problems was very hgh for both FC and RFLA, whle POLYSA had a good behavor. In Fg.10 the number of varables and the number of random constrants were set <15, 6, 40, d>, and the doman length was ncreased from 50 to Mean CPU tme n problems <15,6,40,d> Number of unsolved problems FC RFLA POLYSA FC RFLA POLYSA Doman length Doman Length Fg. 10. Temporal Cost n problems <15, 6, 40, d>. The graph shows that the behavor of FC and RFLA got worse when the doman length ncreased. POLYSA had a constant temporal complexty because ths complexty s ndependent from the doman length. The number of unsolved problems was very hgh for both FC and RFLA, whle POLYSA had a good behavor. 6. Conclusons and Future Works In ths paper, we have proposed an algorthm called POLYSA as an ncremental and non-bnary CSP solver. Ths proposal carres out the consstency study through a polyhedron that mantans n ts vertces, those values that satsfy all metrc temporal constrants. Thus, solutons to CSP are all vertces and all convex combnatons between any two vertces that satsfy the dsequatonal constrants. The computatonal cost depends polynomal on the number of varables, whle other approaches depend exponentally on the number of varables, the number of constrants and the doman sze. Because of the low temporal cost, an unsolved problem can be run several tmes to reduce the probablty of POLYSA falng. Ths technque s carred out by varyng the selected vertces that compose the polyhedron. Currently, we are workng on more complete heurstcs n order to decrease the probablty of unsolved problems. We are workng on dsjunctve and non-bnary

14 constrant satsfacton problems to be modelled as dstrbuted and ncremental CSP solvers. These proposals would work on a polyhedron whose vertces are also polyhedra, and the dsjunctve and non-bnary CSPs are solved by means of metaheurstc technques. Also t s approprate to generate algorthms to be confgured dynamcally dependng on user nputs. Ths proposal wll be composed of HSA as a complete algorthm, helped by heurstcs lke POLYSA and NFHH [13]. Thus, when the user nsert the problem parameters, ths proposal wll study these parameters and wll apply the most sutable algorthm. References 1. Bacchus F., van Beek P.: On the converson between non-bnary and bnary constrant satsfacton problems. In proceedng of AAAI-98, (1998) Bessère C., Meseguer P., Freuder E.C., Larrosa J.: On Forward Checkng for Non-bnary Constrant Satsfacton. In Proc. Prncples and Practce of Constrant Programmng (CP- 99), (1999) Bessère C.: Non-Bnary Constrants. In Proc. Prncples and Practce of Constrant Programmng (CP-99), (1999) Dechter, R., Mer, I., Pearl, J.: Temporal Constrant Network, Artfcal Intellgence 49, (1991) Gerevn A., Schubert L., Schaeffer S.: Temporal Reasonng n Tme Graph I-II, SIGART Bull 4 (3) (1993) Kautz H., Ladkn P.: Integratng metrc and temporal qualtatve temporal reasonng. In Proc. 9 th Natonal Conference Artfcal Intellgence (AAAI-91), (1991) Koubaraks M.: Dense tme and temporal constrants wth. In Proc. 3 rd Internatonal Conference on Prncples of Knowledge Representaton and Reasonng (KR-92), (1992) Larrosa J.: Algorthms and Heurstcs for total and partal Constrant Satsfacton, Phd Dssertaton, Barcelona, Span, Mer I.: Combnng qualtatve and quanttatve constrants n temporal reasonng. Artfcal Intellgence 87 (1996) Ross F., Petre C., Dhar V.: On the equvalence of constrant satsfacton problems. In proceedng of European Conference of Artfcal Intellgence, ECAI-90, (1990) Saldo M. A., Gret A., Barber F.: Constrant Satsfacton by means of Dynamc Polyhedra. In Operatons Research Proceedng (OR2001), (2001) 12. Saldo M.A., Barber F.: An Incremental and Non-bnary CSP Solver: The Hyperpolyhedron Search Algorthm. In Proceedngs of Seventh Internatonal Conference on Prncples and Practce of Constrant Programmng, (CP2001), Saldo M. A., Gret A., Barber F.: A combnaton of AI and OR methods for solvng Nonbnary Constrant Satsfacton problems. In Proceedngs of Jont German/Austran Conference on Artfcal Intellgence (KI-2001) Workshop on New Results n Plannng, Schedulng and Desgn (PUK2001). 2001

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

1 Approximation Algorithms

1 Approximation Algorithms CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

An MILP model for planning of batch plants operating in a campaign-mode

An MILP model for planning of batch plants operating in a campaign-mode An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing

Compiling for Parallelism & Locality. Dependence Testing in General. Algorithms for Solving the Dependence Problem. Dependence Testing Complng for Parallelsm & Localty Dependence Testng n General Assgnments Deadlne for proect 4 extended to Dec 1 Last tme Data dependences and loops Today Fnsh data dependence analyss for loops General code

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

greatest common divisor

greatest common divisor 4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Conferencing protocols and Petri net analysis

Conferencing protocols and Petri net analysis Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre

More information

Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems

Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems Miguel A. Salido, Federico Barber Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia Camino

More information

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems

Joint Scheduling of Processing and Shuffle Phases in MapReduce Systems Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, Alcatel-Lucent

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

6. EIGENVALUES AND EIGENVECTORS 3 = 3 2

6. EIGENVALUES AND EIGENVECTORS 3 = 3 2 EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a non-zero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :

More information

EE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN

EE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN EE201 Crcut Theory I 2015 Sprng Dr. Yılmaz KALKAN 1. Basc Concepts (Chapter 1 of Nlsson - 3 Hrs.) Introducton, Current and Voltage, Power and Energy 2. Basc Laws (Chapter 2&3 of Nlsson - 6 Hrs.) Voltage

More information

Communication Networks II Contents

Communication Networks II Contents 8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

QUANTUM MECHANICS, BRAS AND KETS

QUANTUM MECHANICS, BRAS AND KETS PH575 SPRING QUANTUM MECHANICS, BRAS AND KETS The followng summares the man relatons and defntons from quantum mechancs that we wll be usng. State of a phscal sstem: The state of a phscal sstem s represented

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

Availability-Based Path Selection and Network Vulnerability Assessment

Availability-Based Path Selection and Network Vulnerability Assessment Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl

More information

We are now ready to answer the question: What are the possible cardinalities for finite fields?

We are now ready to answer the question: What are the possible cardinalities for finite fields? Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

More information

Maintenance Scheduling by using the Bi-Criterion Algorithm of Preferential Anti-Pheromone

Maintenance Scheduling by using the Bi-Criterion Algorithm of Preferential Anti-Pheromone Leonardo ournal of Scences ISSN 583-0233 Issue 2, anuary-une 2008 p. 43-64 Mantenance Schedulng by usng the B-Crteron Algorthm of Preferental Ant-Pheromone Trantafyllos MYTAKIDIS and Arstds VLACHOS Department

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

More information

Period and Deadline Selection for Schedulability in Real-Time Systems

Period and Deadline Selection for Schedulability in Real-Time Systems Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

IMPACT ANALYSIS OF A CELLULAR PHONE 4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008 Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn

More information

Ring structure of splines on triangulations

Ring structure of splines on triangulations www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

Loop Parallelization

Loop Parallelization - - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze

More information

2.4 Bivariate distributions

2.4 Bivariate distributions page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together

More information

Inter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007.

Inter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. Inter-Ing 2007 INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. UNCERTAINTY REGION SIMULATION FOR A SERIAL ROBOT STRUCTURE MARIUS SEBASTIAN

More information

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Ants Can Schedule Software Projects

Ants Can Schedule Software Projects Ants Can Schedule Software Proects Broderck Crawford 1,2, Rcardo Soto 1,3, Frankln Johnson 4, and Erc Monfroy 5 1 Pontfca Unversdad Católca de Valparaíso, Chle FrstName.Name@ucv.cl 2 Unversdad Fns Terrae,

More information

Activity Scheduling for Cost-Time Investment Optimization in Project Management

Activity Scheduling for Cost-Time Investment Optimization in Project Management PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng

More information

A machine vision approach for detecting and inspecting circular parts

A machine vision approach for detecting and inspecting circular parts A machne vson approach for detectng and nspectng crcular parts Du-Mng Tsa Machne Vson Lab. Department of Industral Engneerng and Management Yuan-Ze Unversty, Chung-L, Tawan, R.O.C. E-mal: edmtsa@saturn.yzu.edu.tw

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

Software project management with GAs

Software project management with GAs Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de

More information

SOLVING CARDINALITY CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM BY BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM

SOLVING CARDINALITY CONSTRAINED PORTFOLIO OPTIMIZATION PROBLEM BY BINARY PARTICLE SWARM OPTIMIZATION ALGORITHM SOLVIG CARDIALITY COSTRAIED PORTFOLIO OPTIMIZATIO PROBLEM BY BIARY PARTICLE SWARM OPTIMIZATIO ALGORITHM Aleš Kresta Klíčová slova: optmalzace portfola, bnární algortmus rojení částc Key words: portfolo

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center

More information

Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6) Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Solutions to the exam in SF2862, June 2009

Solutions to the exam in SF2862, June 2009 Solutons to the exam n SF86, June 009 Exercse 1. Ths s a determnstc perodc-revew nventory model. Let n = the number of consdered wees,.e. n = 4 n ths exercse, and r = the demand at wee,.e. r 1 = r = r

More information

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

More information

Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization

Research Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy

More information

Optimization of network mesh topologies and link capacities for congestion relief

Optimization of network mesh topologies and link capacities for congestion relief Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Nonlinear data mapping by neural networks

Nonlinear data mapping by neural networks Nonlnear data mappng by neural networks R.P.W. Dun Delft Unversty of Technology, Netherlands Abstract A revew s gven of the use of neural networks for nonlnear mappng of hgh dmensonal data on lower dmensonal

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process

Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer

More information

A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers

A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers Ž. The Journal of Supercomputng, 15, 25 49 2000 2000 Kluwer Academc Publshers. Manufactured n The Netherlands. A Prefx Code Matchng Parallel Load-Balancng Method for Soluton-Adaptve Unstructured Fnte Element

More information

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

More information

Dynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network

Dynamic Constrained Economic/Emission Dispatch Scheduling Using Neural Network Dynamc Constraned Economc/Emsson Dspatch Schedulng Usng Neural Network Fard BENHAMIDA 1, Rachd BELHACHEM 1 1 Department of Electrcal Engneerng, IRECOM Laboratory, Unversty of Djllal Labes, 220 00, Sd Bel

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

Examensarbete. Rotating Workforce Scheduling. Caroline Granfeldt

Examensarbete. Rotating Workforce Scheduling. Caroline Granfeldt Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analysis of View Maintenance Techniques for Data Warehouses A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet

2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet 2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B-1348 Louvan-la-Neuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 E-mal: corestat-lbrary@uclouvan.be

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

A DATA MINING APPLICATION IN A STUDENT DATABASE JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul

More information

An efficient constraint handling methodology for multi-objective evolutionary algorithms

An efficient constraint handling methodology for multi-objective evolutionary algorithms Rev. Fac. Ing. Unv. Antoqua N. 49. pp. 141-150. Septembre, 009 An effcent constrant handlng methodology for mult-objectve evolutonary algorthms Una metodología efcente para manejo de restrccones en algortmos

More information

INSTITUT FÜR INFORMATIK

INSTITUT FÜR INFORMATIK INSTITUT FÜR INFORMATIK Schedulng jobs on unform processors revsted Klaus Jansen Chrstna Robene Bercht Nr. 1109 November 2011 ISSN 2192-6247 CHRISTIAN-ALBRECHTS-UNIVERSITÄT ZU KIEL Insttut für Informat

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

Business Process Improvement using Multi-objective Optimisation K. Vergidis 1, A. Tiwari 1 and B. Majeed 2

Business Process Improvement using Multi-objective Optimisation K. Vergidis 1, A. Tiwari 1 and B. Majeed 2 Busness Process Improvement usng Mult-objectve Optmsaton K. Vergds 1, A. Twar 1 and B. Majeed 2 1 Manufacturng Department, School of Industral and Manufacturng Scence, Cranfeld Unversty, Cranfeld, MK43

More information

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy 4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Solving Factored MDPs with Continuous and Discrete Variables

Solving Factored MDPs with Continuous and Discrete Variables Solvng Factored MPs wth Contnuous and screte Varables Carlos Guestrn Berkeley Research Center Intel Corporaton Mlos Hauskrecht epartment of Computer Scence Unversty of Pttsburgh Branslav Kveton Intellgent

More information

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems

An Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part

More information

Lecture 7 March 20, 2002

Lecture 7 March 20, 2002 MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

More information

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l

More information

A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION

A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION A GENERAL APPROACH FOR SECURITY MONITORING AND PREVENTIVE CONTROL OF NETWORKS WITH LARGE WIND POWER PRODUCTION Helena Vasconcelos INESC Porto hvasconcelos@nescportopt J N Fdalgo INESC Porto and FEUP jfdalgo@nescportopt

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

More information

A Constraint Model for Automated Deployment of Automotive Control Software

A Constraint Model for Automated Deployment of Automotive Control Software A Constrant Model for Automated Deployment of Automotve Control Software Mha Nca Bernhard Peschl Franz Wotawa Insttute for Software Technology Graz Unversty of Technology 8010 Graz, Austra {mnca,bpeschl,wotawa}@st.tugraz.at

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

DISTRIBUTED storage systems have been becoming increasingly

DISTRIBUTED storage systems have been becoming increasingly 268 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 28, NO. 2, FEBRUARY 2010 Cooperatve Recovery of Dstrbuted Storage Systems from Multple Losses wth Network Codng Yuchong Hu, Ynlong Xu, Xaozhao

More information

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION

More information

Formulating & Solving Integer Problems Chapter 11 289

Formulating & Solving Integer Problems Chapter 11 289 Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika. VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence

How Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence 1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh

More information

General Auction Mechanism for Search Advertising

General Auction Mechanism for Search Advertising General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an

More information

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH ESTABLISHIG TRADE-OFFS BETWEE SUSTAIED AD MOMETARY RELIABILITY IDICES I ELECTRIC DISTRIBUTIO PROTECTIO DESIG: A GOAL PROGRAMMIG APPROACH Gustavo D. Ferrera, Arturo S. Bretas, Maro O. Olvera Federal Unversty

More information

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1 Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,

More information