S. Malasri, D.A.Halijan and M.L.Keough Department of Civil Engineering Christian Brothers University Memphis, TN Abstract

Size: px
Start display at page:

Download "S. Malasri, D.A.Halijan and M.L.Keough Department of Civil Engineering Christian Brothers University Memphis, TN 38104. Abstract"

Transcription

1 S. Malasr, D.A.Haljan and M.L.Keough Department of Cvl Engneerng Chrstan Brothers Unversty Memphs, TN Abstract Ths paper demonstrates an applcaton of the natural selecton process to the desgn of structural members. Renforced concrete beam desgn s used as the example to show how varous chromosomes representng a desgn soluton can be formulated. Ftter chromosomes (or better solutons) have a better chance of beng selected for cross over; ths n turn creates better generatons. Random mutaton s used to enhance the dversty of the populaton. The evoluton progresses through several generatons, and the best soluton s then used n the desgn. The method gves reasonable results, but sometmes a local (as opposed to the global) optmzed soluton s obtaned. Introducton Structural engneers tradtonally desgn structural elements based on a tral-and-error process. An educated guess s made for a tral sze of the member, then the performance s checked. Adjustments are then made for the next tral. An experenced desgner normally starts wth a reasonable tral sze whch a good desgn s obtaned after a few teratons. For a typcal new desgner, ths process can become tedous. In recent years, genetc algorthms (GA) have been used n varous optmzaton problems (Mchalewcz, 1992). Structural desgn s another form of an optmzaton problem, n whch the desgner looks for the optmal soluton (or a near-optmal soluton) under a set of constrants. Ths paper demonstrates that GA can be appled to structural desgn problems by usng the desgn of a renforced concrete beam as an example. desgn. Chromosome Formulaton. In desgnng a rectangular renforced concrete beam for bendng strength, the desgn soluton conssts of the secton dmensons (wdth and effectve depth) and the steel area, as shown n Fg. l(a) "b" s the secton wdth, "d M s the secton effectve depth (the dstance from the extreme compresson fber to the centrod of the tenson steel), and "A,"s the area of renforcng steel. Materals and Methods The evoluton process starts wth a randomly created frst generaton. Ageneraton conssts of a constant populaton sze, n whch an ndvdual n the populaton s represented by a chromosome. Each chromosome, consstng of genes, represents a desgn soluton. A ftness value s then evaluated for each chromosome. Ftter chromosomes are assgned greater probabltes to be selected as parents for the next generaton. Some of these selected chromosomes exchange genes wth others durng the crossover stage. Some genes are also randomly mutated. The process repeats through several generatons. The fttest chromosome s then used as the desgn soluton. followng sectons wll descrbe the detals of ths rocess n the context of renforced concrete beam the Fg. 1. Renforced Concrete Beam: (a) Dmensons, (b) Stresses, and (c) Forces. Thus, a chromosome must consst of three sets of genes representng these three quanttes. In ths partcular mplementaton, each of these sets s represented by 12 bnary dgts, whch gves the maxmum decmal number of Ths maxmum number s then dvded by 100, so each parameter s n the range of 0 to Ths range covers most of the practcal problems. Fg. 2 shows a chromosome wth ts genes and the parameter range. The Frst Generaton. Populaton n the frst generaton s created usng random numbers. To avod startng the sequence of random numbers at the same locaton 111

2 every tme the program s executed, the current mnute from the computer tme clock s used as the seed value for the random number generator. If"r" s the random number generated for a gene, the value of the j-thgene of the -th chromosome (geney) s determned based on the followng rule: Ifr < 0.5 then gene y = 0, otherwse gene j: 1, 0 <= r <= 1 Fg. 2. Chromosome, genes and parameter range. Ftness Evaluaton. Once the populaton n a generaton s defned, the ftness of each chromosome can be evaluated. For the renforced concrete beam problem, the ftness s determned based on ts bendng strenth M d ), the secton proporton (wdth/depth rato), and the steel rato (A,/(bd)). The bendng strength s gven by the followng equaton whch was derved from engneerng mechancs (Nawy, 1990) based on the stress and force dagrams shown n Fg. 1(b) and (c). M d = (0.9) (A/y ) (d-a/2) There are several combnatons of secton dmensons and steel renforcement that provde suffcent bendng strength. Larger sectons requre less steel, whle smaller sectons requre more steel. There are mnmum and maxmum lmts on the steel renforcement set by the Amercan Concrete Insttute (Amercan Concrete Insttute, 1989) to avod the sudden falure of concrete beams. Steel rato s used n the comparson wth these lmts, as shown below: 200/f y <= As /(bd) <= 0.75(0.85) 8^(87000) / (f y (87000+f y )) B! = (f c -4000)/1000 and 0.65 <= B! <= 0.85 The ftness of a chromosome s then determned from the followng rules: 1. The smaller the dfference ofm d and M u, the hgher the ftness. When M d s less than M u, a penalty s appled. 2. The closer the b/d rato s to 0.5, the hgher the ftness. 3. When the steel rato exceeds the maxmum or mnmum lmts, a penalty s appled. Based on these general rules, the ftness s determned by: Ftness = 106 /( jmd -M u j)/( D.5-b/d D/p^pg = Absolute value Pj = Penalty factor forbendng capacty IfM d M u, then p=l, otherwse pj=2 (form d < MJ p 2 = Penalty factor for steel renforcement Ifthe steel rato s wthn the mnmum and maxmum lmts, P2 = l,otherwse P2 = 1O 106 = Scalng factor to make sure that the ftness value s not too small? V» fy = yeld strength of renforcng steel a 7 = (As f y )/(0.85f c b) and f c = concrete strength at 28 days Ths M d s then compared wth the requred moment (M u ) whch s specfed as part of the nput data. IfM d s greater than or equal to M u, then the secton s acceptable; otherwse, the secton s rejected. There are dfferent secton proportons that provde le desred strength. When "b" s too large compared wth "d", the secton s not economcal. On the other land, when "b" s too small compared wth "d", the seeon s too slender and lateral bucklng can occur. For a ractcal desgn, many desgners keep the wdth/depth ato around 0.5. Populaton Selecton. Once the ftness for each chromosome has been evaluated, they are selected accordng to a probablty weghng scheme as an magnary spnner. The ftter chromosomes occupy larger areas on the spnner. In ths mplementaton, the relatve probablty s used to represent these areas on the spnner. Let ps be the probablty of the -th chromosome. Thus, pj can be computed from the followng equaton: = Ftness/Ftness gen, P Ftnessj = Ftness of the -th chromosome, and Ftness = gen Summaton ofall ftnesses of the generaton. * - < - 112

3 Let n be the number of chromosomes n a generaton (populaton sze). The spnner s spun "n" tmes, durng whch the new populaton s selected. The -th chromosome s selected from a spn fthe random number, r, satsfes the followngcondton: ( Pl +p pu) < r <= (p!+p P) Cross Over. After the spnner s spun and a new pool of chromosomes s selected, a number of chromosomes (based on the probablty of crossover specfed by the user) s selected for cross over. A cross over locaton s randomly determned. The two randomly selected chromosomes exchange ther genes from ths locaton to the rest of the chromosome. The two new chromosomes (offsprng) are tfen used to replace the orgnal two parents. Ifthe two parent chromosomes, each wth 15 genes, are: , and , and the crossover locaton s rght after the 6th gene, the two offsprngs, whch replace the two parents become: , and Mutaton. Mutaton s the process n whch some genes change ther genetc codes. In ths mplementaton, mutaton causes a gene to change ts value from 0 to 1, or vce versa. After several generatons, t s possble that a soluton whch s superor to the others but not really acceptable could take control of the entre populaton by Ipreadng ts genetc codes to others. A better soluton ould then become mpossble. Mutaton njects dversty ) the populaton and often helps to move the evoluton ut from a local optmum stuaton. Results and Dscusson IAs an example, a beam s to be desgned for a bendng oment (M u ) of 2,000,000 lb-n (226 kn-m) usng the concrete strength (f c ) of 4,000 ps (27.6 MPa) and the steel yeld strength (f) of 60,000 ps (414 Mpa), as shown n Fg. 3. Rectangular Beam Desgner - (c) 1994 by S. Malasr Concrete Strength - fc (ps) :? 4000 Steel YeldStrength - fy (ps) :? Requred Moment - Mu(n-lb) :? Press any key to contnue Fg. 3. Input screen. Other nput parameters ncludng the populaton sze, the crossover probablty, the mutaton probablty, and the number of generatons are shown n Fg. 4. After 20 generatons, a 11.96" by 30.29" secton s obtaned wth the moment capacty (M d ) of 2,013,032 n-lb (whch s very close to the requred M u ). The steel rato (Rho) of s also wthn the mnmum steel rato of and the maxmum steel rato of The wdth/depth rato s 0.39 whch s not too far from the desred 0.5. Ths, n fact, s a good desgn. Fg. 4. Screen Showng the Evoluton Process Results. and Ten consecutve runs were made usng dfferent values of populaton sze, crossover and mutaton probabltes, and number of generatons. They are summarzed n Table 1. Most of the runs gve good desgns, except for the followng: 1) Run number 3 has the steel rato of whch s lower than the mnmum of allowed by the Amercan Concrete Insttute Code. The desgn engneer would reject ths desgn. 2) Run number 6 has the steel rato of whch s greater than the maxmum of Ths s not too bad, snce theoretcally, the maxmum steel rato n ths case can go up to However, a conservatve desgner would reject ths desgn. 3) Run numbers 7 and 9 are unnecessarly large, snce they gve the bendng capacty of over 3,000,000 n-lb as compared to the requred moment of 2,000,000 n-lb. Ths soluton s safe but uneconomcal. Out of these 10 runs, sx gve acceptable solutons, two gve safe but uneconomcal solutons, one gves a workng soluton wth less safety margn, and one gves an undesrable soluton. Three of the four runs that have problems (run numbers 3, 7, and 9) use the same populaton sze of 50. Ths populaton sze probably does not provde Proceedngs Arkansas Academy ofscence, Vol.48,

4 114 enough dversty. By ncreasng the mutaton probablty from 0.1 to 0.2 as n run number 10, an acceptable soluton s obtaned. Table 2 shows the evoluton process that took place n run number 10. The soluton starts from a very large secton n the frst generaton that gves almost sx tmes the desred bendng capacty to an acceptable soluton after 9 generatons. After the only mnor changes occur untl the 51st generaton. No better soluton was found from the 51st generaton to the 100th generaton. Table 1. Varous Runs for the Same Desgn Problems. Input*: No. Populaton Crossover Mutaton Number of Sze Probablty Probablty Generatons * Other nput data s shown n Fg. 3. Output: No. Secton b/d M d Steel A s bxd n-lb Rato** n " x 18.02" ,066, " x 19.90" ,071, " x 40.94" ,034, " x 13.93" ,059, *** 11.96" x 30.29" ,013, " x 15.35" ,051, " x 26.18" ,479, " x 23.05" ,046, " x 27.65" ,789, " x 17.93" ,099, ** Mnmum Steel Rato = , Maxmum Steel Rato = *** Also shown n Fg. 4. Table 2. Evolvng from an IntalRandom Soluton to an Acceptable Soluton. Generaton Secton Md (n-lb) Steel " x38.75" 11,473, " x 16.35" 3,372, " x 14.29" 674, " x38.77" 1,948, " x 18.09" 2,307, " x 14.29" 1,609, " x 18.09" 2,114, " x 18.09" 2,128, " x 18.09" 2,123, " x 17.93" 2,092, " x 17.93" 2,087, " x 17.93" 2,099, Concluson Ths paper demonstrates that t s possble to automate the desgn process usng the evoluton process as seen n the renforced concrete beam desgn example. The cumulatve selecton (as opposed to pure random selecton) s a very powerful mechansm n evoluton. As shown n the example, acceptable solutons are obtaned quckly (wthn 20 generatons). In ths problem, the goal s to optmze the bendng capacty wth the three constrants: M d s greater or equal to M u, secton proporton s around 0.5, and steel rato should le wthn the acceptable range. For a more complex problem wth more constrants, more generatons may be needed. To a structural engneer, the desgn of a renforced concrete beam s a smple problem and many desgn ads are avalable. But for other more complex problems desgn ads are not avalable and a resonable tral secton s hard to guess, ths evoluton approach becomes very useful. The current work ncludes the desgn of structural steel columns. Ths problem has more complex constrants. For example, steel sectons come n standard szes, a data base of the avalable standard secton must be checked. Ths puts severe restrctons to the corss over and mutaton mechansms. Lterature Cted Amercan Concrete Insttute Buldng code requrements for renforced concrete and

5 115 commentary. Amercan concrete nsttute, Detrot, 353 pp. Mchalewcz, Z Genetc algorthms + Data structures = evoluton programs. Sprnger-Verlag, New York, 259 pp. Nawy, E.G Renforced concrete a fundamental approach, 2nd edton. Prentce Hall,Englewood Clffs,734 pp. Proceedngs Arkansas Academy of Scence, Vol. 48, 1994

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

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

More information

Mooring Pattern Optimization using Genetic Algorithms

Mooring Pattern Optimization using Genetic Algorithms 6th World Congresses of Structural and Multdscplnary Optmzaton Ro de Janero, 30 May - 03 June 005, Brazl Moorng Pattern Optmzaton usng Genetc Algorthms Alonso J. Juvnao Carbono, Ivan F. M. Menezes Luz

More information

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

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

More information

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

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

More information

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

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

More information

Calculation of Sampling Weights

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

More information

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

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

More information

The OC Curve of Attribute Acceptance Plans

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

More information

SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS

SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS SCHEDULING OF CONSTRUCTION PROJECTS BY MEANS OF EVOLUTIONARY ALGORITHMS Magdalena Rogalska 1, Wocech Bożeko 2,Zdzsław Heduck 3, 1 Lubln Unversty of Technology, 2- Lubln, Nadbystrzycka 4., Poland. E-mal:rogalska@akropols.pol.lubln.pl

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

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

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES

A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES 82 Internatonal Journal of Electronc Busness Management, Vol. 0, No. 3, pp. 82-93 (202) A GENETIC ALGORITHM-BASED METHOD FOR CREATING IMPARTIAL WORK SCHEDULES FOR NURSES Feng-Cheng Yang * and We-Tng Wu

More information

1 Example 1: Axis-aligned rectangles

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

More information

Response Coordination of Distributed Generation and Tap Changers for Voltage Support

Response Coordination of Distributed Generation and Tap Changers for Voltage Support Response Coordnaton of Dstrbuted Generaton and Tap Changers for Voltage Support An D.T. Le, Student Member, IEEE, K.M. Muttaq, Senor Member, IEEE, M. Negnevtsky, Member, IEEE,and G. Ledwch, Senor Member,

More information

Recurrence. 1 Definitions and main statements

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

More information

J. Parallel Distrib. Comput.

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

More information

Global Optimization Algorithms with Application to Non-Life Insurance

Global Optimization Algorithms with Application to Non-Life Insurance Global Optmzaton Algorthms wth Applcaton to Non-Lfe Insurance Problems Ralf Kellner Workng Paper Char for Insurance Economcs Fredrch-Alexander-Unversty of Erlangen-Nürnberg Verson: June 202 GLOBAL OPTIMIZATION

More information

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers

A Load-Balancing Algorithm for Cluster-based Multi-core Web Servers Journal of Computatonal Informaton Systems 7: 13 (2011) 4740-4747 Avalable at http://www.jofcs.com A Load-Balancng Algorthm for Cluster-based Mult-core Web Servers Guohua YOU, Yng ZHAO College of Informaton

More information

SETTLEMENT PREDICTION OF PILE-SUPPORTED STRUCTURES IN LIQUEFIABLE SOILS DURING EARTHQUAKE

SETTLEMENT PREDICTION OF PILE-SUPPORTED STRUCTURES IN LIQUEFIABLE SOILS DURING EARTHQUAKE SETTLEMENT PREDICTION OF PILE-SUPPORTED STRUCTURES IN LIQUEFIABLE SOILS DURING EARTHQUAKE Chandra Dev Raman 1, Subhamoy Bhattacharya 2 and A Blakeborough 3 1 Research Scholar, Department of Engneerng Scence,Unversty

More information

Ants Can Schedule Software Projects

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

More information

GENETIC ALGORITHM FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY

GENETIC ALGORITHM FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY Int. J. Mech. Eng. & Rob. Res. 03 Fady Safwat et al., 03 Research Paper ISS 78 049 www.jmerr.com Vol., o. 3, July 03 03 IJMERR. All Rghts Reserved GEETIC ALGORITHM FOR PROJECT SCHEDULIG AD RESOURCE ALLOCATIO

More information

Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

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

More information

Software project management with GAs

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

More information

Ant Colony Optimization for Economic Generator Scheduling and Load Dispatch

Ant Colony Optimization for Economic Generator Scheduling and Load Dispatch Proceedngs of the th WSEAS Int. Conf. on EVOLUTIONARY COMPUTING, Lsbon, Portugal, June 1-18, 5 (pp17-175) Ant Colony Optmzaton for Economc Generator Schedulng and Load Dspatch K. S. Swarup Abstract Feasblty

More information

Using Multi-objective Metaheuristics to Solve the Software Project Scheduling Problem

Using Multi-objective Metaheuristics to Solve the Software Project Scheduling Problem Usng Mult-obectve Metaheurstcs to Solve the Software Proect Schedulng Problem Francsco Chcano Unversty of Málaga, Span chcano@lcc.uma.es Francsco Luna Unversty of Málaga, Span flv@lcc.uma.es Enrque Alba

More information

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

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

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

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

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

More information

Sciences Shenyang, Shenyang, China.

Sciences Shenyang, Shenyang, China. Advanced Materals Research Vols. 314-316 (2011) pp 1315-1320 (2011) Trans Tech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.314-316.1315 Solvng the Two-Obectve Shop Schedulng Problem n MTO Manufacturng

More information

An Analysis of Dynamic Severity and Population Size

An Analysis of Dynamic Severity and Population Size An Analyss of Dynamc Severty and Populaton Sze Karsten Wecker Unversty of Stuttgart, Insttute of Computer Scence, Bretwesenstr. 2 22, 7565 Stuttgart, Germany, emal: Karsten.Wecker@nformatk.un-stuttgart.de

More information

Implementation of Deutsch's Algorithm Using Mathcad

Implementation of Deutsch's Algorithm Using Mathcad Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

More information

Mining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System

Mining Feature Importance: Applying Evolutionary Algorithms within a Web-based Educational System Mnng Feature Importance: Applyng Evolutonary Algorthms wthn a Web-based Educatonal System Behrouz MINAEI-BIDGOLI 1, and Gerd KORTEMEYER 2, and Wllam F. PUNCH 1 1 Genetc Algorthms Research and Applcatons

More information

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

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

More information

Blending Roulette Wheel Selection & Rank Selection in Genetic Algorithms

Blending Roulette Wheel Selection & Rank Selection in Genetic Algorithms Internatonal Journal of Machne Learnng and Computng, Vol. 2, o. 4, August 2012 Blendng Roulette Wheel Selecton & Rank Selecton n Genetc Algorthms Rakesh Kumar, Senor Member, IACSIT and Jyotshree, Member,

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

Comparison between the Provisions of the Egyptian Code of Practice and the Eurocodes for Reinforced Concrete Structures Design

Comparison between the Provisions of the Egyptian Code of Practice and the Eurocodes for Reinforced Concrete Structures Design Comparson between the Provsons of the Egyptan Code of Practce and the Eurocodes for Renforced Concrete Structures Desgn El-Shennawy, Ahmed (ASH) 1 ; Boros, Vazul (VB) 2 ; Novák, Balthasar (BN) 3 1 German

More information

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

An Alternative Way to Measure Private Equity Performance

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

More information

Patterns Antennas Arrays Synthesis Based on Adaptive Particle Swarm Optimization and Genetic Algorithms

Patterns Antennas Arrays Synthesis Based on Adaptive Particle Swarm Optimization and Genetic Algorithms IJCSI Internatonal Journal of Computer Scence Issues, Vol. 1, Issue 1, No 2, January 213 ISSN (Prnt): 1694-784 ISSN (Onlne): 1694-814 www.ijcsi.org 21 Patterns Antennas Arrays Synthess Based on Adaptve

More information

Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network

Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network JOURNAL OF COMPUTERS, VOL. 3, NO. 8, AUGUST 2008 77 Selfsh Constrant Satsfacton Genetc Algorthm for Plannng a Long-dstance Transportaton Network Takash Onoyama and Takuya Maekawa Htach Software Engneerng

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Proceedings of the Annual Meeting of the American Statistical Association, August 5-9, 2001

Proceedings of the Annual Meeting of the American Statistical Association, August 5-9, 2001 Proceedngs of the Annual Meetng of the Amercan Statstcal Assocaton, August 5-9, 2001 LIST-ASSISTED SAMPLING: THE EFFECT OF TELEPHONE SYSTEM CHANGES ON DESIGN 1 Clyde Tucker, Bureau of Labor Statstcs James

More information

Activity Scheduling for Cost-Time Investment Optimization in Project Management

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

More information

Project Networks With Mixed-Time Constraints

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

More information

Optimization Model of Reliable Data Storage in Cloud Environment Using Genetic Algorithm

Optimization Model of Reliable Data Storage in Cloud Environment Using Genetic Algorithm Internatonal Journal of Grd Dstrbuton Computng, pp.175-190 http://dx.do.org/10.14257/gdc.2014.7.6.14 Optmzaton odel of Relable Data Storage n Cloud Envronment Usng Genetc Algorthm Feng Lu 1,2,3, Hatao

More information

Damage detection in composite laminates using coin-tap method

Damage detection in composite laminates using coin-tap method Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The con-tap test has the

More information

A SURVEY ON REACTIVE POWER OPTIMIZATION AND VOLTAGE STABILITY IN POWER SYSTEMS

A SURVEY ON REACTIVE POWER OPTIMIZATION AND VOLTAGE STABILITY IN POWER SYSTEMS Internatonal Journal on Techncal and Physcal Problems of Engneerng (IJTPE) Publshed by Internatonal Organzaton of IOTPE ISSN 077-358 IJTPE Journal www.otpe.com jtpe@otpe.com March 014 Issue 18 Volume 6

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

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

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

A COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM

A COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM A COPMARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM Rana Hassan * Babak Cohanm Olver de Weck Massachusetts Insttute of Technology, Cambrdge, MA, 39 Gerhard Venter Vanderplaats Research

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

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

More information

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

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

More information

Fatigue Assessment of Concrete Foundations for Wind Power Plants

Fatigue Assessment of Concrete Foundations for Wind Power Plants Fatgue Assessment of Concrete Foundatons for Wnd Power Plants Master of Scence Thess n the Master s Programme Structural Engneerng and Buldng Performance Desgn FRIDA GÖRANSSON, ANNA NORDENMARK Department

More information

Optimal Choice of Random Variables in D-ITG Traffic Generating Tool using Evolutionary Algorithms

Optimal Choice of Random Variables in D-ITG Traffic Generating Tool using Evolutionary Algorithms Optmal Choce of Random Varables n D-ITG Traffc Generatng Tool usng Evolutonary Algorthms M. R. Mosav* (C.A.), F. Farab* and S. Karam* Abstract: Impressve development of computer networks has been requred

More information

Formulating & Solving Integer Problems Chapter 11 289

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

More information

Scatter search approach for solving a home care nurses routing and scheduling problem

Scatter search approach for solving a home care nurses routing and scheduling problem Scatter search approach for solvng a home care nurses routng and schedulng problem Bouazza Elbenan 1, Jacques A. Ferland 2 and Vvane Gascon 3* 1 Département de mathématque et nformatque, Faculté des scences,

More information

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia

NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate

More information

A Binary Particle Swarm Optimization Algorithm for Lot Sizing Problem

A Binary Particle Swarm Optimization Algorithm for Lot Sizing Problem Journal o Economc and Socal Research 5 (2), -2 A Bnary Partcle Swarm Optmzaton Algorthm or Lot Szng Problem M. Fath Taşgetren & Yun-Cha Lang Abstract. Ths paper presents a bnary partcle swarm optmzaton

More information

Support Vector Machines

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

More information

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

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

More information

Computer-assisted Auditing for High- Volume Medical Coding

Computer-assisted Auditing for High- Volume Medical Coding Computer-asssted Audtng for Hgh-Volume Medcal Codng Computer-asssted Audtng for Hgh- Volume Medcal Codng by Danel T. Henze, PhD; Peter Feller, MS; Jerry McCorkle, BA; and Mark Morsch, MS Abstract The volume

More information

An efficient constraint handling methodology for multi-objective evolutionary algorithms

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

More information

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES

FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EK-MUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan

More information

Optimization of Renewable Energy Systems: The Case of Desalination

Optimization of Renewable Energy Systems: The Case of Desalination Optmzaton of Renewable Energy Systems: The Case of Desalnaton 5 Karm Bouroun Ecole Natonale d Ingéneurs de Tuns, Tunsa 1. Introducton The applcaton of renewable energes (RE) for drvng desalnaton unts (DES)

More information

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

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

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A BCD DECADE COUNTERS/ 4-BIT BINARY COUNTERS The LS160A/ 161A/ 162A/ 163A are hgh-speed 4-bt synchronous counters. They are edge-trggered, synchronously presettable, and cascadable MSI buldng blocks for

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000 Problem Set 5 Solutons 1 MIT s consderng buldng a new car park near Kendall Square. o unversty funds are avalable (overhead rates are under pressure and the new faclty would have to pay for tself from

More information

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent

More information

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

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

More information

Hollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA )

Hollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA ) February 17, 2011 Andrew J. Hatnay ahatnay@kmlaw.ca Dear Sr/Madam: Re: Re: Hollnger Canadan Publshng Holdngs Co. ( HCPH ) proceedng under the Companes Credtors Arrangement Act ( CCAA ) Update on CCAA Proceedngs

More information

Demographic and Health Surveys Methodology

Demographic and Health Surveys Methodology samplng and household lstng manual Demographc and Health Surveys Methodology Ths document s part of the Demographc and Health Survey s DHS Toolkt of methodology for the MEASURE DHS Phase III project, mplemented

More information

Jet Engine. Figure 1 Jet engine

Jet Engine. Figure 1 Jet engine Jet Engne Prof. Dr. Mustafa Cavcar Anadolu Unversty, School of Cvl Avaton Esksehr, urkey GROSS HRUS INAKE MOMENUM DRAG NE HRUS Fgure 1 Jet engne he thrust for a turboet engne can be derved from Newton

More information

What is Candidate Sampling

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

More information

Cooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing

Cooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing Cooperatve Load Balancng n IEEE 82.11 Networks wth Cell Breathng Eduard Garca Rafael Vdal Josep Paradells Wreless Networks Group - Techncal Unversty of Catalona (UPC) {eduardg, rvdal, teljpa}@entel.upc.edu;

More information

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

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

More information

Improved Mining of Software Complexity Data on Evolutionary Filtered Training Sets

Improved Mining of Software Complexity Data on Evolutionary Filtered Training Sets Improved Mnng of Software Complexty Data on Evolutonary Fltered Tranng Sets VILI PODGORELEC Insttute of Informatcs, FERI Unversty of Marbor Smetanova ulca 17, SI-2000 Marbor SLOVENIA vl.podgorelec@un-mb.s

More information

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

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

More information

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

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

More information

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

More information

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

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

More information

Form-finding of grid shells with continuous elastic rods

Form-finding of grid shells with continuous elastic rods Page of 0 Form-fndng of grd shells wth contnuous elastc rods Jan-Mn L PhD student Insttute of Buldng Structures and Structural Desgn (tke), Unversty Stuttgart Stuttgar, Germany quantumamn@gmal.com Jan

More information

The Effect of Mean Stress on Damage Predictions for Spectral Loading of Fiberglass Composite Coupons 1

The Effect of Mean Stress on Damage Predictions for Spectral Loading of Fiberglass Composite Coupons 1 EWEA, Specal Topc Conference 24: The Scence of Makng Torque from the Wnd, Delft, Aprl 9-2, 24, pp. 546-555. The Effect of Mean Stress on Damage Predctons for Spectral Loadng of Fberglass Composte Coupons

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

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

More information

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

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

More information

Enabling P2P One-view Multi-party Video Conferencing

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

More information

Investigation of Modified Bee Colony Algorithm with Particle and Chaos Theory

Investigation of Modified Bee Colony Algorithm with Particle and Chaos Theory Internatonal Journal of Control and Automaton, pp. 311-3 http://dx.do.org/10.1457/jca.015.8..30 Investgaton of Modfed Bee Colony Algorthm wth Partcle and Chaos Theory Guo Cheng Shangluo College, Zhangye,

More information

1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.

1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1. HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher

More information

How To Calculate The Accountng Perod Of Nequalty

How To Calculate The Accountng Perod Of Nequalty Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

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

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

Sample Design in TIMSS and PIRLS

Sample Design in TIMSS and PIRLS Sample Desgn n TIMSS and PIRLS Introducton Marc Joncas Perre Foy TIMSS and PIRLS are desgned to provde vald and relable measurement of trends n student achevement n countres around the world, whle keepng

More information

Research on Transformation Engineering BOM into Manufacturing BOM Based on BOP

Research on Transformation Engineering BOM into Manufacturing BOM Based on BOP Appled Mechancs and Materals Vols 10-12 (2008) pp 99-103 Onlne avalable snce 2007/Dec/06 at wwwscentfcnet (2008) Trans Tech Publcatons, Swtzerland do:104028/wwwscentfcnet/amm10-1299 Research on Transformaton

More information

1. Math 210 Finite Mathematics

1. Math 210 Finite Mathematics 1. ath 210 Fnte athematcs Chapter 5.2 and 5.3 Annutes ortgages Amortzaton Professor Rchard Blecksmth Dept. of athematcal Scences Northern Illnos Unversty ath 210 Webste: http://math.nu.edu/courses/math210

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

Sngle Snk Buy at Bulk Problem and the Access Network

Sngle Snk Buy at Bulk Problem and the Access Network A Constant Factor Approxmaton for the Sngle Snk Edge Installaton Problem Sudpto Guha Adam Meyerson Kamesh Munagala Abstract We present the frst constant approxmaton to the sngle snk buy-at-bulk network

More information