Research of PMU Optimal Placement in Power Systems

Size: px
Start display at page:

Download "Research of PMU Optimal Placement in Power Systems"

Transcription

1 Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) Research of PMU Otimal Placement in Power Systems TIAN-TIAN CAI, QIAN AI Deartment of Electrical Engineering Shanghai Jiao tong University Shanghai CHINA Abstract: The analysis of ower system observability and the rules of PMU lacement are concisely resented. Several algorithms of PMU lacement as well as their differences and relations are discussed in details: a grah-theoretic rocedure based on Deth First Search can find the otimal lacement the most quickly; Simulated Annealing Method can hel the algorithm converge to global otimum. Base on these two algorithms, an imroved algorithm: Minimum Sanning Tree Method is roosed. It kees good balance of quality and efficiency of the otimal lacement, and imroves the multiformity of the results by imroving the otimization rule of Deth First Search Method. Key-Words: Phasor Measurement Unit (PMU); Observability; Deth First Search; Simulated Annealing Method; Minimum Sanning Tree; Otimal PMU Placement (OPP) 1 Introduction GPS-based synchronized hasor measurement is a new technique develoed in resent years, which is called one of three front subjects in ower systems [1]. The ower angles and voltage hasors of key buses are very imortant state variables for ower system stability, so they must be monitored accurately. Synchronous Phasor Measurement Unit (PMU) is a new tye of measure unit with high recision, which can succeed in watching the entire system state in real-time directly by monitoring hasors of voltage of the buses. In modern times, ower systems connect each other on a quite big scale, it is uneconomical as well as unnecessary to lace one PMU in one node. So researching of PMU otimal lacement to realize one urose has a very far-reaching meaning. Because of increasingly augmentation of ower network caacity and comlexity of nation ower network interlinkage, monitoring and controlling of ower system stability becomes more and more imortant at resent. Research how to use the least PMU to realize the stability of the whole ower network has the inestimable essentiality and imminency. Paer [2] regards the PMU lacement roblem as the multile targets rogramming issue, one is the least number of PMU, and the other is the most system redundancy of observation after one fault haens (one line sto working). It gets good effect by using descendible algorithm to acquire the Pareto otimal result of the more aim rogramming issue. Paer [3] studies that the least number of PMU in the status of ower flow equation is solvable directly. This aer studies the PMU otimal lacement in the recondition of the observability of the whole ower system. How to select the lacement bus comes down to otimal combined roblem. How to solve this roblem mostly has three methods: enumeration method, elicitation method and search method. The efficiency of enumeration method is a little low. Elicitation methods need to find the given rule to different roblem, which is not strongly general-urose. Search method uses some rules to find the otimal result at random, which can kee good balance of quality and efficiency of the otimal lacement, and be wide alied in many otimal algorithms [4]. This aer introduces three otimal algorithms: deth first search (DFS) method, simulated annealing (SA) method, and minimum sanning tree all belong to search arithmetic. After introducing their characteristic and urose in detail, the simulation results of PMU lacement are analyzed, and rove the algorithms are effective and rofitable. 2 Power system Observability analysis and PMU lacement rules

2 Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) 2.1 Observability analysis The estimate rincile of PMU otimal lacement in ower system mostly is ower system observability. After lace a new PMU, whatever method is used, the observability of ower system must be checked. If the system is observable, then the lacement stos, else the lacement must be continued. For the random inuts, during the limitary time, if the outut can ascertain the inut uniquely, then call the state of ower system is observability. As aer [5] mentions, to review whether the system is observable, we can analyze the system from two oints, namely algebra observability and toology observability. (1) Algebra observability It can describe one ower system with N nodes and m measurements by using the linear metrical equation as follows. z=hx+v (1) Where z is the metrical vector of m dimensions H is the Jacobian matrix of m (2N-1) dimensions x is the voltage vector of 2N-1 dimensions v is the metrical noise vector of m dimensions If the metrical Jacobian matrix is nonsingular and well-conditioned, which satisfies Rank(H) =2N-1,then call the system is algebra observability. (2) Toology observability From grah theory, ower system can take as one grah with N aexes and b margins G = (V,E), V is the set of the aexes, E is the set of the margins, which searately corresond the sets of buses and branches of the system. The metrical network comose a metrical subgrah G =(V,E ), and V V, E E. If the metrical subgrah G and grah G satisfy the relation V V, meaning the subgrah G contains all the aexes of the grah G, and then call the system is toology observability. 2.2 PMU Placement Rules (1) Assign one voltage measurement to a bus where a PMU has been laced, including one current measurement to each branch connected to the bus itself. (2) Assign one voltage seudo- measurement to each node reached by another equied with a PMU. (3) Assign one current seudo- measurement to each branch connecting two buses where voltages are known. This allows interconnecting observed zones. (4) Assign one current seudo-measurement to each branch where current can be indirectly calculated by the Kirchhoff current law (KCL). This rule alies when the current balance at one node is known, i.e. if the node has no ower injections (if N-1 currents insert to the node are known, the last current can be comuted by difference). The seudo-measurement roosed doesn t mean measure directly, but calculate the require measurement indirectly by the KCL, KVL, using the correlative measurements. It can imrove the convergence of the result by alying this rule in a variety of algorithms, so that it can reduce the number of the PMUs, which has the widesread economic racticability. 3 Introduction of Algorithms 3.1 Deth First Search method Deth First Search method (DFS) is alied extensively in earlier time, which is one of the tree search methods of PMU lacement. This method uses only Rules from 1 to 3 (it does not consider ure transit nodes). The first PMU is laced at the bus with the largest number of connected branches. If there is more than one bus with this characteristic, one is randomly chosen. Following PMUs are laced with the same criterion, until the comlete network observability is obtained. The essence of this method exands from the nodes laced the PMU to the seudo-measurement voltage nodes through the measurement or seudo-measurement current branches, and then to all the nodes. The exanded nodes create a metrical tree, if the tree contains all the node of the system, then the system is toology observability, if some node is not contained in the metrical tree, then the system as well as these nodes is not comlete observability. DFS only consider the deth through the rocess of exanding, which makes the observational toologies lay over each other unavoidably and increases the unwanted redundancy. 3.2 Simulated Annealing Method Simulated annealing method is ut forward by Metroolis in It solves the roblems of combination otimization by simulating the hysical anneal rocess of the solid matter (such as metal). In the hysical anneal rocess, usually heat the metal u to melt first, making the articles move freely, namely, the high energy stage, then lower the temerature gradually, making the articles form the

3 Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) crystal lattice of low energy stage. As long as the temerature round the freezing oint dros as slow as ossible, the matter can break away from the local stress to form the ground state crystal of the lowest energy stage. Make the crystal to the otimal result, the cooling rocess and the otimization rocess corresondence; accordingly engender the simulated annealing algorithm. The rocedure can be subdivided into several main stes, as follows. (1) Select an initial condition 0 from the arove solution sace randomly, calculate its target function value f( 0 ), and select the initial control temerature T 0 and the length of Markov Chain; (2) Engender a random disturbance in the arove solution sace, then gain a new state 1, calculate its target function value f( 1 ); (3) Judge whether it satisfyf( 1 )<f( 0 ), if yes, then accet the new state 1 as the current state; if not, then judge whether it satisfy 1 according to Metroolis rule, if yes, then accet the new state 1 as the current state, else accet the state 0 as the current state; (4) Judge whether the samle rocess ends according to some convergence rule, if yes then turn to (5); if not, then turn to (2); (5) Lower the control temerature T according to some annealing roject; (6) Judge whether the annealing rocess ends according to some convergence rule, if yes then turn to (7); if not, then turn to (2); (7) Outut the current solution as the best solution. Aly simulated annealing method in the PMU lacement ractically; the codes are as follows [6]: begin evaluate coverage of PMU lacement set S E : = N - number of buses in the observed region T : = 15 N M : = min{0.002 ν test, M max} Where ν is the size of search lace. test for i : = 1 to 40 do for j : = 1 to M do randomly select a PMU, save the bus location of the selected PMU randomly select a non-pmu bus, evaluate coverage of the modified lacement set E : = N - number of buses in the observed new region if E new = 0 then Return with system observable and the modified lacement set if E : = E new - E if E > 0 then generate a random accet/reject value with a robability ex( ET ) if reject then return selected PMU to revious bus location if if do T : = 0:879T do return with system not observable end 3.3 Minimum Sanning Tree Method Minimum Sanning Tree method (MST) is a modified deth first aroach. The rocedure can be subdivided into three main stes: (1) Generation of N minimum sanning trees: Fig. 1 deicts the flow chart of the minimum sanning tree generation algorithm. The algorithm is erformed N times (N being the number of buses), using as starting bus each bus of the network. (2) Search of alternative atterns: The PMU sets obtained with the ste (1) are rerocessed as follows: one at a time, each PMU of each set is relaced at the buses connected with the node where a PMU was originally set, as deicted in Fig. 1. PMU lacements which lead to a comlete observability are retained. (3) Reducing PMU number in case of ure transit nodes: In this ste it is verified if the network remains observable taking out one PMU at a time from each set, as deicted in Fig. 1. If the network does not resent ure transit nodes, the rocedure ends at ste (2). The lacement sets, which resent the minimum number of PMUs, are finally selected. This method uses the grah theoretic rincile more than deth first method. It finds the bus which maximizes the coverage of the network with the existing PMU's, then set a PMU at the bus. It can reach the comlete convergence, and also make the otimization best.

4 Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) microcomuter with 1.4 G Hz, 256 M EMS memories. The elased time is different for the different comuters, but roortion of time is the same. From Table 1, the seed of DFS method is the fastest, but it needs the most PMUs. There is no difference between SA method and MST method when the number of the system bus is small, but their otimization is also demonstrated. Fig.1 Flow chart of MST method 4.2 Simulation examle 2 IEEE30-bus system is shown in Fig.3, where nodes are ure transit nodes. Aly DFS, SA and MST methods resectively to comlete the simulation. The results are shown in Table 2. 4 Simulation and analysis 4.1 Simulation examle 1 IEEE14-bus system is deicted in Fig.2. Where node 7 is ure transit node, we also call it no load node. There are no loads to consume the ower, no generators to inject the ower either. The ower injected by node 8 and node 4 transmits to node 9 comletely, that is why it named ure transit node. According to PMU lacement rule (4), for node 7, as long as two current branches are known, the left current branch can be calculated by seudomeasurement. DFS, SA and MST methods are used searately to comlete the simulation. The results are shown in Tab.1. Fig.2 IEEE14-bus system Table 1 Results of IEEE14-bus system Method Elased Number of time PMUs Placement DFS 0.701s SA 2.423s MST 4.226s The simulation results are obtained in the Fig.3 IEEE30-bus system Along with the increase of the system buses number and the link comlexity, the defects of DFS method and SA method are gradually evident. In the rocess of otimization it must use PMU lacement rule (4) frequently because of the increasing of the system nodes number esecially of the no load nods number. DFS method does not use the criterion, it just finds the buses which connect with the most branches in the system, that make its result not very ideal and brings unwanted redundancy as well as oor economical efficiency. The number of PMUs that DFS method needs is almost twice which accounts for 40% of the total buses comaring to the two other methods. Table 2 Results of IEEE30-bus system Method Elased time Num. of PMUs No. of rojects DFS 0.471s 12 1 SA 3m s 7 1 Placement MST s 7 9

5 Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) The convergence of SA method result has the close relation with the initial value. It must calculate the whole nodes after setting a PMU because it may engender a new disturbance during the calculation rocess which makes the arameter matrix huge, thus the seed of lacement is restrict. The elased time of it is 3 minutes and 44seconds, as 560 times as DFS method and 13 times as SA method. Furthermore, the diversity of the solution is very oor for DFS method and SA method; they only have one setting roject. MST method can overcome these shortcomings and hold their excellencies at the same time. In the rocess of otimization, MST method assimilates the thought of DFS, but differing from this method, it finds the bus which maximizes the coverage of the network with the existing PMU's not the bus with the largest number of connected branches. When the system reaches a comlete observability, it can reduce PMU number in case of ure transit nodes, which can reduce the redundancy and increase economical efficiency. At the same time, MST method saves each bus which has the same coverage of the network during the rocess of otimization, then find the best setting roject searately, which leads to the multiformity of the result. Tab.3 Projects of otimal lacement of MST Serial Sets number Comarison of Algorithms The otimization roblem of PMU lacement means the minimum number of PMUs n and the most aroriate lace S( n ) which lead to the maximal observability of the network and biggish redundancy of data. J = min{max R( n, S( n ))} st.. f ( n, S( n )) = 1 (2) obs From the oint of view of otimization, the system observability lies on two variables, one is the number of PMUs n, the other is the aggregation of measure lace S( n ). Because there is no means to obtain the minimum number of PMUs n.min directly u to the resent, it deends on iterative algorithm to lough around this kind of roblem. The search lace of n is [0, b], while S( n ) is Cb. Exressions (2) is a kind of non linear combination otimization roblem which is high dimensional and discontinuous. It is imossible to aly the routine of otimal methods to find the comlete otimal solution for it always has a great number of local extreme. It must use modern otimal aroaches esecially DFS and SA methods which have the caability of overall otimization and indeendent on the information such as grads to solve this kind of comlex roblem. DFS method finds the first bus with the largest number of connected branches, and then continues to search in the solution lace from the initial solution with the same criterion, until the comlete network observability is obtained. The stes are as follows: (1) Select the bus with the highest dimension to lace PMU first; (2) Search in the same way as ste (1) and find the measurements, seudo- measurements and extend-measurements, then estimate the degree of system observability; (3) If the comlete network observability is not obtained, do the stes (1) and (2) again to the unobservable area, until the comlete observability is obtained. DFS method only considers the criterion of deth in the rocess, and doesn t do the reetitive oeration, so its oerand is minimal which leads to the highest seed comaring to the other two methods. But its result is not the otimum because its otimization criterion is rigescent and unitary, furthermore it doesn t consider that many measurements of network system can be obtained by seudo-measurements. We can see that the number of PMUs DFS method needs is the most from the examles above, likely severalfold comaring to SA and MST methods when the number of ower system bus increase. It has oor universality only from the oint of view of the economical efficiency. SA aroach has the comlementary effect to DFS method. It is virtually a model of Markov Chain, which is a series of test solutions generated at one time. The result that every test solution generates is deended on the redecessor to a certain degree. This algorithm starts form a given initial solution, roduces an aggregation of candidate solution. It accets the whole candidate solutions, which are better than current solution in the rocess of otimization, and accets inferior solution in a certain robability. This characteristic has the key effect on juming out of local otimization in the n

6 Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) search rocess, but it makes its oerand and solution sace increase leading to the low seed. The seed of SA method has something to do with the number of network buses, also with the number of branches each node connect. It must calls on each node n-1 times at least by SA method. From the simulation results, we can see that the elased time SA aroach uses is the longest comaring to DFS and MST method, esecially in the instance of that the number of system buses is big and the connection of network is comlex. Anneal strategy that can get the ideal structure finally has the same imortant influence on the otimization, which also has the imortant effect on PMU otimal lacement. SA algorithm can find the roject, which can reach the system observability and need the least PMUs. MST method is a modified DFS aroach, it holds the excellence of high seed of DFS, imroves the shortcomings of the oor systematization and comlex arithmetic at the same time. MST method imroves the otimization rule using seudo-measurement, which can find manifold lacement strategy in the context of ensuring the solution sace. As Table 3 shows, it can find as many as 9 otimal setting rojects when the system has 30 buses, which offers the selective multiformity in the actual work. The simulation results have demonstrated that MST method is excelling the other two methods in entirety and multiformity of the results. Now comare the convergent seed, the whole convergence and the multiformity of the results of the three methods in Table 4. Table 4 Comarison of three algorithms Caacity Algorithms Convergent seed Whole convergence Multiformity DFS excellent oor oor SA oor excellent oor MST excellent excellent excellent 6 Conclusions Comare several otimal methods from actual simulated examles, analyse their merits and demerits. On the basis of otimal rincile of DFS method, we can obtain MST method by imroving its otimization criterion. This aroach overcomes the shortcomings of the oor otimization of DFS method and low seed of SA method, kees good balance of quality and efficiency of the otimal lacement, as well as imroves the multiformity of the results. In the actual simulated examles, MST method can obtain the minimum number of setted PMUs on the remise of that the comlete network observability is obtained. The research of PMU is just in the stage of beginning at resent. This aer studies the PMU otimal lacement on the remise of system observability, which has guiding significance and realistic racticability for the stability control of our national ower system network. References: [1] LUO Jian-Yu, WANG Xiao-ying, LU Ting-rui, et al. An Alication of Power System Real-time Dynamic Monitoring System Based on Wide-area Measurement. Automation of Electric Power Systems, 2003,27(24): [2] Milosevic B, Begovic M. Nondominated sorting genetic algorithm for otimal hasor measurement lacement. IEEE Trans on Power Systems, 2003,18(1): [3] Wang Keying, Mu Gang, Han Xueshan et al. Placement of hasor measurement unit for direct solution of ower flow. Proceeding of the CSEE, 1999, 19 (10): [4] Zhou Ming, Sun Shudong. The rincile and Alication of Genetic Algorithms. Beijing: National Defence Industry Press, [5] Sha Zhiming, Hao Yuqian, Hao Yunshan et al. A new algorithm for PMU lacement otimization in ower system. 2005, 4(7): [6] Federico Milano, Power System Analysis Toolbox (PSAT), Documentation for PSAT version 1.3.1, July 14, Coyright 2003, 2004 Federico Milano. [7] Peng Jiangnan, Sun Yuanzhang, Wang Haifeng. An otimal PMU lacement algorithm for full network observability. Automation of Electric Power Systems, 2003,27(4): [8] Baldwin T L, Mili L, Boisen M B, etal. Power System Observability with Minimal Phasor Measurement Placement. IEEE Trans on Power Systems, 1993,8(5): [9] MonticelliA, WuFF. Network Observability Theory. IEEE Transon Power Aaratusand Systems, 1985,4(5): [10] Phadke AG. Synchronized Phasor Measurements in Power Systems. IEEE Comuter Alication in Power, 1993, (4): [11] Burnett RO et al. Synchronized Phasor Measurements of A Power System Event. IEEE Transactions on Power Systems, 1994, 9(8):

MODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL

MODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management

More information

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment

More information

Feedback-error control

Feedback-error control Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller

More information

An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators

An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical

More information

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO) Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment

More information

Oil Temperature Control System PID Controller Algorithm Analysis Research on Sliding Gear Reducer

Oil Temperature Control System PID Controller Algorithm Analysis Research on Sliding Gear Reducer Key Engineering Materials Online: 2014-08-11 SSN: 1662-9795, Vol. 621, 357-364 doi:10.4028/www.scientific.net/kem.621.357 2014 rans ech Publications, Switzerland Oil emerature Control System PD Controller

More information

An Adaptive Three-bus Power System Equivalent for Estimating Voltage Stability Margin from Synchronized Phasor Measurements

An Adaptive Three-bus Power System Equivalent for Estimating Voltage Stability Margin from Synchronized Phasor Measurements An Adative Three-bus Power System Equivalent for Estimating oltage Stability argin from Synchronized Phasor easurements Fengkai Hu, Kai Sun University of Tennessee Knoxville, TN, USA fengkaihu@utk.edu

More information

On split sample and randomized confidence intervals for binomial proportions

On split sample and randomized confidence intervals for binomial proportions On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have

More information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. Score normalization technical details We now discuss the technical details of the score normalization method. SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules

More information

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar 15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider

More information

SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING. Ruhul SARKER. Xin YAO

SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING. Ruhul SARKER. Xin YAO Yugoslav Journal of Oerations Research 13 (003), Number, 45-59 SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING Ruhul SARKER School of Comuter Science, The University of New South Wales, ADFA,

More information

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms

More information

Computer arithmetic. Intensive Computation. Annalisa Massini 2017/2018

Computer arithmetic. Intensive Computation. Annalisa Massini 2017/2018 Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3

More information

A Network-Flow Based Cell Sizing Algorithm

A Network-Flow Based Cell Sizing Algorithm A Networ-Flow Based Cell Sizing Algorithm Huan Ren and Shantanu Dutt Det. of ECE, University of Illinois-Chicago Abstract We roose a networ flow based algorithm for the area-constrained timing-driven discrete

More information

For q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i

For q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:

More information

Power System Reactive Power Optimization Based on Fuzzy Formulation and Interior Point Filter Algorithm

Power System Reactive Power Optimization Based on Fuzzy Formulation and Interior Point Filter Algorithm Energy and Power Engineering, 203, 5, 693-697 doi:0.4236/ee.203.54b34 Published Online July 203 (htt://www.scir.org/journal/ee Power System Reactive Power Otimization Based on Fuzzy Formulation and Interior

More information

Radial Basis Function Networks: Algorithms

Radial Basis Function Networks: Algorithms Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.

More information

MODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS

MODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS MODULAR LINEAR TRANSVERSE FLUX RELUCTANCE MOTORS Dan-Cristian POPA, Vasile IANCU, Loránd SZABÓ, Deartment of Electrical Machines, Technical University of Cluj-Naoca RO-400020 Cluj-Naoca, Romania; e-mail:

More information

DETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS

DETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS Proceedings of DETC 03 ASME 003 Design Engineering Technical Conferences and Comuters and Information in Engineering Conference Chicago, Illinois USA, Setember -6, 003 DETC003/DAC-48760 AN EFFICIENT ALGORITHM

More information

A Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression

A Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Journal of Modern Alied Statistical Methods Volume Issue Article 7 --03 A Comarison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Ghadban Khalaf King Khalid University, Saudi

More information

State Estimation with ARMarkov Models

State Estimation with ARMarkov Models Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,

More information

Hotelling s Two- Sample T 2

Hotelling s Two- Sample T 2 Chater 600 Hotelling s Two- Samle T Introduction This module calculates ower for the Hotelling s two-grou, T-squared (T) test statistic. Hotelling s T is an extension of the univariate two-samle t-test

More information

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points. Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the

More information

A New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search

A New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search A New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search Eduard Babkin and Margarita Karunina 2, National Research University Higher School of Economics Det of nformation Systems and

More information

Linear diophantine equations for discrete tomography

Linear diophantine equations for discrete tomography Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,

More information

Mathematical Efficiency Modeling of Static Power Converters

Mathematical Efficiency Modeling of Static Power Converters Fabrício Hoff Duont Regional Integrated University of Uer Uruguai and Missions (URI Av. Assis Brasil, 9, 980 000 Frederico Westhalen, RS, Brazil Contact: fhd@ieee.org Mathematical Efficiency Modeling of

More information

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca

More information

Multivariable Generalized Predictive Scheme for Gas Turbine Control in Combined Cycle Power Plant

Multivariable Generalized Predictive Scheme for Gas Turbine Control in Combined Cycle Power Plant Multivariable Generalized Predictive Scheme for Gas urbine Control in Combined Cycle Power Plant L.X.Niu and X.J.Liu Deartment of Automation North China Electric Power University Beiing, China, 006 e-mail

More information

On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm

On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,

More information

Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition

Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition TNN-2007-P-0332.R1 1 Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition Haiing Lu, K.N. Plataniotis and A.N. Venetsanooulos The Edward S. Rogers

More information

Indirect Rotor Field Orientation Vector Control for Induction Motor Drives in the Absence of Current Sensors

Indirect Rotor Field Orientation Vector Control for Induction Motor Drives in the Absence of Current Sensors Indirect Rotor Field Orientation Vector Control for Induction Motor Drives in the Absence of Current Sensors Z. S. WANG *, S. L. HO ** * College of Electrical Engineering, Zhejiang University, Hangzhou

More information

An Analysis of Reliable Classifiers through ROC Isometrics

An Analysis of Reliable Classifiers through ROC Isometrics An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit

More information

Recent Developments in Multilayer Perceptron Neural Networks

Recent Developments in Multilayer Perceptron Neural Networks Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael

More information

COMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS

COMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender

More information

Deriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.

Deriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &

More information

A New GP-evolved Formulation for the Relative Permittivity of Water and Steam

A New GP-evolved Formulation for the Relative Permittivity of Water and Steam ew GP-evolved Formulation for the Relative Permittivity of Water and Steam S. V. Fogelson and W. D. Potter rtificial Intelligence Center he University of Georgia, US Contact Email ddress: sergeyf1@uga.edu

More information

Decoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version

Decoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 3, MAY 1998 133 Decoding Linear Block Codes Using a Priority-First Search Performance Analysis Subotimal Version Yunghsiang S. Han, Member, IEEE, Carlos

More information

Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process

Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process P. Mantalos a1, K. Mattheou b, A. Karagrigoriou b a.deartment of Statistics University of Lund

More information

Monopolist s mark-up and the elasticity of substitution

Monopolist s mark-up and the elasticity of substitution Croatian Oerational Research Review 377 CRORR 8(7), 377 39 Monoolist s mark-u and the elasticity of substitution Ilko Vrankić, Mira Kran, and Tomislav Herceg Deartment of Economic Theory, Faculty of Economics

More information

Tests for Two Proportions in a Stratified Design (Cochran/Mantel-Haenszel Test)

Tests for Two Proportions in a Stratified Design (Cochran/Mantel-Haenszel Test) Chater 225 Tests for Two Proortions in a Stratified Design (Cochran/Mantel-Haenszel Test) Introduction In a stratified design, the subects are selected from two or more strata which are formed from imortant

More information

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4 Discrete Adative Transmission for Fading Channels Lang Lin Λ, Roy D. Yates, Predrag Sasojevic WINLAB, Rutgers University 7 Brett Rd., NJ- fllin, ryates, sasojevg@winlab.rutgers.edu Abstract In this work

More information

Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition

Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition Haiing Lu, K.N. Plataniotis and A.N. Venetsanooulos The Edward S. Rogers Sr. Deartment of

More information

Improved Capacity Bounds for the Binary Energy Harvesting Channel

Improved Capacity Bounds for the Binary Energy Harvesting Channel Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,

More information

Finding Shortest Hamiltonian Path is in P. Abstract

Finding Shortest Hamiltonian Path is in P. Abstract Finding Shortest Hamiltonian Path is in P Dhananay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune, India bstract The roblem of finding shortest Hamiltonian ath in a eighted comlete grah belongs

More information

Approximating min-max k-clustering

Approximating min-max k-clustering Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost

More information

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment

More information

Eigenanalysis of Finite Element 3D Flow Models by Parallel Jacobi Davidson

Eigenanalysis of Finite Element 3D Flow Models by Parallel Jacobi Davidson Eigenanalysis of Finite Element 3D Flow Models by Parallel Jacobi Davidson Luca Bergamaschi 1, Angeles Martinez 1, Giorgio Pini 1, and Flavio Sartoretto 2 1 Diartimento di Metodi e Modelli Matematici er

More information

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers

More information

integral invariant relations is not limited to one or two such

integral invariant relations is not limited to one or two such The Astronomical Journal, 126:3138 3142, 2003 December # 2003. The American Astronomical Society. All rights reserved. Printed in U.S.A. EFFICIENT ORBIT INTEGRATION BY SCALING AND ROTATION FOR CONSISTENCY

More information

Frequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer

Frequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer Frequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer C.P. an + F. Crusca # M. Aldeen * + School of Engineering, Monash University Malaysia, 2 Jalan Kolej, Bandar Sunway, 4650 Petaling,

More information

SHAPE OPTOMIZATION OF H-BEAM FLANGE FOR MAXIMUM PLASTIC ENERGY DISSIPATION

SHAPE OPTOMIZATION OF H-BEAM FLANGE FOR MAXIMUM PLASTIC ENERGY DISSIPATION The Fourth China-Jaan-Korea Joint Symosium on Otimization of Structural and Mechanical Systems Kunming, Nov. 6-9, 2006, China SHAPE OPTOMIZATION OF H-BEAM FLANGE FOR MAXIMUM PLASTIC ENERGY DISSIPATION

More information

Time Frequency Aggregation Performance Optimization of Power Quality Disturbances Based on Generalized S Transform

Time Frequency Aggregation Performance Optimization of Power Quality Disturbances Based on Generalized S Transform Time Frequency Aggregation Perormance Otimization o Power Quality Disturbances Based on Generalized S Transorm Mengda Li Shanghai Dianji University, Shanghai 01306, China limd @ sdju.edu.cn Abstract In

More information

An Improved Calibration Method for a Chopped Pyrgeometer

An Improved Calibration Method for a Chopped Pyrgeometer 96 JOURNAL OF ATMOSPHERIC AND OCEANIC TECHNOLOGY VOLUME 17 An Imroved Calibration Method for a Choed Pyrgeometer FRIEDRICH FERGG OtoLab, Ingenieurbüro, Munich, Germany PETER WENDLING Deutsches Forschungszentrum

More information

Network Configuration Control Via Connectivity Graph Processes

Network Configuration Control Via Connectivity Graph Processes Network Configuration Control Via Connectivity Grah Processes Abubakr Muhammad Deartment of Electrical and Systems Engineering University of Pennsylvania Philadelhia, PA 90 abubakr@seas.uenn.edu Magnus

More information

On Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.**

On Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.** On Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.** * echnology and Innovation Centre, Level 4, Deartment of Electronic and Electrical Engineering, University of Strathclyde,

More information

Journal of Chemical and Pharmaceutical Research, 2014, 6(5): Research Article

Journal of Chemical and Pharmaceutical Research, 2014, 6(5): Research Article Available online www.jocr.com Journal of Chemical and harmaceutical Research, 04, 6(5):904-909 Research Article ISSN : 0975-7384 CODEN(USA) : JCRC5 Robot soccer match location rediction and the alied research

More information

2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.

2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S. -D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear

More information

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu

More information

John Weatherwax. Analysis of Parallel Depth First Search Algorithms

John Weatherwax. Analysis of Parallel Depth First Search Algorithms Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel

More information

Information collection on a graph

Information collection on a graph Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements

More information

dn i where we have used the Gibbs equation for the Gibbs energy and the definition of chemical potential

dn i where we have used the Gibbs equation for the Gibbs energy and the definition of chemical potential Chem 467 Sulement to Lectures 33 Phase Equilibrium Chemical Potential Revisited We introduced the chemical otential as the conjugate variable to amount. Briefly reviewing, the total Gibbs energy of a system

More information

Preconditioning techniques for Newton s method for the incompressible Navier Stokes equations

Preconditioning techniques for Newton s method for the incompressible Navier Stokes equations Preconditioning techniques for Newton s method for the incomressible Navier Stokes equations H. C. ELMAN 1, D. LOGHIN 2 and A. J. WATHEN 3 1 Deartment of Comuter Science, University of Maryland, College

More information

Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doped Fiber Amplifier

Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doped Fiber Amplifier Australian Journal of Basic and Alied Sciences, 5(12): 2010-2020, 2011 ISSN 1991-8178 Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doed Fiber Amlifier

More information

EXACTLY PERIODIC SUBSPACE DECOMPOSITION BASED APPROACH FOR IDENTIFYING TANDEM REPEATS IN DNA SEQUENCES

EXACTLY PERIODIC SUBSPACE DECOMPOSITION BASED APPROACH FOR IDENTIFYING TANDEM REPEATS IN DNA SEQUENCES EXACTLY ERIODIC SUBSACE DECOMOSITION BASED AROACH FOR IDENTIFYING TANDEM REEATS IN DNA SEUENCES Ravi Guta, Divya Sarthi, Ankush Mittal, and Kuldi Singh Deartment of Electronics & Comuter Engineering, Indian

More information

STABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS

STABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS STABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS Massimo Vaccarini Sauro Longhi M. Reza Katebi D.I.I.G.A., Università Politecnica delle Marche, Ancona, Italy

More information

Model checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]

Model checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle] Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear

More information

AN OPTIMAL CONTROL CHART FOR NON-NORMAL PROCESSES

AN OPTIMAL CONTROL CHART FOR NON-NORMAL PROCESSES AN OPTIMAL CONTROL CHART FOR NON-NORMAL PROCESSES Emmanuel Duclos, Maurice Pillet To cite this version: Emmanuel Duclos, Maurice Pillet. AN OPTIMAL CONTROL CHART FOR NON-NORMAL PRO- CESSES. st IFAC Worsho

More information

Convex Optimization methods for Computing Channel Capacity

Convex Optimization methods for Computing Channel Capacity Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem

More information

Deformation Effect Simulation and Optimization for Double Front Axle Steering Mechanism

Deformation Effect Simulation and Optimization for Double Front Axle Steering Mechanism 0 4th International Conference on Comuter Modeling and Simulation (ICCMS 0) IPCSIT vol. (0) (0) IACSIT Press, Singaore Deformation Effect Simulation and Otimization for Double Front Axle Steering Mechanism

More information

Generation of Linear Models using Simulation Results

Generation of Linear Models using Simulation Results 4. IMACS-Symosium MATHMOD, Wien, 5..003,. 436-443 Generation of Linear Models using Simulation Results Georg Otte, Sven Reitz, Joachim Haase Fraunhofer Institute for Integrated Circuits, Branch Lab Design

More information

Chapter 7 Rational and Irrational Numbers

Chapter 7 Rational and Irrational Numbers Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers

More information

Solution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0

Solution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0 Advanced Finite Elements MA5337 - WS7/8 Solution sheet This exercise sheets deals with B-slines and NURBS, which are the basis of isogeometric analysis as they will later relace the olynomial ansatz-functions

More information

COMPLEX-VALUED ASSOCIATIVE MEMORIES WITH PROJECTION AND ITERATIVE LEARNING RULES

COMPLEX-VALUED ASSOCIATIVE MEMORIES WITH PROJECTION AND ITERATIVE LEARNING RULES JAISCR, 2018, Vol 8, o 3, 237 249 101515/jaiscr-2018-0015 COMPLEX-VALUED ASSOCIATIVE MEMORIES WITH PROJECTIO AD ITERATIVE LEARIG RULES Teijiro Isokawa 1, Hiroki Yamamoto 1, Haruhiko ishimura 2, Takayuki

More information

Scaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling

Scaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling Scaling Multile Point Statistics or Non-Stationary Geostatistical Modeling Julián M. Ortiz, Steven Lyster and Clayton V. Deutsch Centre or Comutational Geostatistics Deartment o Civil & Environmental Engineering

More information

Chapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population

Chapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population Chater 7 and s Selecting a Samle Point Estimation Introduction to s of Proerties of Point Estimators Other Methods Introduction An element is the entity on which data are collected. A oulation is a collection

More information

The extreme case of the anisothermal calorimeter when there is no heat exchange is the adiabatic calorimeter.

The extreme case of the anisothermal calorimeter when there is no heat exchange is the adiabatic calorimeter. .4. Determination of the enthaly of solution of anhydrous and hydrous sodium acetate by anisothermal calorimeter, and the enthaly of melting of ice by isothermal heat flow calorimeter Theoretical background

More information

Construction of High-Girth QC-LDPC Codes

Construction of High-Girth QC-LDPC Codes MITSUBISHI ELECTRIC RESEARCH LABORATORIES htt://wwwmerlcom Construction of High-Girth QC-LDPC Codes Yige Wang, Jonathan Yedidia, Stark Draer TR2008-061 Setember 2008 Abstract We describe a hill-climbing

More information

Node-voltage method using virtual current sources technique for special cases

Node-voltage method using virtual current sources technique for special cases Node-oltage method using irtual current sources technique for secial cases George E. Chatzarakis and Marina D. Tortoreli Electrical and Electronics Engineering Deartments, School of Pedagogical and Technological

More information

Discrete Particle Swarm Optimization for Optimal DG Placement in Distribution Networks

Discrete Particle Swarm Optimization for Optimal DG Placement in Distribution Networks Discrete Particle Swarm Otimization for Otimal DG Placement in Distribution Networs Panaj Kumar, Student Member, IEEE, Nihil Guta, Member, IEEE, Anil Swarnar, Member, IEEE, K. R. Niazi, Senior Member,

More information

CHAPTER 5 STATISTICAL INFERENCE. 1.0 Hypothesis Testing. 2.0 Decision Errors. 3.0 How a Hypothesis is Tested. 4.0 Test for Goodness of Fit

CHAPTER 5 STATISTICAL INFERENCE. 1.0 Hypothesis Testing. 2.0 Decision Errors. 3.0 How a Hypothesis is Tested. 4.0 Test for Goodness of Fit Chater 5 Statistical Inference 69 CHAPTER 5 STATISTICAL INFERENCE.0 Hyothesis Testing.0 Decision Errors 3.0 How a Hyothesis is Tested 4.0 Test for Goodness of Fit 5.0 Inferences about Two Means It ain't

More information

Metrics Performance Evaluation: Application to Face Recognition

Metrics Performance Evaluation: Application to Face Recognition Metrics Performance Evaluation: Alication to Face Recognition Naser Zaeri, Abeer AlSadeq, and Abdallah Cherri Electrical Engineering Det., Kuwait University, P.O. Box 5969, Safat 6, Kuwait {zaery, abeer,

More information

A Parallel Algorithm for Minimization of Finite Automata

A Parallel Algorithm for Minimization of Finite Automata A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 E-mail: fravi,xiongg@cs.uri.edu Abstract In this

More information

On parameter estimation in deformable models

On parameter estimation in deformable models Downloaded from orbitdtudk on: Dec 7, 07 On arameter estimation in deformable models Fisker, Rune; Carstensen, Jens Michael Published in: Proceedings of the 4th International Conference on Pattern Recognition

More information

Entransy analysis of open thermodynamic systems

Entransy analysis of open thermodynamic systems Article Engineering hermohysics August 0 Vol.57 No.: 934940 doi: 0.007/s434-0-54-x Entransy analysis of oen thermodynamic systems CHENG Xueao, WANG WenHua & LIANG XinGang * Key Laboratory for hermal Science

More information

On Doob s Maximal Inequality for Brownian Motion

On Doob s Maximal Inequality for Brownian Motion Stochastic Process. Al. Vol. 69, No., 997, (-5) Research Reort No. 337, 995, Det. Theoret. Statist. Aarhus On Doob s Maximal Inequality for Brownian Motion S. E. GRAVERSEN and G. PESKIR If B = (B t ) t

More information

A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST BASED ON THE WEIBULL DISTRIBUTION

A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST BASED ON THE WEIBULL DISTRIBUTION O P E R A T I O N S R E S E A R C H A N D D E C I S I O N S No. 27 DOI:.5277/ord73 Nasrullah KHAN Muhammad ASLAM 2 Kyung-Jun KIM 3 Chi-Hyuck JUN 4 A MIXED CONTROL CHART ADAPTED TO THE TRUNCATED LIFE TEST

More information

arxiv: v1 [physics.data-an] 26 Oct 2012

arxiv: v1 [physics.data-an] 26 Oct 2012 Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch

More information

Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations

Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations PINAR KORKMAZ, BILGE E. S. AKGUL and KRISHNA V. PALEM Georgia Institute of

More information

NEW DIFFERENTIAL DATA ANALYSIS METHOD IN THE ACTIVE THERMOGRAPHY.

NEW DIFFERENTIAL DATA ANALYSIS METHOD IN THE ACTIVE THERMOGRAPHY. Proceedings 3rd Annual Conference IEEE/EMBS Oct.5-8, 001, Istanbul, TURKEY 1 of 4 NEW DIFFERENTIAL DATA ANALYSIS METHOD IN THE ACTIVE THERMOGRAPHY. J. Rumiński, M. Kaczmarek, A. Nowakowski Deartment of

More information

MODEL-BASED MULTIPLE FAULT DETECTION AND ISOLATION FOR NONLINEAR SYSTEMS

MODEL-BASED MULTIPLE FAULT DETECTION AND ISOLATION FOR NONLINEAR SYSTEMS MODEL-BASED MULIPLE FAUL DEECION AND ISOLAION FOR NONLINEAR SYSEMS Ivan Castillo, and homas F. Edgar he University of exas at Austin Austin, X 78712 David Hill Chemstations Houston, X 77009 Abstract A

More information

KEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS

KEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS 4 th International Conference on Earthquake Geotechnical Engineering June 2-28, 27 KEY ISSUES IN THE ANALYSIS OF PILES IN LIQUEFYING SOILS Misko CUBRINOVSKI 1, Hayden BOWEN 1 ABSTRACT Two methods for analysis

More information

Neural network models for river flow forecasting

Neural network models for river flow forecasting Neural network models for river flow forecasting Nguyen Tan Danh Huynh Ngoc Phien* and Ashim Das Guta Asian Institute of Technology PO Box 4 KlongLuang 220 Pathumthani Thailand Abstract In this study back

More information

Power System Dynamics Prediction with Measurement-Based AutoRegressive Model

Power System Dynamics Prediction with Measurement-Based AutoRegressive Model 21, rue d Artois, F-75008 PARIS CIGRE US National Committee htt : //www.cigre.org 2014 Grid of the Future Symosium Power System Dynamics Prediction with Measurement-Based AutoRegressive Model C. LI 1*,

More information

Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks

Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks Efficient Aroximations for Call Admission Control Performance Evaluations in Multi-Service Networks Emre A. Yavuz, and Victor C. M. Leung Deartment of Electrical and Comuter Engineering The University

More information

Synthesis of Moore FSM with Expanded Coding Space

Synthesis of Moore FSM with Expanded Coding Space Volume 3 Issue, January 24 Synthesis of oore FS with Exanded Coding Sace Olena Hebda, Larysa Titarenko Institute of Comuter Engineering and Electronics University of Zielona Góra Zielona Góra, Poland Email:

More information

1-way quantum finite automata: strengths, weaknesses and generalizations

1-way quantum finite automata: strengths, weaknesses and generalizations 1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum

More information

q-ary Symmetric Channel for Large q

q-ary Symmetric Channel for Large q List-Message Passing Achieves Caacity on the q-ary Symmetric Channel for Large q Fan Zhang and Henry D Pfister Deartment of Electrical and Comuter Engineering, Texas A&M University {fanzhang,hfister}@tamuedu

More information

PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM

PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM PERFORMANCE BASED DESIGN SYSTEM FOR CONCRETE MIXTURE WITH MULTI-OPTIMIZING GENETIC ALGORITHM Takafumi Noguchi 1, Iei Maruyama 1 and Manabu Kanematsu 1 1 Deartment of Architecture, University of Tokyo,

More information

Lilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3

Lilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3 Pesquisa Oeracional (2013) 33(1): 123-132 2013 Brazilian Oerations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF

More information

Observer/Kalman Filter Time Varying System Identification

Observer/Kalman Filter Time Varying System Identification Observer/Kalman Filter Time Varying System Identification Manoranjan Majji Texas A&M University, College Station, Texas, USA Jer-Nan Juang 2 National Cheng Kung University, Tainan, Taiwan and John L. Junins

More information