Size: px
Start display at page:



1 VIII SIMPÓSIO DE ESPECIALISTAS EM PLANEJAMENTO DA OPERAÇÃO E EXPANSÃO ELÉTRICA VIII SEPOPE 9 a 3 de mao de May, 9 th to 3 rd Brasíla (DF) Brasl VIII SYMPOSIUM OF SPECIALISTS IN ELECTRIC OPERATIONAL AND EXPANSION PLANNING IP 7 Applcaton of Parallel Programmng for Desgn of Concrete Encased Groundng Electrode S. VISACRO F.* M. H. M. VALE M. A. S. BIRCHAL LATER - Groundng and Interference Lab. LPAD - Hgh Performance Processng Lab. LRC Lghtnng Research Center UFMG - Federal Unversty of Mnas Geras - Brazl SUMMARY Ths work presents a study of the possbltes for applcaton of parallel processng to the desgn of groundng systems, comprsng concrete encased electrodes. It shows the present state of the studes that are beng carred out at LRC, concernng concrete encased electrode problem. Prevously, a groundng model had been developed and mplemented wth sequental programmng paradgm. The natural parallelsm of the nvolved tasks and the large tmeconsumng characterstc of sequental processng for ths knd of applcaton justfy the use of hgh performance computaton. Ths work shows the advantages of explorng parallel processng possbltes for generaton of a geometrc coeffcent matrx, whch descrbes the basc relatons among currents and potentals at the groundng system. Dfferent software mplementaton possbltes are evaluated for a parallel program approach to solve the concrete encased electrode problem. KEYWORDS Parallel Processng, Hgh Performance Processng, Concrete Encased Groundng Electrodes, Parallel Programmng Groundng Desgn Tool.. INTRODUCTION The applcaton of hgh performance programmng technques for soluton of Electrc Power Systems problems has been ncreasng. Partcularly, parallel processng presents very promsng perspectves when heavy computaton s requred. It may consst n a feasble alternatve for soluton of several large-scale problems, whch are not well condtoned for a sequental approach. Despte ts potentalty n engneerng software development, parallel algorthm phlosophy s qute dfferent from that adopted by sequental programs. Ths pcture has been motvatng the authors to research parallel algorthms for Electrcal Engneerng applcaton n LPAD Laboratory, UFMG. Also, a specfc tool for parallel software mplementaton (CPAR) s beng developed n USP. Ths work presents nvestgatons regardng the applcaton of parallel processng to the Desgn of Concrete Encased Groundng Electrodes. The large scale computatonal effort requred for calculatons and the nherent parallelsm of the desgn tasks for ths specfc problem have justfed such research. Regardng parallel processng, groundng desgn allows dfferent approaches, whch are beng evaluated by the authors. Some of them are dscussed n ths text. Ths work s specfcally dedcated to mprove the performance of the tasks nvolved n the calculaton of a large dmenson (or order) matrx, correspondng to a lnear system of equatons. Ths matrx, provded by the model, descrbes the basc relatons among currents and potentals of the groundng system elements.. CONCRETE ENCASED ELECTRODES Groundng system s an mportant element of electrcal systems. In a very smplfed way, ts basc functon could be consdered to provde a conductve connecton between electrcal plant and sol. Such system s bascally composed by three components: () groundng electrodes (any metallc body bured n sol), () cables and connectons (whch provde electrcal contnuty between electrodes and electrcal plant) and (3) surroundng sol (element where current derved from electrcal plant s dspersed) []. * Lghtnng Research Center, Federal Unversty of Mnas Geras (UFMG), Av. Antôno Carlos Pampulha Belo Horzonte - MG - Brazl - phone/fax:

2 Durng several years, the metallc parts of hydraulc systems were employed as an alternatve groundng system. Ths practce was consdered to be a worthwhle complementary soluton for reducng the groundng mpedance of ndustral and resdental electrcal plants. Several years ago, around the 6's, a strong trend has begun for substtuton of metallc components of hydraulc systems by nsulatng materal (PVC). Snce then, the prevous practce was almost vanshed and new solutons were needed for assurng mprovement of groundng system performance. Ths has justfed the present practce of connectng earthng termnatons to metallc components of re-nforced concrete, whch may be present n buldng foundatons. Such system s commonly called "concrete encased groundng electrodes". Though such practce seems to be very effcent for several applcatons, the quanttatve evaluaton of groundng performance for ths knd of system s not a smple task. The electrode s encased nto concrete and, so, there s a non-drect contact among electrodes and sol, provded by concrete envelope. The low resstvty and hygroscopc propertes of ths materal may sgnfcantly nfluence groundng behavor. The correspondng confguraton (Fgure ) presents certan complextes, usually assocated to the presence of three dfferent materals (conductor, concrete and sol) and to ts usual non-regular geometry. Estrutura Metalc Structure Metálca 3. PROBLEM MODELING AND FORMULATION Fgure llustrates the basc elements nvolved n modelng concrete encased electrodes: a rectangular concrete block bured n horzontal poston n the sol and comprsng a cylndrcal electrode nsde t. The flow of electrc current nto the sol through the conductve electrode establshes an electrc feld n the regon nsde the concrete block and n ts vcntes. The computaton of such feld may be performed, consderng Smlarty Prncple, by means of equvalent surface elements of electrc charge (correspondng to current elements) postoned at electrode surface. The presence of ar (sem-nfnte nature of sol) may be taken nto account by means of a block mage (ncludng electrode). The dscontnuty sol-concrete may be consdered by postonng other equvalent surface elements of electrc charge at the concrete boundary. heght ε y z x r A coel hblo ρ c length ρ s sol A Solo Sol Neutral Conductor Condutor Neutro (Loop) (Loop) Junção Metalc metálca forced forçada jon Re-nforced Ferragem do steel concreto bars Concrete foundaton foot wdth Fgure - Basc Groundng Confguraton Equaton (E.) ndcates the Electrc Potental V (n reference to a remote dstance), whch s establshed by the current flow to the sol through electrode. ηs = = ds (E.) V V r r. 4πε S In the prevous ntegraton, S represents all the surfaces that contan charge elements (electrode surface + concrete-sol nterface), r s the poston of any pont over S, whose charge densty s η s, and r s the poston of any pont at electrode surface. Due to Current Contnuty Prncple, the followng relaton s observed at the boundary surfaces between concrete block and sol: J = J E = ( E, (E.) ns nc ns ρ s ρ c ) nc Fgure - Concrete Encased Groundng Confguraton Ths pcture has stmulated the authors to nvestgate and to develop a computatonal tool, whch should be able to perform the necessary calculatons for such knd of groundng desgn. The confguraton of the problem, wth the conductor and concrete surface lmtng borders, suggested the employment of the boundary element approach to model groundng system. where: J ns s the normal component of current densty n the sol, J nc s the normal component n the concrete, Ens and E nc are the correspondng electrc feld ntensty and ρ S e ρ C are respectvely sol and concrete resstvtes. On the other hand, the followng boundary condton s observed at the nterface between sol and concrete:

3 Dns D nc = ηs, (E.3) where: Dns s the electrc dsplacement n sol, D nc the electrc dsplacement n concrete regon and η s s surface charge densty at pont r, whch s placed at the boundary surface. If electrc dsplacement s substtuted by electrc feld and current contnuty s observed, t follows; ρ s ρ s ε ( Ens Enc) = ηs ; ε Enc Enc ηs ; ε Enc = ηs ; ρ = c ρ c r r r (E.4) ρ s η s ( ) n ε ds = η s ρ r r. 3 (E.5) c 4πε S So, the desgn problem s bascally descrbed by (E.4) and (E.5). The soluton conssts on determnng the functon η s, whch satsfes these equatons. From the determned soluton, the electrc feld ntensty at electrode surface s then calculated. The current densty s obtaned from the rato between such electrc feld value and concrete resstvty. So, the current that flows to the sol s determned when current denstes are ntegrated all over the electrode surface. The groundng resstance s calculated drectly from the rato between the known electrode potental and current values. Besdes that, the same equaton (E.) may be employed for calculatng the potental for ponts over sol surface. 3. Current Source The current that flows through electrodes towards sol determnes an electrc feld dstrbuton n both regons, sol and concrete block. Ths results n the establshment of an electrc potental over the electrodes (n reference to a remote dstance). In order to calculate such potental, the current that flows along all the electrode surface s approxmated by lnear source of currents supposed to be placed at electrode axs (n A/m). These are the problem ndependent varables. In the developed approach, the lnear current sources are substtuted by surface charge sources (n C/m ). As advantage, nstead of consderng nfnte lnear sources of current, such substtuton drastcally reduces the number of mages, whch are needed to take nto account the presence of concrete and sol. Only one mage s needed to consder the ar presence. On the other hand, each nterface (boundary between dfferent meda except sol-ar) requres to be modeled by addtonal surface charges (n ths case the nterface concrete-sol). A lnear current source, wth length L and current densty I L (A/m), s placed at the axs of an electrode wth same length L and radus r. Ths source generates a current densty at electrode surface ( I L /πr A/m ). The normal component of electrc feld ntensty at such surface s gven by E n =ρci L /πr. As η s = ε E n, the lnear current densty I L may be calculated from ηs by the followng expresson: πr IL = ηs (E.6) ρcε. (I L and η s are consdered constant along electrode segment extent). The electrode s supposed to be composed by adjacent segments, each one wth an ndependent attrbuted I L value. Ths allows the nonunform dstrbuton of current along the electrode length. 3. System of Lnear Equatons The charge surface whch s represented by S n (E.) and (E.5) s dvded nto small charge surfaces S, each one of them wth an assocated value for η s. The electrc potental on the S element may be determned as the sum of contrbutons due to all small ndvdual charge surfaces. ηs ds ηs ds ηs ds n V = r r + r r S S r r 4πε 4πε Sn 4πε (E.7) V = η V s ds r r + η πε s S 4 S s s ds r r η 4πε = η A + η A η sn sn S n n ds r r 4πε If the same dscretzaton s taken nto account, but for the boundary condton expressed by (E.4), t follows: η s = η s... + η... + η ρ ( ) ( r ) s r s s n A η s ρ c S ρ ( ) ( r ) s r ρ c ρ ( ) ( r ) s rn ρ c n r r r n r r ds π r r r n r r ds (E.) S 4π r r r n r r ds ; 3 4π S n n ( A ) η s + + An η sn = When these equatons are appled for each element of S, t s possble to compose a system of lnear equatons, expressed by (E.). The soluton of such system provdes the charge densty values (and correspondng current densty values) and, therefore, the groundng resstance and potental dstrbuton over sol surface. V A A A n η V A V n = An A A n A n ( A ) nn (E.8) n A (E.9) (E.) η (E.)... η n 4. EXPLORING PARALLEL PROPERTIES The man goal of modelng concrete encased electrodes conssts n determnng the Resstance of groundng confguraton and also the dstrbuton of Electrc Potental over sol surface, durng the eventual flow of current through the electrodes. In order to determne both of them, the model should calculate, as ntermedate varables, the leakage current of each metallc segment or steel bar (current spread nto 3

4 concrete by them) and the current, whch flows from concrete surface. In the algorthmc form, the groundng desgn nvolves the soluton of a set of lnear equaton, such as: Ax = b (E.3) where, x: Charge Densty Vector (η ); A: Charge Coeffcent Matrx, determned by eq. (E.); b: Vector of the Electrode Electrc Potental (V). Usually, groundng desgn nvolves the analyss of dfferent prelmnary confguratons. For each one of them, a system of lnear equatons such as (E.3) s composed and solved. Groundng resstance and potental dstrbuton over sol surface are found n each case. These parameters are employed for analyzng the performance of each confguraton and for determnng ts mprovement for achevng an optmzed soluton. Fgure 3 shows the flowchart wth the basc steps for groundng desgn, whch was employed n ths work. Begn New Confguraton Matrx A Constructon Ax=b Soluton V ks and R Calculaton Groundng Analyss Yes Change Confguraton? V rs : Potental over sol surface R: Groundng resstance No Fnal Desgn End Fgure 3 Flowchart: Steps of Desgn Procedure It s mmedately dentfed the possblty of applyng parallel processng n two stages of the desgn procedure: (a) Composton of matrx A (ncludng calculaton of ts elements); (b) Soluton of the lnear system Ax=b. Both possbltes are compatble and may be explored smultaneously. A program can work n parallel wth the matrx A calculaton, once ths stage represents a most sgnfcant challenge. Also, such applcaton presents a remarkable parallelsm for procedural tasks, whch are very tme-consumng for sequental algorthm verson. Concernng such parallelsm, all matrx elements may be ndependently calculated. Matrx A s a full matrx and, due to the complexty of expressons employed for determnng each one of ts elements, the calculaton s not trval and the sequental procedure s very tme-consumng. 5. PRELIMINARY RESEARCH The LATER s research related wth concrete encased groundng electrodes led to the development of a sequental program for the calculaton of groundng resstance and potentals over sol surface. Such potentals are establshed durng current flow through groundng electrodes due to any abnormal electrc system condton (shortcrcut etc). Such program [3] demonstrated the possblty of the numerc algorthms mplementaton for desgn and calculatons of the encased groundng electrodes. However, the tmng nvolved on the calculaton, encourage the searchng of parallel possbltes that could provde better performances. Later, one frst parallel mplementaton was developed [4], for the problem, as a result of a cooperaton among the teams of LATER, LPAD and USP. In such verson, the buld of the load coeffcents matrx was parallelzed. Ths s a very computng resource consumng phase. To perform ths parallelzaton, the orgnal C++ sequental code was ported to the Cpar language [5]. Ths s a parallel verson of the C language, that extents the C language and mplements the parallel program paradgm wth shared varables. The frst results [4] are transcrbed to the table. They demonstrate that the use of parallelsm s really able to ncrease the calculaton performance, meanngfully, when comparng the parallel and the sequental results. Ths gan s observed through the Speedup analyss, S (E.4), that s the relaton between the sequental and the parallel executon tmes [6]. sequental tme executon Speedup = (E.4) parallel tme executon These prelmnary results have motvated the authors for further developments ntend to enhance the groundng model performance. The reducton of tme processng could make t feasble the model applcaton for very complex groundng confguratons, n concrete encased groundng electrode problems. Table - Speedup Analyss A sze Sequental proc. 3 proc. 4 proc. 5 T=65 T=33 S=,97 T=4 S=,75 T= S=,95 T=63 T=8 S=,99 T=57 S=,83 T=53 S=3,8 T=658 T=33 S=,99 T=9 S=,87 T=7 S=3,8 3 T= 85 T=563 S=,9 T=39 S=,78 T=34 S=3,9 5 T=5 55 T=4349 S=3,57 T: Processng tme (s) S: Speedup 4

5 6. CONSIDERING NEW POSSIBILITIES The development strategy of a parallel computatonal tool nvolves the analyss of nnumerous aspects. Before startng parallel algorthms concepton t s extremely mportant to decde about the computatonal envronment, n a consstent way (parallel hardware archtecture, programmng language, message passng lbrares etc.). The parallel programmng can be mplemented n clusters of workstatons or mcrocomputers and, also, n supercomputers (dedcated to numerc processng). In the frst case, local area networks (LANs) are used, n addton to software, whch s responsble for communcaton of dstrbuted process among the varous network machnes. In second case, dedcated computers, wth several processors, are used. The processors are nterconnected by hgh speed nternal busses, that promote communcaton among the dstrbuted processes. Though clusters, also known as Parallel Vrtual Machnes, are much less faster then supercomputers, ther cost s sgnfcantly lower. Yet, they can provde very sgnfcant speedups. Up to the moment, the researches carred out n LRC use very specal parallel hardware archtecture facltes: a Parallel Vrtual Machne (composed by a cluster of mcrocomputers, n LPAD) and two dfferent parallel machnes n CENAPAD (Brazlan Hgh Performance Computaton Center, at Unversty Campus). These parallel machnes correspond to a shared (3 processors) and a dstrbuted (48 processors) memory archtectures. There are many lbrares to extend conventonal programmng languages for applcaton of parallel programmng paradgm n the soluton of numercal problems that demand great computatonal effort. The choce depends on the avalable archtectures and how the dstrbuton software wll be. Although Cpar language utlzaton had shown to be promsng, the evaluaton of other alternatves was consdered, n a more accessble code portablty perspectve. The use of well known languages s able to make easer the software producton process and to short the tme delay for upgrade and new verson. In many cases, one can develop suffcent portable software that can be executed n clusters and also n supercomputers, dependng only on source-code complaton. In ths paper, the authors nvestgaton regardng groundng parallel computaton concerns the selecton of the best adequate parallel envronment to be adopted. In ths way, dfferent development platform characterstcs are beng analyzed, as descrbed bellow. 6. PVM PVM (Parallel Vrtual Machne) [7] s a lbrary of functons that mplements means of message passng over a heterogeneous computer network. It creates a parallel vrtual machne, whch s able to execute parallel programs over a dstrbuted envronment. PVM extents C or Fortran functon set, addng parallel facltes. PVM can be executed over many dfferent archtectures, from mcrocomputer to supercomputers. Ths feature turns t a very portable opton. It s a de facto standard, as t sn t a real one n the strct meanng of the term, but t s mantaned by the PVM group. It s an open software and ts present verson (3.4) may be drectly obtaned from Internet. PVM has obtaned satsfactory performance n ts mplementatons and has been known as one of the good optons among the parallel exstent possbltes. 6. MPI MPI (Message-passng Interface) [8] s a message passng standard nterface. It s developed as an effort for standardzaton of message passng possbltes. There are many dfferent mplementatons of the MPI functons, whch have mplemented the MPI standard partally or totally. Some of these mplementatons are MPICH, WMPI and LAM. 6.3 WMPI Ths MPI mplementaton was developed n 988 and follows the MPI.. standard. It s based on MPICH, another MPI mplementaton, extendng t wth some new functons. WMPI was developed for Wn3 platform, beng very consstent under ths. It can be a good choce when workng wth Wndows, but can t be easly ported to other operatonal systems. It means that, to mantan code portablty, only standard C or Fortran languages may be used, n order to make code recomplaton possble on other systems that run some other knd of the MPI mplementatons. 6.4 MPICH MPICH s an open and free MPI mplementaton. It totally contemplates the MPI. standard and partally, the MPI.. MPICH can be executed n Wndows and n Lnux, over a large range of hardware archtectures, supercomputers ncluded. These facts turn MPICH nto a very versatle MPI opton. As usual, code can be wrtten n C or Fortran. MPICH s one of the most promsng MPI standard mplementatons, due to ts portng capabltes. It s, by now, one of the better optons that can be found when mplementng software n MPI. 6.5 LAM LAM (Local Area Multcomputer) s a programmng envronment of parallel applcatons under Unx local network. It s an open and free MPI mplementaton and can be executed over heterogeneous Unx networks. Ths fact excludes the LAM s use under Wndows and sometmes makes ts use no attractve. 6.6 JAVA Java s one of most recent and promsng of the new generaton languages. It s based on C and C++, 5

6 extendng these languages wth new Internet programmng facltes [9]. Although Java has mult-thread and dstrbuted object RMI programmng capabltes, t doesn t turn t nto a parallel programmng language. In order to be consdered a parallel language, t must have a sharedmemory (or dstrbuted memory hgh level modelng) and some knd of explct nterprocess communcaton, lke message passng. Java doesn t have all these characterstcs. In ths sense, some MPI Java extensons ntended to mplement those facltes on the Java language (as they already exst over C and Fortran) have been developed. The most mportant of those tres s mpjava []. Ths MPI standard mplementaton over Java s very expressve n the sense of nsertng a new language on the MPI possbltes, leadng MPI beyond the Fortran and C possbltes. An aspect to be consdered on choosng Java as a programmng language s that t s not a compled one. Beng an nterpreted language, Java portablty s guaranteed. However, some processng speed problems are ncluded. Ths can be a determnant factor on choosng the rght language. Table shows a summary of some relevant aspects related to dfferent software mplementaton possbltes. Table - Comparson among Implementatons Language Compled Supercomputer Cluster Well know PVM Yes Yes Yes Yes MPI Yes Yes Yes Yes MpJava No No Yes No Java RMI No No Yes Yes Cpar Yes No Yes No The authors have large experence n parallel software mplementatons usng PVM and MPI, n LPAD and CENAPAD. Despte that, due to the aspect denoted n prevous table, each computatonal applcaton (as example, for calculaton of encased groundng electrode) deserves specfc evaluaton to defne the best computatonal approach. 7. CONCLUSION The use of parallel processng n groundng desgn s descrbed n ths work. Many aspects motvate authors nvestgatons n ths drecton: (a) sgnfcant experence regardng groundng and parallel processng applcatons; (b) large computatonal effort demanded by groundng desgn calculatons; (c) pecular degree of parallelsm of the nvolved tasks; (d) promsng results obtaned from the frst parallel mplementatons. Presently, the man concern for groundng desgn s to defne the best parallel platforms to be used for engneerng applcaton. The use of propretary archtecture resources tends to ncrease the applcaton performance, whereas decreasng the portablty of the software dstrbuton. MPI seems to be the adequate standard to be used, once t works on heterogeneous archtectures. Ths permts a software developed over clusters to be ported to supercomputers or dfferent knds of clusters, once the source-code complaton could be performed at the new machne. Among MPI standards, MPICH emerges as the best opton, once, presently, t s the most flexble of the MPI mplementatons. It s very portable and s avalable n many dfferent machne types. Up to ths moment Java, doesn t seem to be a good language choce to mplement MPI model, due to ts strong dependence of some knd of propretary MPI lbrary core (lke MPICH or WMPI). Once ths lbrary core exsts, t could be drectly used as the man tool for applcaton development. 8. BIBLIOGRAPHY [] S. F. Vsacro, Groundng and Earthng - Concepts, Instrumentaton and Measurement Technques, Groundng Phlosophy, Vol. (n Portuguese), Belo Horzonte: Alphagraphcs, 997, p. 6. [] S. F. Vsacro, H. A. Rbero, "Some Evaluatons Concernng the Performance of Concrete-encased Electrodes: an Approach by the Boundary Elements", Proceedngs of the 998 Internatonal Conference on Groundng and Earthng, Belo Horzonte, Brazl. [3] H. A. Rbero, Desenvolvmento de uma Ferramenta Computaconal para a Avalação do Desempenho de Aterramentos Elétrcos Encapsulados para Fenômenos de Baxa Freqüênca. M.SC Thess UFMG,. [4] M.H.M Vale, H. A. Rbero, S. F. Vsacro, L. M. Sato, "Parallel Processng Appled to Desgn of Concrete Encased Groundng Electrodes", Journal of Computer Scence and Technology, vol., no. 5, Outubro. [5] L. M. Sato, Ambentes de Programação para Sstemas Paralelos e Dstrbuídos. Tese de Lvre- Docênca EPUSP, 995. [6] J. L. Hennessy, D. A. Patterson, Computer Archtecture a Quanttatve Approach, nd Ed. San Francsco: Morgan Kaufmann,.996. [7] G. A. Gest et al., PVM: Parallel Vrtual Machne A User s Gude and Tutoral for Networked Computng. Cambrdge: MIT Press, 994, p. 8. [8] M. Snr et al. MPI: The Complete Reference. London: The MIT Press, 996, p [9] H. M. Detel, P. J. Detel, Java Como Programar. Bookman, São Paulo,. [] B. Carpenter, G. Fox, S. Koo, S. Lm, mpjava.: API Specfcaton, Northeast Parallel Archtectures Center Syracuse Unversty, New York,

7 VIII SEPOPE 9 a 3 de mao de May, 9 th to 3 rd Brasíla (DF) Brasl VIII SIMPÓSIO DE ESPECIALISTAS EM PLANEJAMENTO DA OPERAÇÃO E EXPANSÃO ELÉTRICA VIII SYMPOSIUM OF SPECIALISTS IN ELECTRIC OPERATIONAL AND EXPANSION PLANNING IP 8 OBJECT ORIENTED MATRIX STRUCTURE FOR THE DEVELOPMENT OF COMPUTING TOOLS IN ELECTRIC POWER SYSTEMS Marcelo Neujahr Agostn * Ildemar Cassana Decker * João Marco Francschett Ferrera * Agunaldo Slvera e Slva ** * LabPlan ** Labspot Department of Electrcal Engneerng Federal Unversty of Santa Catarna - UFSC, SC, Brazl Abstract: In ths work a class structure for the representaton of large sparse matrces s presented. The structure characterstcs facltate operatons such as the access to matrx elements, basc operatons wth matrces and vectors and the soluton of lnear systems. The work s part of a comprehensve project that ams the development of an object orented structure to represent electrc power systems (EPS), allowng the ntegrated development of computng tools for the electrc utltes. The use and extenson of the proposed structure s facltated by the applcaton of the Objected Orented Desgn Patterns n ts development. The C++ language s used n the mplementaton and the portablty and generalty s enhanced by the use of templates and contaners of the Standard Template Lbrary (STL). For the soluton of lnear systems, the structure allows the use of several methods through ther encapsulaton as soluton strateges. In the paper several results concernng the soluton of large-scale lnear systems are presented. These results show that the proposed structure allows the use of lbrares and specalzed methods for the development of prototypes and computng tools for the electrcal ndustry wthout losng performance, whle preservng the objected orented paradgm. Keywords: Power System Modelng, Object Orented Modelng, Large Scale Sparse Lnear Systems.. INTRODUCTION The Brazlan electrc ndustry s n a transton from a vertcally ntegrated state-owned to a market-drven compettve structure, n the generaton and commercalzaton of the electrc energy. In ths new envronment, there s a demand for modern and relable computng tools for the system analyss and desgn, n whch the relevant techncal and economcal characterstcs can * LabPlan - UFSC, Campus Unverstáro, Trndade CEP 884-9, Floranópols, SC, Brasl E-mal: ** On leave at BIPS, Brunel Unversty, UK. be effcently represented n an ntegrated form. The fast changng scenaro faced by the electrc utltes as a result of the new envronment, new avalable equpments and technques must be contemplated n the update of these tools [],[]. Modern paradgms n software engneerng, such as Object Orented Modelng (OOM), can lead to a new approach n the development of software tools for the electrcal ndustry. The OOM ams the development of flexble software, easly mantanable, wth a hgh degree of reusablty, sutable to be developed by several people [3],[4]. As a consequence, an object orented structure, representng the characterstcs of an electrc power system (EPS), s adequate to respond to the heavy demands n terms of software n the modern electrc ndustry []. Such structure allows the ntegrated development of computatonal tools, a more agle mantenance and consequently cost reducton [5]. A large number of power system applcatons requre the repettve soluton of large-scale sparse lnear systems. Therefore, an effcent representaton and soluton of lnear systems, s of fundamental mportance n the development of computatonal tools for the electrcal ndustry [6]. As part of a major effort towards the development of a generc OOM of power systems, ths work proposes a modelng and mplementaton of a computatonal structure to deal wth matrces, facltatng the development of effcent object orented (OO) computng tools for the electrc ndustry. Ths s a basc but fundamental step to buld a class structure that wll allow the mplementaton of methods of analyss and synthess [],[5]. The proposed structure allows the effcent mplementaton of compact storage of sparse matrces and lnear system solutons. The class structure s flexble so as to put no restrctons to any method used for the soluton of the lnear system. The ncluson of new methods

8 s facltated by ther encapsulaton n classes, usng the desgn pattern Strategy. Ths ensures that a change n the method can be acheved n executon tme. Furthermore, basc operators such as matrx addton, subtracton, multplcaton and dvson, are overloaded for the proposed classes, makng easy ther use for sparse matrces. Hgh performance and well-tested specalzed lbrares, developed usng conventonal desgn technques, have been used by the electrc ndustry for a long tme. However ther concept may be ncompatble wth the OOM phlosophy. The proposed structure allows that these methods or lbrares be encapsulated as strateges, ensurng hgh performance n the soluton of large-scale sparse systems whle keepng the paradgm of the OO desgn. The operators () e [] are also overloaded makng the access to matrx elements transparent to the user. The structure kernel s mplemented n the C++ programmng language [7],[8], and all classes are mplemented as templates, ensurng ther utlzaton for any data type, such as real, complex, or user defned types (n x n matrx blocks, for nstance [9]). Contaners avalable n the Standard Template Lbrary (STL) are used for the storage of dfferent element types nsde the classes, ensurng an adequate computatonal performance and portablty of the software. The structure s desgned and mplemented usng concepts of OOM and the Unfed Modelng Language (UML). Desgn Patterns play a key role n the development of the structure, renforcng the features of reusablty, easy mantenance and upgrade of the package. The use of effcent mplementaton technques ensures an adequate performance. Ths paper s organzed as follows. In Secton a bref revew of the OOM s presented. The general OO structure used to represent the power systems s dscussed n Secton 3 so as to stuate the present work n ts context. In Secton 4 the proposed structure s presented. The class model and the applcaton of the desgn pattern Strategy as a concept tool for the structure as well as the way n whch the soluton of lnear systems s dealt wth n the structure, are detaled n ths secton. In Secton 5, results that assess the computng performance of the structure, are presented. Fnally, the conclusons are presented n Secton 6.. OBJECT ORIENTED MODELING The Object Orented Modelng (OOM) can be defned as a software desgn technque n whch the desgn clarty and organzaton are based on a clear and effcent representaton of the real world (applcaton doman) to facltate the software development and mantenance [3]. In the OOM the data structure takes precedence. Ths approach allows a stable base to the desgn development process and unfes the whole desgn through the concept of object. Encapsulated objects, wth publc nterfaces whch hde ther prvate nternal structures, are protected from sde effects n future software mantenance or extensons. The object s the essental entty n the OOM and has attrbutes (ts own features) and methods (the way t manpulates ts attrbutes). Durng the desgn tme, the classes are defned, whch defne each object type. Each object s an nstance of a specfc class. Classes (or objects) relate through assocatons (or lnks). Lnks are nstances of assocatons as objects are nstances of classes. Classes are assocated among themselves, that s, objects are lnked to other objects [3]. Composton and nhertance are specal forms of assocaton. When an object s formed by the combnaton of other objects, then t s a case of combnaton. The mechansm of nhertance allows that a class, called descendent (derved or subclass) nhert the characterstcs of another class, called base or superclass. Another property of the OOM s polymorphsm, whch allows the overloadng of operatons and methods, so that the same operaton (or method) carry out dfferent procedures, when appled to dfferent objects [3]... Desgn Patterns Recently a new concept has been ganng a larger acceptance n the objected orented desgn, the Desgn Patterns [4]. They are class structure patterns, whch were establshed by ther recurrence n many object orented desgns. In [4] 3 of these patterns, whch have been used and tested by the authors and other desgners for several years, are dentfed. The use of these patterns n object orented desgn meets one of the key concepts n OOM that s structure reusablty. Ther applcaton ensures modularty and extensblty to the desgn. When a desgn pattern s used, the desgner can be assured that a well-tested structure employed n many other projects n the past s beng used. 3. APPLICATION TO EPS The tradtonal technques appled to the development of computng tools for power systems lack some desrable features to face the current challenges set by a fast changng envronment. These technques, based on structured desgn methods and procedural languages, am prmarly hgh computng performance and not clarty and flexblty of the desgn and the resultng code. As a result, sometmes the data structure tends to be fragle, and senstve to code mantenance. As an alternatve to overcome these problems, works have been proposed applyng OOM to the development of computng tools n power systems n areas such as dstrbuton systems [], dynamc smulaton [] and power flow [], []. In [] and [5] the authors propose generc class structures to represent power systems, whch allow the mplementaton of methodologes for the analyss and synthess n an ntegrated envronment,

9 for the development of power system computng tools. A smlar work s presented n []. In [3] the authors apply the concept of desgn patterns to the representaton of power system elements. 3.. Applcaton to the Soluton of Lnear Systems Several works were prevously publshed applyng OOM to the problem of solvng lnear systems [6], [9], [4], [5], [9]. In [9] the authors present a new methodology for solvng lnear systems n whch the objects are created to accommodate elements of the same degree, ncreasng the performance of the orderng process. In reference [6] a new set of classes for sparse and symmetrc lnear systems s proposed, the soluton beng based on drect methods. The results show that the computatonal performance usng an OOM approach s compettve wth the tradtonal approach based on structured desgn methods and procedural languages. Furthermore, the authors emphasze the dffculty to choose a partcular method for generc lnear systems snce the adequacy of a partcular method depends on the matrx type. As a result, ths reference, as the other references above, uses specfc solutons for the consdered lnear systems. However, snce these solutons are usually avalable as lbrares, alteraton n a code that uses one of these lbrares, to solve a dversty of lnear system types, can be cumbersome from a user pont of vew. 4. PROPOSED STRUCTURE The man goal of the proposed object orented structure s the storage and effcent handlng of large scale sparse matrces. To that end, the class SparseMatrx was created, as shown n Fgure. The storage of the matrx elements s carred out by usng the contaners of the Standard Template Lbrary (STL), of the C++ programmng language [7]. The classes vector<t>, valarray<t> and map<t,t> are used. In ths way two mportant attrbutes of the STL, portablty and computng performance, are ncorporated n the structure. The class SparseMatrx s formed by a vector of n ordered lsts (attrbute nln), where each ordered lst stores pars <nt,t>, whch represent the nonzero elements of each matrx row (column - nt, and value - T). An attrbute (flagsym) ndcates f the matrx s symmetrc or asymmetrc. If the matrx s symmetrc, only the nonzero elements above the dagonal are stored. Ths flag must be nformed when the matrx s created or dmensoned and ts default value s asymmetrc (). The dagonal elements are stored n a vector of the type valarray<t> (dag). Rectangular matrces can also be stored by ths class. In ths case the vector dag stores the elements n whch = j, and the remanng nonzero elements are stored n the lsts of vector nln. The nternal storage structure of SparseMatrx s shown n Fgure. The operators () e [] are overloaded n the class SparseMatrx, allowng drect access to ts elements. An auxlary class (Pos_Mat) was created to help to search for the matrx elements, by the use of these operators. A method called Get_Elem_Next (,j) allows that the matrx be searched to access ts nonzero elements. Ths method returns the matrx entry dentfed by the coordnates,j; f the element s zero (and therefore does not exst n the structure), the next nonzero entry n row s returned, and the value of the varable j s updated wth the column of the returned entry. Dagonal entres are not returned. In ths way, t s possble to do an effcent search n the compact storage structure of the matrx, traversng only the nonzero elements. Fgure - Class SparseMatrx 3

10 Fgure - Internal Storage Structure of the SparseMatrx Class The structure classes are all mplemented as templates, addng generalty n the use of the package. As a result, t allows the storage and handlng of any type of sparse matrces, rangng from the standard types as double or complex (the last one s defned n the STL) to new user defned types, such as block structured matrces [9]. 4.. Soluton of Lnear Systems The soluton of lnear systems s supported by the proposed structure by the use of the desgn pattern Strategy. In ths pattern, several forms to execute a specfc task are encapsulated n dfferent classes, called strateges, whch work under the control of the man class (called context). A user n ths structure nforms to the context class whch strategy should be used n the soluton of a task and from ths moment onwards nteracts only wth the context class whch passes to the current strategy the commands for the executon of the task. The pattern structure s presented n Fgure 3. The pattern adds to the project several mportant features such as ndependence between the strateges, that s, new strateges can be added later to the project, wthout the need of modfcatons n the orgnal classes. Another feature s the possblty of dynamc changes between strateges n executon tme, whch s not possble usng nhertance, an alternatve form of encapsulatng dfferent methods to perform the same task. The pattern strategy s appled n the proposed structure by makng the class SparseMatrx a context, wth several strateges for the soluton of lnear systems. The class dagram s shown n Fgure 4, n whch the class LS_Strategy s the base for all strateges, declarng an nterface between them and ther context. A user, that s, a class or functon, whch has a matrx represented by the class SparseMatrx, defnes the strategy to be used through the method Set_strategy(). From ths moment on, the startng of the method Solve_LnSys() belongng to the class SparseMatrx trggers the process of soluton of the lnear system formed by the matrx and by an ndependent vector suppled by a method parameter. The soluton s stored n a vector also suppled by a method parameter. New solutons, usng a new soluton method for the lnear system, can be obtaned by callng Set_strategy() for the new strategy. Fgure 4 llustrates the class LS_Strategy, as the base for all strateges of soluton of lnear systems. The class has a unque attrbute dm, whch represents the dmenson of the system to be solved. Three methods form the strateges nterface: Intalze(), Set_Val() and Solve(). The method Intalze() ntalzes the strategy, confgurng t to perform the tasks related to the lnear system. Ths method s started by the method Set_strategy() of SparseMatrx, n the moment a strategy s attrbuted to a matrx. The method Set_Val() attrbutes values to a possble nternal storage structure for each strategy. It s called each tme an attrbuton to an element of Sparse- Matrx s performed. The method Solve() starts the process of lnear system solvng, and s called by the method Solve_LnSys() n context. Fgure 3 - Pattern Strategy 4

11 orderng or factorzaton, for nstance, are necessary, n a process that nvolves the repeated soluton of a system. Fgure 4 - Strategy Appled to the Soluton of Lnear Systems 4... Desgn of a Soluton Strategy The three methods prevously descrbed form the nterface between the strateges and ther context and are declared as abstract methods n the LS_Strategy base class. Therefore, they are defned n each strategy accordng to a partcular scheme. The methods are protected so that the external classes have no access to the strateges. The strateges are derved classes from the LS_Strategy class. The strateges can contan specalzed structures for the storage of sparse matrces accordng to the soluton methodology mplemented by the partcular strategy. The class SparseMatrx mplements a smple compact storage, not assocated to any partcular soluton method for lnear systems. The only requrement s to store, n an effcent way, sparse matrces. When these specalzed structures exst, the methods Intalze() and Set_Val() can be used for the ntalzaton and mantenance of ths structure. When a strategy s attrbuted to a matrx, the matrx calls the method Intalze(), ndependently f the attrbuton was done before or after the matrx fllng. To each new attrbuton to elements of a matrx represented by an object of type SparseMatrx, the method Set_Val() of LS_Strategy s called. Each strategy mplements these methods so that the nternal structures are kept. The process of solvng a lnear system can be dvded n several steps, accordng to the soluton method. For nstance, for drect methods, usually there are the steps of orderng, factorzaton and substtuton. The control of the sequence n whch the steps are called must be the responsblty of the strategy, whch must know f a new 5. COMPUTATIONAL EXPERIMENTS The computng performance of the proposed structure was assessed by solvng two sparse symmetrc lnear systems wth dmenson. These systems were randomly generated by MATLAB. The frst system s hghly sparse, wth 767 nonzero elements. Defnng the densty of a matrx as the rato between the number of nonzero elements and the square of ts dmenson, the frst matrx has a densty of.9 x -4. Ths s comparable to the densty of the bus admttance matrx of a power system wth an average connectvty of,8 by node. The second system s denser than the frst, wth 94 nonzero elements, leadng to a densty of 4.76 x -4, comparable to an average connectvty of 8,5. Two methods for the soluton of lnear systems were mplemented: the Zollenkopf B-factorzaton method [6] and a strategy usng a drect method for the soluton of symmetrc lnear systems based on LU factorzaton of symmetrc matrces [7], [8]. The performance of the structure was compared to the performance of the SPOOLES lbrary [9], usng a mnmum number of operatons for the soluton of the lnear system (the fastest way to solve a lnear system). The SPOOLES lbrary, desgned usng concepts of OOM and mplemented n C, was used ether drectly or as an encapsulated strategy for soluton of lnear systems. The results are presented n Table. The platform was an AMD K7 Athlon GHz, 56Mb RAM, wth the LI- NUX operatng system (dstrbuton Mandrake 7.) and the compler was the GCC, verson The codes were compled usng the frst optmzaton level (-O). Table - CPU Tmes n the Soluton of Lnear Systems Lnear Proposed Structure System Zollenkopf LU Fat. SPOOLES SPOOLES,67s,4s,9s,9s 49,63s,93s,49s,49s For the frst system the performance of the Zollenkopf B-factorzaton method (,67s) was 5% superor to the SPOOLES lbrary (,9s). The LU factorzaton for symmetrc systems presented the best performance (,4s), beng 8% faster than the SPOOLES lbrary n solvng ths lnear system. The performance of the structure, when the strategy that encapsulates the SPOOLES lbrary s used, s the same as when ths lbrary was drectly used outsde the proposed structure. Table also shows the performance for the soluton of the second, denser, lnear system. The best performance n ths case was acheved by the soluton method that uses the SPOOLES lbrary. Agan the proposed structure wth the strategy that encapsulates the 5

12 SPOOLES lbrary had the same performance as the drect use of the lbrary (,49s). 6. CONCLUSIONS The structure proposed n ths work makes avalable to the users the storage and handlng of sparse matrces n a transparent way. The access to matrx elements s carred out n a drect way through the use of the operators () and []. The soluton of the lnear systems s also made avalable n a smple form, through the use of only two methods declared n the class SparseMatrx. Several methods for the soluton of lnear systems were encapsulated as strateges n the proposed structure. In ths step the structure facltated the mplementaton of the new strateges. It must be emphaszed that the structure allows the use of several methods, drect or nteractve, for the soluton of symmetrc or asymmetrc lnear systems. The change of the soluton method s easy, snce only one command must be altered n the structure clent code. Software avalable as lbrares, even compled n other programmng languages dfferent from C++ can be reused by encapsulaton n strateges, addng functonalty to the structure. Ths was the case of the SPOOLES lbrary, wrtten n C and reused as a strategy n the structure. The computatonal performances acheved show that the use of the proposed object orented structure does not mply necessarly n overheads n terms of CPU tme. The use of OO desgn patterns [4] and of UML [] n the development and documentaton of the class structure brought clarty and standardzaton to the desgn. The facltes made avalable by the C++ programmng language such as the templates and contaners of the STL add portablty to the structure wthout degradng ts performance. Fnally, the proposed structure allows that hgh performance and well-tested specalzed lbrares, developed usng conventonal desgn technques, be encapsulated as strateges, ensurng hgh performance n the soluton of large-scale sparse systems whle keepng the paradgm of the OO desgn. Acknowledgments: The authors are grateful to CNPq and CAPES for provdng partal fnancal support for ths research. Professor A. S. e Slva thanks Professor Malcolm Irvng and Dr. Jeremy Danel of Brunel Insttute of Power Systems, Brunel Unversty, for the dscussons and facltes provded durng the development of ths research. References: [] J. ZHU, D. L. LUBKEMAN, Object-Orented Development of Software Systems for Power System Smulatons, IEEE Trans. on Power Systems, vol., no., May 997, pp. -7. [] A. MANZONI, A. S. SILVA, I. C. DECKER, Power Systems Dynamcs Smulaton Usng Object-Orented Programmng, IEEE Trans. on Power Systems, vol. 4, no., Feb. 999, pp [3] J. RUMBAUGH, M. BLAHA, W. PREMERLANI, et al., Object-Orented Modelng and Desgn, New Jersey: Prentce- Hall, 99. [4] E. GAMMA, R. HELM, R. JOHNSON, et al., Desgn Patterns: Elements of Reusable Object-Orented Software, Readng: Addson Wesley, 995. [5] M. N. AGOSTINI, I. C. DECKER, A. S. SILVA, Developng and Implementaton of an Object Orented Computatonal Base for Applcatons n Electrc Power Systems (n Portuguese), In. CONGRESSO BRASILEIRO DE AUTOMÁTICA CBA (3. : Set. : Floranópols, SC). Anas. Floranópols,. pp [6] S. PANDIT, S. A. SOMAN, S. A. KHAPARDE, Desgn of Generc Drect Sparse Lnear System Solver n C++ for Power System Analyss, IEEE Trans. on Power Systems, vol. 6, no. 4, Nov., pp [7] B. STROUSTRUP, The C++ Programmng Language, 3. ed., Readng: Addson-Wesley, 997. [8] M. A. ELLIS, B. STROUSTRUP, The Annotated C++ Reference Manual, Readng: Addson-Wesley, 99. [9] L.R. ARAUJO, J.L.R. PEREIRA, Soluton of Large Scale Electrc Network, Usng Object Orented Programmng (n Portuguese), In. CONGRESSO BRASILEIRO DE AUTOMÁTICA CBA (3. : Set. : Floranópols, SC). Anas. Floranópols,. pp [] A. F. NEYER, F. F. WU, K. IMHOF, Object-Orented Programmng for Flexble Software: Example of a Load Flow, IEEE Trans. on Power Systems, vol. 5, no. 3, Aug. 99, pp [] E. Z. ZHOU, Object-Orented Programmng, C++ and Power System Smulaton, IEEE Trans. on Power Systems, vol., no., Feb. 996, pp [] S. PANDIT, S. A. SOMAN, S. A. KHAPARDE, Object- Orented Desgn for Power System Applcatons, IEEE Computer Applcatons n Power, vol. 3, no. 4, Oct., pp [3] J. ZHU, P. JOSSMAN, Applcaton of Desgn Patterns for Object-Orented Modelng of Power Systems, IEEE Trans. on Power Systems, vol. 4, no., May 999, pp [4] B. HAKAVIK, A. T. HOLEN, Power System Modellng and Sparse Matrx Operatons Usng Object-Orented Programmng, IEEE Trans. on Power Systems, vol. 9, no., May 994, pp [5] J. DONGARRA, A. LUMSDAINE, X. Nu, et al., A Sparse Matrx Lbrary n C++ for Hgh Performance Archtectures, [Onlne], Avalable: / ~lbrary / 994. html. [6] K. ZOLLENKOPF, B-Factorzaton - Basc Computatonal Algorthm and Programmng Technques", In: Large Sparse Sets of Lnear Equatons, edted by J. K. Red, Academc Press, 97. 6

13 [7] M. MOROSOWSKI FILHO, Sparse Matrces n Electrc Networks: Operaton Technques (n Portuguese), Ro de Janero: Lvros Técncos e Centífcos, 98. [8] W. F. TINNEY, J. W. WALKER, Drect Solutons of Sparse Network Equaton by Optmally Ordered Trangular Factorzaton, Proceedngs of the Insttute of Electrcal and Electroncs Engneers, New York, Nov. 967, pp [9] C. Ashcraft, J. W. H. LIU, SPOOLES: An Object Orented Sparse Matrx Lbrary, [Onlne], Avalable: lnalg/spooles/spooles...html. [] G. BOOCH, J. RUMBAUGH, I. JACOBSON, The Unfed Modelng Language: User Gude, Readng: Addson Wesley, 999. [] C. R. FUERTE-ESQUIVEL, E. ACHA, S. G. TAN, et al., Effcent Object Orented Power Systems Software for the Analyss of Large-Scale Networks Contanng FACTS- Controlled Branches, IEEE Trans. on Power Systems, vol. 3, no., May 998, pp

14 VIII SEPOPE 9 a 3 de mao de May, 9 th to 3 rd Brasíla (DF) Brasl VIII SIMPÓSIO DE ESPECIALISTAS EM PLANEJAMENTO DA OPERAÇÃO E EXPANSÃO ELÉTRICA VIII SYMPOSIUM OF SPECIALISTS IN ELECTRIC OPERATIONAL AND EXPANSION PLANNING IP 9 A NEW APPROACH TO NONLINEAR PROGRAMMING APPLIED IN THE RESOLUTION OF THE OPTIMAL POWER FLOW PROBLEM L. C. T. Nunes ELEKTRO BRAZIL E. A. Belat * G. R. M. Da Costa EESC USP Abstract Ths paper presents a new approach that mproves the performance of the Newton's method for resoluton of the optmal power flow problem (OPF). The OPF s an mportant tool of analyss operaton and plannng of electrc system power, t s used n studes of voltage nstablty, maxmum loadng, analyss of "spot prce", among others. Ths approach treats the nequalty constrants of the reactve power by nteror pont method and the others by penalty functon. The frst order necessary condtons for optmalty are reached by Newton's method, and by updatng the barrer parameters assocated wth sources of reactve power and penalty terms assocated wth the others nequalty constrants. The effectveness of the proposed approach has been examned by solvng the 3-bus and 8-bus systems. Keywords: Nonlnear Programmng, Optmal Reactve Dspatch, Power System and Newton s Method. INTRODUCTION The OPF s a problem that optmzes a lnear or nonlnear objectve functon, wth lnear and nonlnear constrants. It s a no-convex and statc problem, whch calculates a optmal group of varables of state of the electrc network, startng from load data and of the parameters of the system, so that determne the optmal operaton pont. Carpenter proposed t n the early 6s based on the economc dspatch problem []. In the last few years, practcally all researches of development of new approaches to solvng the OPF problem consdered one of the technques of nteror pont varant as [-5]. Ths s justfed by ts effcency and easness of mplementaton. However, these varants have presented a long tme of processng n the convergence process and a seres of numerc problems when a lot of constrants are near ther lmts. Another very used method was Newton s, whch was proposed by [6] that n spte of ts lmtatons s stll consderng as one of the most effcent and robust approaches known. The ablty of the Newton s method n mnmzng the objectve functon of OPF problem n few teratons, once known the nequalty constrants actve n the soluton, t s enough for us to gve contnuty n ths research n search of the mprovement of ts performance. The man dffculty of the Newton s method s the dentfcaton of the actve nequalty constrants n the soluton, that are the sources of reactve power n the reactve control bus. A relable and effcent process wthout the necessty of specalzed knowledge to dentfy them was not developed yet. In ths paper a new approach to solvng the OPF s descrbed, where t s tred to explore the best characterstcs of the nteror pont and Newton s methods. The nequalty constrants, reactve power njecton, are handled by nteror pont method and the other constrants of equalty and nequalty are handled as n [6]. The paper s organzed as followng: Frst, the OPF problem s explaned; after that a revew of optmzaton methods s descrbed; then, the new approach s shown; the results of comparatve tests are reported and fnally, some concludng comments are made. OPTIMAL POWER FLOW FORMULATION The optmal power flow problem can be presented as: Mnmze f (x) subject to g (x) = Where: h (x) x j mn x x =,,..., m < n max j =,,..., p n x R s the vector of state varables; (x) () f s real power loss n transmsson; g (x) = s the set of power flow equatons; h(x) s the set of lmts on state varables and power system functonal constrants. The state varable vector, x, represents the voltage magntude, phase angles, LTC s taps and phase shfter s control angles. The objectve functon, f (x), can assume dfferent forms, for example, the actve power losses n transmsson, the actve power cost of dspatchable generators. The equalty constrants, Edmarco Antono Belat LOSEP EESC USP; Post Offce Box: São Carlos SP Brazl

15 g (x) =, represent the power flow equatons. The nequalty constrants, h(x), represent the functonal constrants of the power flow,.e., lmts of actve and reactve power flows n the transmsson lnes and transformers, lmts of reactve power njectons for reactve control buses and actve power njecton for the slack bus. Ths s a typcal nonlnear and nonconvex problem. 3 REVIEW OF OPTIMIZATION METHODS In ths secton the man characterstcs of the twooptmzaton approaches, n ther basc forms, are dscussed: Actve Set and Penalty, proposed by [6] and Logarthmc-Barrer Prmal-Dual methods proposed by []. 3. Actve Set and Penalty Methods In Newton s method, as proposed by [6], the nequalty constrants are aggregated to the objectve functon through Lagrange multplers and penalty factors. Thus, the nequalty constrants are dvded nto two groups: penalty constrants, whch are added to the objectve functon through penalty factors, and actve constrants that are grouped wth the set of actve constrants (power flow equatons). The orgnal problem s therefore modfed and represented as: Mnmze subject to F(x) = f (x) + γ G (x) = k () where: x = (t, V, θ) ; k =,,..., m, m +,..., b p + m ; and γ s set of the volated nequalty constrants assocated wth penalty factors. G(x) s now the set of power flow equatons and bndng constrants ( Q(t, V, θ ) ). The set γ s defned as: c ( x) (x x or c γ( x) = ( x + γ = max ) f the upper lmt s volated x mn ) f the lower lmt s volated; The penalty factor c s updated as followng k+ k c = ρ c (3) where: λ k s the Lagrange multpler. The process conssts of fndng values of x and λ, that satsfy the frst-order necessary condtons of the Lagrangan functon, so that: L = x L = λ (5) The soluton of system (5) can be obtaned by Newton s method, and s represented by: H J T J x x L = λ λl The Lagrangan matrx s symmetrcal where: (6) L H = : Hessan matrx wth respect to x. x L L J = : Jacoban matrx of the gradent vector x λ λ wth respect to x. x λ new new The soluton of (6) s used to update x and λ,.e.: = x = λ old old + x + λ The mnmum of functon L wll be reached when Karush-Kuhn-Tucker condtons are satsfed by x and λ updated. Otherwse, the G (x) wll be modfed,. e., the nequalty constrants assocated wth sources of reactve power ( Q(t, V, θ )) that do not volate the lmts are removed and the volated ones are ncorporated nto set G (x). Thus, we have a sequental unconstraned problem. The method has second order convergence and has the drawback that the bndng constrants need to be dentfed.prmal-dual Logarthmc-Barrer Method The resoluton of problem () by the prmal-dual logarthmc-barrer method requres that the nequalty constrants become strct equaltes through the addton of a postve slack varable. Thus, the modfed problem () can be presented as: (7) where ρ s the penalty parameter. The Lagrangan functon of the problem () s gven by: b L (x, λ) = F(x) + λ G (x (4) k= k k ) Mnmze subject to f (x) g (x) = h (x) + s x x j y y + s - s s, s j y y 3y, s j = x = x 3y = max mn > (8)

16 The non-negatvty condtons s > n (8) are handled by ncorporatng them nto logarthmc barrer terms, so: Mnmze f (x) µ subject to x x j y y + s - s p j= g (x) = h (x) + s y 3y ln(s ) µ j = x = x j = max mn n y= [ln(s y ) + ln(s where: µ > s a barrer parameter that s monotoncally decreased to zero as teratons progress,.e., µ o > µ > K > µ =. The process generates a sequence of sub problems gven by (9). The Lagrangan functon assocated wth the problem s gven by: L = f (x) µ m = n y= λ g [ π y j= (x) (x y p ln(s + s p j= y j π ) µ j - x j max n y= [ln(s [h (x) + s ) + π j 3y y ] ( x ) + ln(s y - s 3y 3y - x 3y )] )] mn (9) )] () Where λ, π, π, π3 are vectors of Lagrange multplers. A local mnmum of () s expressed n terms of a statonary pont of L, whch must satsfy the KKT frstorder necessary condtons. δ L = () Where: δ = ( x, λ, π, s), generatng a system of nonlnear equatons. Newton's method s appled to the equatons () to determne the correcton factor δ. The new prmal and dual varables are computed from x s λ π new new new new = x = s = λ = π old old old old + α x + α s + α λ + α π () Where the scalar α (,] s the step length parameter. α max d π = mn ( mn π < π ),. (4) max max α = mn{ τα p, τα,.} (5) d Where the scalar τ (,) s a safety factor to ensure that the next pont wll satsfy the strct postvty condtons. A typcal value s τ = A crtcal pont n the prmal-dual algorthm s the choce of the barrer parameter µ. The condton s L = suggests that µ be reduced based on a predcted decrease of the complementarty gap [7]. The startng pont needs only to meet the strct postve condtons, although the method performs better f some ntalzng heurstc s used. The process of optmzaton s consdered termnated whenever KKT condtons are satsfed wth a certan tolerance. 4 IMPROVED NEWTON METHOD We wll use the two method mentoned to develop a new approach to the soluton of the optmum reactve dspatch problem. To the optmum reactve dspatch problem we can assocate varables, strctly postve, to turn constrants of reactve power nto equalty. The other nequalty constrants are appendng n the objectve functon by penalty functon as propose n [6]. After modfcaton, the problem can be wrtten as: Mnmze F(x) = f(x) + α subject to : g (x) =, =,..., m h(x) + s h(x) s s s > > = Q = Q max mn (6) t where: (s ) = (s,...,s ), wth s >, and l ncr t (s ) = (s,...,s ), wth s >, l =,..., p. The l ncr varables of the vector sand denomnate sand s are slack varables. We s auxlary varables. γ s the group of the nequalty constrants volated assocated to factors of the penalty. Incorporatng to the functon objectve the varables strctly postve through logarthmc functon can change the problem. After the modfcaton, the problem becomes: α max P s = mn ( mn ),. s < s (3)

17 Mnmze F(x) - p p µ ln s l µ l= l= subject to g (x) =, =,..., m max h(x) + s = Q mn h(x) s = Q ln s (7) max mn where: Q and Q are the maxmum and mnmum lmts of the reactve power n the bus wth sources of reactve power. The Lagrangan functon assocated wth the problem s: L(x, λ,s, π, µ ) = F(x) µ m = ncr l= λ g (x) + l l ncr l= π (h(x ) s π (h(x ) + s Q l l Q p p ln s l µ l= l= l mn l ) l max l ln s ) + l + (8) where: λ, π and π are Lagrange multplers, µ the barrer parameter and ncr s the number of bus wth sources of reactve power. To the Lagrangan Functon assocated to the problem of optmum reactve dspatch the condtons of optmalty s appled. Thus x L (x, λ,s, π) = s L (x, λ,s, π) = λ L (x, λ,s, π) = π L (x, λ,s, π) = (9) The system of equatons (9) can be represented as follows: x t t t t F(x) + λ J(x) + ( π ) J(x) + ( π ) J µ + π =, l =,...,ncr l sl µ πl =, l =,...,ncr sl g (x) =, =,...,m h(x) + s h(x) s. Q Q max mn where: t J(x) = ( g (x),..., g (x)), J J x x m t (x) ( x h(x),..., xh ncr t (x) ( xh(x),..., xh ncr = = = (x)) and = (x)). (x) = () Usng the Newton s method ths system of equatons s solved. Thus, the equatons () can be represented as: W d = L () where: xxl w = J(x) J(x) J (x) wth (s S ) = I= t d = and L = O. µ (S ) I µ (S ) I J(x) (s O, S ) = (s n ) ( x, s, s, λ, π, π ) x h(x) + s h(x) s. t Q Q J (x) t t t F(x) + λ J(x) + ( π ) J(x) + ( π ) µ + π l s l µ π l s l g (x) = max mn I t t J (x) I, O and (s n ) t J (x) Usng the search drectons obtaned from (), the vectors of the varables, x, s and s and of the Lagrange multplers, λ, π and π are updated as follows: x s s k+ k + k + k λ + k π + k = x = s k k = s =λ k k = π + α x p p k + α s p k + α s + α k k d + α λ d k π d k k k (a) (b) (c) (d) (e) π + = π + α π (f)

18 Where α p and α d are scalar step sze to update the prmal and dual varables respectvely. Ths step s chosen to mantan the components of the auxlary vectors s and s strctly postve and the element of the dual vector λ, π and π ts sgn. The strategy recommended for, [] and [8], for the calculaton of the maxmum step s: α α s = mn { τ ( mn s < s p π = mn { τ ( mn π > π s, mn s < s d π < π, mn π ), } ), } ; (3), (4) where τ =.9995 s an emprcal value whch, accordng to [4], can be derved from the formula / 9 nc, where nc s the number of constrants n the problem. The factor of Barrer µ wll be updated n the followng way: k k µ µ + =, α >, (5) α Where α s denomnated correcton factor. Several specal rules can be used for the correcton of the Barrer factor as the one of the " gap of Dualty ". We chose determne t emprcally. 5 ALGORITHM The algorthm proposed to solve the problem s an teratve process consstng of the followng steps:. Make startng estmates for d = (x,s, λ, π) and µ x : can be the same as the ntal values for a power flow. λ = or any reasonable guess π > or π< KKT condtons.. Evaluate L as a functon of d Fgure -. If KKT condtons are satsfed the problem s solved, otherwse v. Update µ (5), and c (3) v. Evaluate the matrx W as a functon of d v. Solve the system W d = L for d v. Update d by d v. Return to step 6 IMPLEMENTATION Most of the work n the algorthm s n the soluton of system (). The Lagrangan matrx, W, that results from the lnear approxmaton of the KKT condtons, has a structure that facltates the applcaton of sparsty technques. Ths matrx s sparse and symmetrc. It needs to compute and store only half of LU factorzaton due to symmetry. The matrx structure s constant all through the teratons, the orderng and symbolc analyss are done only once to create a statc data structure. Thus the numercal factorzaton s carred out effcently at every teraton, for that the subroutne ma57 was used. 7 TEST RESULTS Tests were done to verfy the effcency of the proposed approach. The algorthm was mplemented n FORTRAN, usng double precson arthmetc on a 5 MHz mcroprocessor, n the Power Systems Optmzaton Laboratory of EESC, USP. The cases studed were the mnmzaton of actve power losses n transmsson n the IEEE 3-bus and IEEE 8-bus systems bus system Ths test was accomplshed wth the followng ntal condtons: V k =. pu ( MVA base) and θ k =. for k =,...,3, and t =. for =,...,4. The Lagrange multplers related to the equalty and nequalty constrants are, respectvely, λ =, π and π. The ntal penaltes were defned as c = 3. All penalty ncreasng factors were defned as ρ =.5. The process converged n 9 teratons. The amount of reactve power generaton was 8.39 MVAr, wth a total actve power loss of 6.43 MW. The ntal barrers were defned as µ =,. All barrers ncreasng factors were defned as β =. The optmzaton process for ths case s summarzed n table. Table - Optmzaton Summary For 3-Bus System Iteraton Actve power loss (MW) Msmatch (MW) Max DP Msmatch (MVAr) Max DQ 3,45 3,39 9,8 6,7,68,3 3 5,53,,85 4 5,88,7 6,4 5 6,,33 4,45 6 6,8,33 3,5 7 6,53,8, 8 6,43,9,6 9 6,43,, Bus System Ths test was accomplshed wth the followng ntal condtons: x = ( t,v, θ ) unconverged network soluton. The Lagrange multplers for the equalty and nequalty constrants were, respectvely, λ =, π and π. The ntal penaltes were defned as c =. All penalty ncreasng factors were defned as ρ =.. The process converged n teratons. The amount of reactve power generaton was MVAr, wth a total actve power loss of 4.89 MW. The ntal

19 barrers were defned as µ =,. All barrers ncreasng factors were defned as β =. The optmzaton process for ths case s summarzed n table and n fgure s showed the convergence of the objectve functons for the 8-bus system. 8 CONCLUSIONS The paper presents a new approach to the soluton of ths problem where the good characterstcs of nteror pont and Newton s method are explored. The dffculty n dentfyng the bndng constrant set s removed by the ntroducton of dual varables and quadratc penalty terms nto the augmented Lagrangan. The tests demonstrated the effectveness of the proposed approach. The results acheved n the tests show the vablty of the use of the nteror pont method n assocaton wth the penalty functon. The hardest task n ths approach s to fnd the ntal values of the barrer parameter for the reactve power varables. Table - Optmzaton summary for 8-bus System Iteraton Actve power loss (MW) Msmatch (MW) Max DP Msmatch (MVAr) Max DQ,5 45,37 94,6 6,57 8,3 6,87 3 7,47,97,7 4 7,38 6,, ,93 3, 68,36 6,8 9,73 7, 7 3,87 7,3 3, 8 5,8,59 6,35 9 5,,3 3,39 4,89,4,4 9 ACKNOWLEDGEMENTS Ths project was partly supported by FAPESP, Fundação de Amparo a Pesqusa do Estado de São Paulo and by CAPES,- Fundação Coordenação de Aperfeçoamento de Pessoal de Nível Superor. REFERENCES [] J. Carpenter, Contrbuton To The Economc Dspatch Problem, Bull-Soc. France Elect. Ser. B3, 96, vol. 8, pp [] S. Granvlle, Optmal Reactve Dspatch Through Interor Pont Method, IEEE Transactons on Power Systems, vol. 9, no. 4, pp 36-46, November 994. [3] Y. Wu, A.S. Debs and R. E. Marsten, A Drect Nonlnear Predctor-Corrector Prmal-Dual Interor Pont Algorthm for Optmal Power Flow, IEEE Transactons on Power Systems, vol. 9, no., pp , May 994. [4] M.H. Wrght, Why A Pure Prmal Newton Barrer Step May Be Infeasble?, SIAM Journal on Optmzaton, 995, vol. 5, no., pp -. [5] E.C. Baptsta, E.A. Belat and G.R.M da Costa, A New Soluton to the Optmal Power Flow Problem IEEE Porto Power Tech Conference, September, pp -6. [6] D.I. SUN et al, Optmal Power Flow By Newton Approach, IEEE Transactons on Power Apparatus and Systems, v.3, n., p , October 984. [7] G.L. Torres and V.H. Quntana, An Interor Pont Method For Nonlnear Optmal Power Flow Usng Voltage Rectangular Coordnates, IEEE Transactons on Power Systems, vol. 3, no. 4, pp -8, November 998. [8] V.H Quntana, A. Gómez and J. L. Martnez, Nonlnear Optmal Power Flows by Logarthmc- Barrer Prmal-Dual Algorthm. IEEE NAPS Meetng, 995. BIOGRAPHIES Luz C. T. Nunes receved the electrcal engneerng degree from Unversty of Juz de Fora. He s presently a M.S. degree n the Department Electrcal Engneerng of São Carlos Engneerng School of Unversty of São Paulo and works as an electrcal engneer n the Elektro Eletrcdade e Servços. Hs research nterests are power system operaton and plannng. Edmarco A. Belat receved the electrcal engneerng degree from Faculdade de Engenhara de Lns and M.S. degree n the Department of Electrcal Engneerng- FEIS-UNESP. He s presently a Ph.D. student n the Department Electrcal Engneerng of São Carlos Engneerng School of Unversty of São Paulo. Hs research nterests are power system operaton and plannng. Geraldo R. M. da Costa receved hs B.S. and M.S. degrees n the Department of Electrcal Engneerng of São Carlos Engneerng School of Unversty of São Paulo and Ph.D. degree at Unversty of Campnas (UNICAMP). He s an assocated professor of the Department Electrcal Engneerng of São Carlos Engneerng School of Unversty of São Paulo. Hs research nterests are power system operaton and plannng.

20 VIII SEPOPE 9 a 3 de mao de May, 9 th to 3 rd Brasíla (DF) Brasl VIII SIMPÓSIO DE ESPECIALISTAS EM PLANEJAMENTO DA OPERAÇÃO E EXPANSÃO ELÉTRICA VIII SYMPOSIUM OF SPECIALISTS IN ELECTRIC OPERATIONAL AND EXPANSION PLANNING IP THE USE OF THE GEOMETRIC OPTIMIZATION MODEL TO SOLVE THE ENVIRONMENTAL UNIT COMMITMENT PROBLEM Maro Lllo-Saavedra * Claudo Roa-Sepúlveda * Maurco Canales & Bors Pavez-Lazo * Electrc Engneerng Department, Unversty of Concepcón, P.O. Box 6-C, Concepcón, Chle & Molecular Bology Department, Unversty of Concepcón, P.O. Box 6-C, Concepcón, Chle * Abstract. Ths paper proposes the use of a model based on the geometrc optmsaton (GO) technque of molecular systems to solve the Unt Commtment Problem (UC) wth envronmental constrants. To acheve ths, the unts are modelled as artfcal molecules where each atom of those molecules defnes a generatve unt operaton state. To obtan the geometrc optmsaton and hence the optmsaton of the entre generatng set, Smulated Annealng (SA) technque, as an optmsaton tool, s selected. The whole model s devsed n ths paper by havng a contnuous characterstc rather than the classcal formulaton of UC. A prelmnary applcaton to a 5-unt test system for 4 hour of operaton subject to techncal restrctons, ntal condtons and envronmental constrants to each generatve unt s shown. Keywords: Unt Commtment (UC), Smulated Annealng (SA), Molecular Geometrc Optmsaton (GO) and Computng Bology.. INTRODUCTION In electrc energy system plannng, there s a problem of a common and fundamental objectve that s pursued: a maxmum utlsaton of electrc energy at a mnmum cost. The UC belongs to ths knd of problem. Its soluton has been boarded prncpally through classcal technques based on methods such as the lagrangean relaxaton and the lnear programmng [,]. Those methods decompose the problem n smple outlnes of unts over the whole tme horzon n whch ts executon tme vares lnearly wth the problem. Another well-known method s the mert order lst. Ths method lnearzes the objectve functon n dfferent sectons to fnd the system margnal cost consderng all possble unts. Ths method presents the nconvenent that the objectve functon needs to be lnear and the results are not necessarly closed to the absolute mnmum. The utlsaton of ths method mposes to the objectve functon to be of a lnear type and beng contnuously dfferentable. Furthermore, classcal technques must be adjusted to nclude power system and techncal restrctons such as mnmum up and down tmes. For those reasons, the lookng for new optmsaton technques based on alternatve to tradtonal concepts takes mportance lke those presented n [3-7]. Another mportant pont n solvng the UC s the sze of the soluton unverse. Ths s a strong lmtaton that must be consdered to get good results n the applcaton of the tradtonal methods. The applcaton of methods requrng the need to generate grd solutons such as a Taboo Search and Genetc Algorthm produce the known hgh computatonal costs that a combnatoral nature problem mples. Ths proposal attempts to solve de UC problem subject to techncal and envronmental constrants through a tool that mtates the molecules geometrc optmsaton to get ts mnmum energy state [8,]. Ths can be reached through the mnmsaton of forces nteractng between the dfferent atoms that compose molecules of a partcular system, gettng a state wth a mnmum energy cost. Ths paper proposes an UC model mapped onto a molecular confguraton wth contnuous characterstcs appled to a 5-generatng unt test system and a study tme horzon of 4 hour. The objectve of ths paper s to demonstrate the vablty of ths proposal and the use of SA to acheve the molecular and hence power system optmal value.

Documentation for the TIMES Model PART I

Documentation for the TIMES Model PART I Energy Technology Systems Analyss Programme Documentaton for the TIMES Model PART I Aprl 2005 Authors: Rchard Loulou Uwe Remne Amt Kanuda Antt Lehtla Gary Goldsten 1 General

More information

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers Foundatons and Trends R n Machne Learnng Vol. 3, No. 1 (2010) 1 122 c 2011 S. Boyd, N. Parkh, E. Chu, B. Peleato and J. Ecksten DOI: 10.1561/2200000016 Dstrbuted Optmzaton and Statstcal Learnng va the

More information

Self-Adaptive SLA-Driven Capacity Management for Internet Services

Self-Adaptive SLA-Driven Capacity Management for Internet Services Self-Adaptve SLA-Drven Capacty Management for Internet Servces Bruno Abrahao, Vrglo Almeda and Jussara Almeda Computer Scence Department Federal Unversty of Mnas Geras, Brazl Alex Zhang, Drk Beyer and

More information

Algebraic Point Set Surfaces

Algebraic Point Set Surfaces Algebrac Pont Set Surfaces Gae l Guennebaud Markus Gross ETH Zurch Fgure : Illustraton of the central features of our algebrac MLS framework From left to rght: effcent handlng of very complex pont sets,

More information

Sequential DOE via dynamic programming

Sequential DOE via dynamic programming IIE Transactons (00) 34, 1087 1100 Sequental DOE va dynamc programmng IRAD BEN-GAL 1 and MICHAEL CARAMANIS 1 Department of Industral Engneerng, Tel Avv Unversty, Ramat Avv, Tel Avv 69978, Israel E-mal:

More information



More information

Physical Security and Vulnerability Modeling for Infrastructure Facilities

Physical Security and Vulnerability Modeling for Infrastructure Facilities Proceedngs of the 39th Hawa Internatonal Conference on System Scences - 2006 Physcal Securty and Vulnerablty Modelng for Infrastructure Facltes Dean A. Jones Chad E. Davs Sanda Natonal Laboratores Albuquerque,

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and Ths artcle appeared n a ournal publshed by Elsever. The attached copy s furnshed to the author for nternal non-commercal research educaton use, ncludng for nstructon at the authors nsttuton sharng wth

More information

A fractional adaptation law for sliding mode control

A fractional adaptation law for sliding mode control INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING Int. J. Adapt. Control Sgnal Process. 28; 22:968 986 Publshed onlne 7 October 28 n Wley InterScence ( DOI:.2/acs.62

More information

On network efficiency comparisons: Electricity distribution

On network efficiency comparisons: Electricity distribution On network effcency comparsons: Abstract Electrcty dstrbuton Ralph Turvey Short-run effcency comparsons for electrcty dstrbuton networks, a matter of ther operatng costs, reure a clear concept of the scale

More information

A Study of the Cosine Distance-Based Mean Shift for Telephone Speech Diarization

A Study of the Cosine Distance-Based Mean Shift for Telephone Speech Diarization T-ASL-0460-13 1 A Study of the Cosne Dstance-Based Mean Shft for Telephone Speech Darzaton Mohammed Senoussaou, Patrck Kenny, Themos Stafylaks and Perre Dumouchel Abstract Speaker clusterng s a crucal

More information

DP5: A Private Presence Service

DP5: A Private Presence Service DP5: A Prvate Presence Servce Nkta Borsov Unversty of Illnos at Urbana-Champagn, Unted States George Danezs Unversty College London, Unted Kngdom Ian Goldberg Unversty

More information

Economic Models for Cloud Service Markets

Economic Models for Cloud Service Markets Economc Models for Cloud Servce Markets Ranjan Pal and Pan Hu 2 Unversty of Southern Calforna, USA, 2 Deutsch Telekom Laboratores, Berln, Germany, Abstract. Cloud computng

More information

Boosting as a Regularized Path to a Maximum Margin Classifier

Boosting as a Regularized Path to a Maximum Margin Classifier Journal of Machne Learnng Research 5 (2004) 941 973 Submtted 5/03; Revsed 10/03; Publshed 8/04 Boostng as a Regularzed Path to a Maxmum Margn Classfer Saharon Rosset Data Analytcs Research Group IBM T.J.

More information

Dropout: A Simple Way to Prevent Neural Networks from Overfitting

Dropout: A Simple Way to Prevent Neural Networks from Overfitting Journal of Machne Learnng Research 15 (2014) 1929-1958 Submtted 11/13; Publshed 6/14 Dropout: A Smple Way to Prevent Neural Networks from Overfttng Ntsh Srvastava Geoffrey Hnton Alex Krzhevsky Ilya Sutskever

More information



More information

Sector-Specific Technical Change

Sector-Specific Technical Change Sector-Specfc Techncal Change Susanto Basu, John Fernald, Jonas Fsher, and Mles Kmball 1 November 2013 Abstract: Theory mples that the economy responds dfferently to technology shocks that affect the producton

More information



More information

Invoicing and Financial Forecasting of Time and Amount of Corresponding Cash Inflow

Invoicing and Financial Forecasting of Time and Amount of Corresponding Cash Inflow Dragan Smć Svetlana Smć Vasa Svrčevć Invocng and Fnancal Forecastng of Tme and Amount of Correspondng Cash Inflow Artcle Info:, Vol. 6 (2011), No. 3, pp. 014-021 Receved 13 Janyary 2011 Accepted 20 Aprl

More information

As-Rigid-As-Possible Shape Manipulation

As-Rigid-As-Possible Shape Manipulation As-Rgd-As-Possble Shape Manpulaton akeo Igarash 1, 3 omer Moscovch John F. Hughes 1 he Unversty of okyo Brown Unversty 3 PRESO, JS Abstract We present an nteractve system that lets a user move and deform

More information

The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management

The Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management The Stochastc Guaranteed Servce Model wth Recourse for Mult-Echelon Warehouse Management Jörg Rambau, Konrad Schade 1 Lehrstuhl für Wrtschaftsmathematk Unverstät Bayreuth Bayreuth, Germany Abstract The

More information

Multi-Product Price Optimization and Competition under the Nested Logit Model with Product-Differentiated Price Sensitivities

Multi-Product Price Optimization and Competition under the Nested Logit Model with Product-Differentiated Price Sensitivities Mult-Product Prce Optmzaton and Competton under the Nested Logt Model wth Product-Dfferentated Prce Senstvtes Gullermo Gallego Department of Industral Engneerng and Operatons Research, Columba Unversty,

More information

As-Rigid-As-Possible Image Registration for Hand-drawn Cartoon Animations

As-Rigid-As-Possible Image Registration for Hand-drawn Cartoon Animations As-Rgd-As-Possble Image Regstraton for Hand-drawn Cartoon Anmatons Danel Sýkora Trnty College Dubln John Dnglana Trnty College Dubln Steven Collns Trnty College Dubln source target our approach [Papenberg

More information

Human Tracking by Fast Mean Shift Mode Seeking

Human Tracking by Fast Mean Shift Mode Seeking JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL 2006 1 Human Trackng by Fast Mean Shft Mode Seekng [10 font sze blank 1] [10 font sze blank 2] C. Belezna Advanced Computer Vson GmbH - ACV, Venna, Austra Emal:

More information



More information

Optimal Call Routing in VoIP

Optimal Call Routing in VoIP Optmal Call Routng n VoIP Costas Courcoubets Department of Computer Scence Athens Unversty of Economcs and Busness 47A Evelpdon Str Athens 11363, GR Emal: Costas Kalogros Department of

More information

An agent architecture for network support of distributed simulation systems

An agent architecture for network support of distributed simulation systems An agent archtecture for network support of dstrbuted smulaton systems Robert Smon, Mark Pullen and Woan Sun Chang Department of Computer Scence George Mason Unversty Farfax, VA, 22032 U.S.A. smon, mpullen,

More information

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks PP/ Grd-based Overlay Archtecture to Support VoIP Servces n Large Scale IP Networks We Yu *, Srram Chellappan # and Dong Xuan # * Dept. of Computer Scence, Texas A&M Unversty, U.S.A. {weyu}

More information


DYNAMIC ANALYSIS OF WHIPLASH DYNAMIC ANALYSIS OF WHIPLASH by JEFFERY HOOVER A thess submtted n conformty wth the requrements for the degree of Masters of Appled Scence Mechancal and Industral Engneerng Unversty of Toronto Copyrght

More information



More information