A Multi-objective Genetic Algorithm for Reliability Optimization Problem
|
|
- Delilah Dorsey
- 5 years ago
- Views:
Transcription
1 International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR KISHOR 1, SHIV PRASAD YADAV 1 KUMAR 2* and SURENDRA 1 Department of Mathematic, I.I.T Roorkee, Roorkee, India: Department of Electrical Engineering, I.I.T Roorkee, Roorkee, India: (Received on November 1, 2007; Final Reviion on October 24, 2008) Abtract: Thi paper conider the allocation of maximum reliability to a complex ytem, while minimizing the cot of the ytem, a type of multi-objective optimization problem (MOOP). Multi-objective Evolutionary Algorithm (MOEA) have been hown in the lat few year a powerful technique to olve MOOP.Thi paper uccefully applie a Nondominated orting genetic algorithm (NSGA-II) technique to obtain the Pareto optimal olution of a complex ytem reliability optimization problem under fuzzy environment in which the tatement might be vague or imprecie. Deciionmaker (DM) could chooe, in a poteriori deciion environment, the mot convenient optimal olution according to hi/her level of atifaction. The efficiency of NSGA-II in olving thi problem i demontrated by comparing it reult with thoe of imulated annealing (SA) and nonequilibrium imulated annealing (NESA). Keyword: Reliability optimization, fuzzy optimization, multi-objective optimization problem (MOOP), genetic algorithm (GA), nondominated orting genetic algorithm (NSGA-II) 1. Introduction In the broadet ene, reliability can be defined a meaure of performance of ytem. A ytem have grown more complex, the conequence of their unreliable behavior have become evere in term of cot, effort, live etc. and the interet in aeing ytem reliability along with it improvement ha become very important. Unlike conventional optimization method where it i aumed that all deign data are preciely known and objective are well defined and eay to formulate, many practical optimization problem e.g., reliability optimization, there are incompletene and unreliability of input information. The reaon for unreliability can be many uch a; uncertainty in judgment, lack of evidence, etc. Further more, a DM often ha vague deire uch a, thi objective function hould be le than or greater than or equal to thi certain value. Fuzzy et theory [1] i effectual in handling thee cae. In reliability optimization problem, it i often required to minimize or maximize everal objective ubject to everal contraint. Such problem i formulated a multi-objective optimization problem (MOOP). A MOOP can be olved in two way; firt one i to olve it by tranforming the MOOP into ingle objective problem uing poitive weight (for objective) and penaltie (for contraint), and the other one which i alo better i to obtain a Pareto-optimal olution which give a DM uitable range of choice to adjut trade off between different * Correponding author urendra_iitr@yahoo.com 227
2 228 Amar Kihor, Shiv Praad Yadav and Surendra Kumar objective. Sakawa [2] ued the urrogate worth trade off method to a multi-objective formulation of a reliability allocation problem to maximize the ytem reliability while minimizing the ytem cot. Huang [3] tackled fuzzy multi-objective optimization deciion-making problem on the erie reliability ytem with two objective. Ravi et al. [4] and [5] implemented imulated annealing (SA) algorithm for everal reliability optimization problem. Mahapatra et al. [6] propoed a new fuzzy multi-objective optimization method to olve reliability optimization problem having everal conflicting objective. Genetic algorithm (GA) are well-known tochatic method of global optimization baed on the evolution theory of Darwin and have uccefully been applied in different real-world application including reliability optimization. Since GA work with a population of point, a number of Pareto-optimal olution may be captured uing GA, making it a very powerful tool alo for MOOP. The Non-dominated Sorting Genetic Algorithm (NSGA-II) [7] i a well known and extenively ued algorithm baed on it predeceor NSGA [8]. It i a fat and very efficient Multi-objective evolutionary algorithm (MOEA), which incorporate the feature an elitit archive and a rule for adaptation aignment that take into account both the rank and the ditance of each olution regarding other. Daniel et al. [9] ha applied and compared the efficiency of NSGA-II with exiting method for different reliability optimization problem without including fuzzy environment. Thi paper ue a fuzzy atificing method projected and applied by Huang [3], Ravi et al. [4-5] to tranform the multi-objective reliability optimization problem into fuzzy optimization problem uing linear memberhip function. Then NSGA-II i employed to the reulting fuzzified problem to obtain the Pareto olution becaue NSGA-II i one of the mot popular multi-objective optimization algorithm applied uccefully for variou real world problem. Thi paper ugget ue of NSGA-II to obtain the Pareto-optimal olution unlike Ravi et al. [5] who olved the problem uing NESA. The DM can chooe appropriate olution from the group of Pareto-optimal olution obtained. If the DM i not atified with any of them, then he/he can eek a final olution by modifying parameter interactively according to hi/her preference. 2. The Mathematical Model of Problem Let R j and C j be the reliability and cot of j th component of the ytem and R and C denote the total reliability and cot of the ytem. It i often required to conider, in addition to maximization of ytem reliability, the minimization of the cot. Mathematically, thi problem can be expreed a n R for erie ytem j = 1 j n Maximize R ( R, R, R,..., R ) 1 (1 R ) for parallel ytem n = j 1 j = or combination of erie and parallel ytem n Minimize C ( R, R, R,..., R ) C ( R ) n = j = 1 j ubject to: R j,min R j 1, R,min R 1 for j=1,2,,n
3 A Multi-objective Genetic Algorithm for Reliability Optimization Problem 229 where n repreent total number of component in the ytem while R j,min and R,min are minimum value for the j th component and ytem repectively. Here, we conider a complex ytem which repreent a block diagram of reliability of a life-upport ytem in a pace capule. Fig. 1 how the ytem The mathematical model for the life upport ytem in a pace capule can be formulated uing the block diagram (ee Fig. 1) a follow: 2 2 Maximize R (R) = 1 R ((1 R )(1 R )) (1 R )[1 R (1 (1 R )(1 R ))] (1) α 4 j Minimize C (R) = 2. K R j j j = 1 ubject to : 0.5 R R R R 1 for j = 1,2,3,4. j,min j,min j where different parameter value are K j a 100, 100, 200, 150 repectively and all equal to Genetic Algorithm Fig. 1: Life-upport ytem in a pace capule (2) α j Genetic algorithm have been uccefully applied a an optimization technique. GA introduced by Holland [10] and further decribed by Goldberg [11] and Deb [12], mimic natural election or Darwinian Theory of urvival of the fittet. The baic GA methodology can be preented in the following form 1. Set population ize, tournament ize, croover rate, mutation rate, mutation exponent and elitim ize. Set the parameter of the topping criterion. 2. Initialize the population with random number. 3. Compute the fitne function value. Perform election, croover, mutation and elitim in order to create a new population. 4. If the topping criterion i not atified, return to tep 3. Otherwie, chooe the bet individual found a the final olution. 4. Nondominated Sorting Genetic Algorithm (NSGA-II) There were ome major drawback in NSGA uch a
4 230 Amar Kihor, Shiv Praad Yadav and Surendra Kumar High computational complexity of non-dominated orting. Lack of elitim. Lack of pecification of haring parameter. Deb et al. [7] propoed an improved verion of NSGA [8], called NSGA-II which dealt all the drawback of original NSGA. NSGA-II incorporate an archive and a rule for adaptation aignment that take into account both the rank and the ditance of each olution. Let P t repreent the current population during any generation t, and P A t the population which conit of non-dominated olution archive. The Peudo code for NSGA-II can be tated a follow Input: N (Population ize) M (Archive ize) t max (maximum number of generation) Begin: Randomly initialize P A t, et P 0 = Ø, t=0 while t < t max P t =P t + P A t Aign adaptation to P t P A t+1 ={ M bet individual from P t } Mating Pool={ N individual randomly elected from P A t+1 uing a binary tournament} P t+1 = { N new individual generated by applying recombination (croover and mutation) on Mating Pool t= t +1 Output: Non-dominated olution from P A t 5. Methodology Preent methodology to olve a multi-objective reliability optimization problem conit of following tep Step 1) Fuzzification: Fuzzification of the problem with the help of a linear memberhip function. Step 2) Problem Reformulation: Converion of multi-objective crip reliability optimization problem into fuzzified MOOP of memberhip function. Step 3) Solution: Finding the olution of the reulting MOOP uing NSGA-II decribed in ection 4. Now preent methodology i applied to olve the multi-objective reliability optimization problem of life-upport ytem in a pace capule. 5.1 Fuzzification Let f % and f % be the fuzzy region of atifaction of ytem reliability (R 1 2 ) and ytem cot (C ) repectively and µ % ( R ) and f1 µ % ( C ) be their correponding memberhip function where R and C are defined in (1) and (2). Then µ % ( R ) i defined a f2 f1
5 A Multi-objective Genetic Algorithm for Reliability Optimization Problem if R 0.9 µ ( R ) f % 1 = R (3) if 0.9 R if R if C 641 µ ( C ) f % 2 = 700 C (4) if 641 C if C 700 Parameter for linear memberhip function ued in equation (3 and 4) are taken from Ravi et al. [4-5]. The above formulation repreent fuzzy repreentation for a complex ytem (fig. 1) in term of reliability and cot. DM want to optimize the ytem reliability within 0.9 and 0.99 while maintaining the cot between 641 to 700 unit thu making it a multiobjective problem having two objective function namely reliability (R ) and cot (C ). 5.2 Problem Reformulation Optimal deciion i made by electing the bet alternative from the fuzzy deciion pace D characterized by the memberhip function µ D. In other word, the problem i to find the optimum R* which maximize µ D where µ D [0,1] where R* i the deciion variable, R*=( R 1,R 2,, R 4 ). Within the frame work of Bellman and Zadeh [13] model, and following Zimmermann [14] the optimal olution i obtained by maximizing µ D where µ = µ % ( R ) * µ % ( C ) and * repreent the operator ued in the deciion. In the preent D f1 f2 paper thi problem i olved in purely multiobjective manner. So the reformulated fuzzy problem can be mathematically expreed a Maximize ( µ % ( R ), µ % ( C ) ) (5) f1 Subject to: 0.5 R j 1 j = 1,2,3,4 f2 5.3 Solution of MOOP A NSGA-II i employed to olve the reulting MOOP maximization problem of memberhip function. Varying the different parameter (croover probability, mutation probability, population ize, croover and mutation index, etc.) of NSGA-II different Pareto-optimal front can be obtained. Baed on rigorou experimentation and tuning of the parameter ome better optimal front have been reported here. 6. Reult and Dicuion To olve the tranformed problem (5) NSGA-II ha been applied. Parameter of NSGA-II uch a population ize N, maximum number of generation t max, croover probability p c and mutation probability p m. Different Pareto-optimal front can be obtained varying thee parameter. Thi paper dicue few better one out of them after a number of experimental run. Cae-1 If population ize N i being fixed at 100 and number of generation t max equal to 300 while croover probability (p c ) equal to 0.9 and mutation probability (p m ) = 0.02 then reulting Pareto olution i given in Fig. 2.
6 232 Amar Kihor, Shiv Praad Yadav and Surendra Kumar Cae-2 For Pareto-optimal olution obtained in Fig. 3, NSGA-II parameter uch a p c i taken 0.9 again while p m i 0.03 and population ize N of 200 for 500 (t max ) generation. Similarly many Pareto optimal olution of thi problem can be achieved. More point on Pareto curve require bigger population ize. Table 1 how the top 15 coordinate of the Fig 2. Earlier Ravi et al. [4-5] olved the ame problem uing SA [4] and NESA [5] repectively. Ravi et al. in [4] tackled the problem a ingle objective formulation uing SA while they olved the ame in [5] uing multi-objective formulation and NESA under fuzzy environment. Preent reult are better than thoe obtained by Ravi et al. [4], a it provide the DM more choice. Alo preent methodology provide Pareto optimal front in a ingle run of algorithm (NSGA-II) unlike [5] which need different value of memberhip function of the fuzzy et deciion for different run. It alo improve the accuracy of reult obtained compared to [5] a it provide the reult up to 6 decimal place (ee Table 1) unlike [5] which gave reult up to 5 decimal place only. Hence thi approach i much more efficient and flexible, and thu provide a better range of choice out of which DM can chooe the preferred olution interactively Cot Reliability 7. Concluion Fig. 2: Pareto-optimal front by NSGA-II for Cae-1 A real life reliability optimization problem of a life-upport ytem in a pace capule under fuzzy environment ha been dicued here. Ravi et al.[5] olved the ame problem uing NESA. Thi paper olve the problem uing NSGA-II which i highly efficient for continuou multi-objective optimization problem a it provide a deciion maker more flexibility in obtaining Pareto-optimal front. Alo preent methodology provide Pareto optimal front in a ingle run of algorithm (NSGA-II) unlike [5] which need different value of memberhip function of the fuzzy et deciion for different run. Alo accuracy of the reult ha been increaed. Therefore, the paper prove the effectivene of NSGA-II for continuou multi-objective optimization problem.
7 A Multi-objective Genetic Algorithm for Reliability Optimization Problem Cot Reliability Fig. 3: Pareto-optimal front by NSGA-II for Cae-2 Table 1: Coordinate of lat 15 point i R (i) C (i) R 1 R 2 R 3 R Reference [1] Zadeh L. A., Fuzzy et, Inf. Control, Vol. 8, no. 3, pp , [2] Sakawa M., Multi-objective optimization by the urrogate worth trade-off method, IEEE Tranaction on Reliability, R-27, pp ,1978. [3] Huang H.Z., Fuzzy multi-objective optimization deciion-making of reliability of erie ytem, Microelectronic Reliability, Vol. 37 (3), pp , [4] Ravi V., Murty B. S. N., and Reddy P. J., Nonequilibrium imulated annealingalgorithm applied to reliability optimization of complex ytem, IEEE Tran. Rel., Vol. 46, pp , 1997.
8 234 Amar Kihor, Shiv Praad Yadav and Surendra Kumar [5] Ravi V., Reddy P. J., and Zimmermann Han-Jurgen., Fuzzy global optimization of complex ytem reliability, IEEE Tran. Rel., Vol. 8, pp , [6] Mahapatra G.S. and Roy T.K., Fuzzy multi-objective mathematical programming on reliability optimization model, Applied Mathematic and Computation, Vol. 174, pp , [7] Deb K, Pratap A, Agarwal S and Meyarivan T. A fat and elitit multiobjective genetic algorithm: NSGA-II, Kanpur Genetic Algorithm Laboratory (KanGAL), Indian Intitute of Technology, KanGAL Report No , [8] Sriniva N. and Deb K., Multiobjective function optimization uing nondominated orting in genetic algorithm, Evol. Comput., Vol. 2, no. 3, pp , [9] Salazar Daniel, Rocco C. M. and Galvan B. J., Optimization of contrained multiple-objective reliability problem uing evolutionary algorithm, Reliability Engineering and Sytem Safety, Vol. 91, pp , [10] Holland J. H., Adaptation in natural and artificial ytem, The Univerity of Michigan Pre, [11] Goldberg D., Genetic Algorithm in Search, Optimization and Machine Learning, Addion Weley Pre, [12] Deb K., Optimization for engineering deign: algorithm and example, Prentice- Hall, [13] Bellman R. E. and Zadeh L. Z., Deciion making in a fuzzy environment, Management Sci., Vol. 17, pp. B , [14] Zimmermann H.-J., Fuzzy Set Theory and Application, 2 nd ed. Boton, MA: Kluwer Amar Kihor i a Reearch Scholar in the Department of Mathematic at Indian Intitute of Technology Roorkee, Roorkee, India. He hold M.Sc. in Mathematic from Banara Hindu Univerity, Varanai, India. Hi current reearch area include Reliability Optimization, Genetic Algorithm and Fuzzy Optimization. Shiv Praad Yadav i an Aociate Profeor of Mathematic at Indian Intitute of Technology Roorkee, Roorkee, India. He hold Ph.D. in Mathematic with concentration on Optimal Control Theory from Intitute of Technology, Banara Hindu Univerity, India. Hi current reearch area include Optimal Control, Operation Reearch, Data Envelopment Analyi, Fuzzy Mathematic and Reliability Optimization. Surendra Kumar i an Aitant Profeor of Electrical Engineering at Indian Intitute of Technology Roorkee, Roorkee, India. He hold a Ph.D. in Electrical Engineering with concentration on Sytem Modeling and Optimization from Indian Intitute of Technology Roorkee, Roorkee, India. Hi current reearch area include PID Control, Fuzzy and Neural Control, Fuzzy Reliability, Reliability Optimization and Robotic.
Universität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationw w w. a j e r. o r g Page 98 Montreal, Canada) Corresponding Author: Essa Abrahim Abdulgader Saleem
American Journal of Engineering Reearch (AJER) e-issn: 2320-0847 p-issn : 2320-0936 Volume-6, Iue-10, pp-98-107 www.ajer.org Reearch Paper Open Acce Multi-objective optimization of multi-tate reliability
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationData Mining with Linguistic Thresholds
Int. J. Contemp. Math. Science, Vol. 7, 22, no. 35, 7-725 Data Mining with Linguitic Threhold Tzung-Pei Hong Department of Electrical Engineering National Univerity of Kaohiung Kaohiung, Taiwan, R.O.C.
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationPROBLEM -1. where S. C basis x. 0, for entering
ISSN: 77754 ISO 9:8 Certified Volume 4 Iue 8 February 5 Optimum Solution of Linear Programming Problem by New Method Putta aburao; Supriya N. Khobragade and N.W.Khobragade Department of Mathematic RTM
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationLecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization
Lecture Outline Global flow analyi Global Optimization Global contant propagation Livene analyi Adapted from Lecture by Prof. Alex Aiken and George Necula (UCB) CS781(Praad) L27OP 1 CS781(Praad) L27OP
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationGenetic Algorithms for Optimal Scheduling of Chlorine Dosing in Water Distribution Systems
oz343 Genetic Algorithm for Optimal Scheduling of hlorine Doing in Water Ditribution Sytem arl Rouhiainen, urtin Univerity, rouhiacj@e.curtin.edu.au Moe O. Tade, urtin Univerity, tadem@che.curtin.edu.au
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: www.ijarcm.com
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationA Hybrid Deployable Dynamic Traffic Assignment Framework for Robust Online Route Guidance
A Hybrid Deployable Dynamic Traffic Aignment Framework for Robut Online Route Guidance Sriniva Peeta School of Civil Engineering, Purdue Univerity Chao Zhou Sabre, Inc. Sriniva Peeta School of Civil Engineering
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationThe Optimization Analysis of Navigation Performance and Structural Properties of the High-Speed Monohull Ship in River
Available online at www.ciencedirect.com Phyic Procedia 33 (2012 ) 833 839 2012 International Conference on Medical Phyic and Biomedical Engineering The Optimization Analyi of Navigation Performance and
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationAnalysis of slope stability
Engineering manual No. 8 Updated: 02/2016 Analyi of lope tability Program: Slope tability File: Demo_manual_08.gt In thi engineering manual, we are going to how you how to verify the lope tability for
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationMinimum Energy Reliable Paths Using Unreliable Wireless Links
Minimum Energy Reliable Path Uing Unreliable Wirele Link Qunfeng Dong Department of Computer Science Univerity of Wiconin-Madion Madion, Wiconin 53706 qunfeng@c.wic.edu Micah Adler Department of Computer
More informationDistribution-based Microdata Anonymization
Ditribution-baed Microdata Anonymization Nick Kouda niverity of Toronto kouda@c.toronto.edu Ting Yu North Carolina State niverity yu@cc.ncu.edu Diveh Srivatava AT&T Lab Reearch diveh@reearch.att.com Qing
More informationEvolution of Non-Deterministic Incremental Algorithms. Hugues Juille. Volen Center for Complex Systems. Brandeis University. Waltham, MA
Evolution of Non-Determinitic Incremental Algorithm a a New Approach for Search in State Space Hugue Juille Computer Science Department Volen Center for Complex Sytem Brandei Univerity Waltham, MA 02254-9110
More informationResearch Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks
International Optic Volume 0, Article ID 9, page http://dxdoiorg/0/0/9 Reearch Article Longet Path Reroute to Optimize the Optical Multicat Routing in Spare Splitting WDM Network Huanlin Liu, Hongyue Dai,
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationREVERSE KINEMATIC ANALYSIS OF THE SPATIAL SIX AXIS ROBOTIC MANIPULATOR WITH CONSECUTIVE JOINT AXES PARALLEL
Proceeding of the ASME 007 International Deign Engineering Technical Conference & Computer and Information in Engineering Conference IDETC/CIE 007 September 4-7, 007 La Vega, Nevada, USA DETC007-34433
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationThe Comparison of Neighbourhood Set and Degrees of an Interval Graph G Using an Algorithm
The Comparion of Neighbourhood Set and Degree of an Interval Graph G Uing an Algorithm Dr.A.Sudhakaraiah, K.Narayana Aitant Profeor, Department of Mathematic, S.V. Univerity, Andhra Pradeh, India Reearch
More informationIntegrated Single-arm Assembly and Manipulation Planning using Dynamic Regrasp Graphs
Proceeding of The 2016 IEEE International Conference on Real-time Computing and Robotic June 6-9, 2016, Angkor Wat, Cambodia Integrated Single-arm Aembly and Manipulation Planning uing Dynamic Regrap Graph
More informationINVERSE DYNAMIC SIMULATION OF A HYDRAULIC DRIVE WITH MODELICA. α Cylinder chamber areas ratio... σ Viscous friction coefficient
Proceeding of the ASME 2013 International Mechanical Engineering Congre & Expoition IMECE2013 November 15-21, 2013, San Diego, California, USA IMECE2013-63310 INVERSE DYNAMIC SIMULATION OF A HYDRAULIC
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationOptimizing Synchronous Systems for Multi-Dimensional. Notre Dame, IN Ames, Iowa computation is an optimization problem (b) circuit
Optimizing Synchronou Sytem for ulti-imenional pplication Nelon L. Pao and Edwin H.-. Sha Liang-Fang hao ept. of omputer Science & Eng. ept. of Electrical & omputer Eng. Univerity of Notre ame Iowa State
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More information3-D Visualization of a Gene Regulatory Network: Stochastic Search for Layouts
3-D Viualization of a Gene Regulatory Network: Stochatic Search for Layout Naoki Hooyama Department of Electronic Engineering, Univerity of Tokyo, Japan hooyama@iba.k.u-tokyo.ac.jp Abtract- In recent year,
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationDistributed Partial Information Management (DPIM) Schemes for Survivable Networks - Part II
IEEE INFOCO 2002 1 Ditributed Partial Information anagement (DPI) Scheme for Survivable Network - Part II Dahai Xu Chunming Qiao Department of Computer Science and Engineering State Univerity of New York
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationUsing Mouse Feedback in Computer Assisted Transcription of Handwritten Text Images
2009 10th International Conference on Document Analyi and Recognition Uing Moue Feedback in Computer Aited Trancription of Handwritten Text Image Verónica Romero, Alejandro H. Toelli, Enrique Vidal Intituto
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationAspects of Formal and Graphical Design of a Bus System
Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationCross-Layer Interactions in Multihop Wireless Sensor Networks: A Constrained Queueing Model
Cro-Layer Interaction in Multihop Wirele Senor Network: A Contrained Queueing Model YANG SONG Univerity of Florida and YUGUANG FANG Univerity of Florida Xidian Univerity In thi article, we propoe a contrained
More informationAn Algebraic Approach to Adaptive Scalable Overlay Network Monitoring
An Algebraic Approach to Adaptive Scalable Overlay Network Monitoring ABSTRACT Overlay network monitoring enable ditributed Internet application to detect and recover from path outage and period of degraded
More informationDiverse: Application-Layer Service Differentiation in Peer-to-Peer Communications
Divere: Application-Layer Service Differentiation in Peer-to-Peer Communication Chuan Wu, Student Member, IEEE, Baochun Li, Senior Member, IEEE Department of Electrical and Computer Engineering Univerity
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationStress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling
Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationA reduced reference image quality metric based on feature fusion and neural networks
Univerity of Wollongong Reearch Online Faculty of Engineering and Information Science - Paper: Part A Faculty of Engineering and Information Science 2011 A reduced reference image quality metric baed on
More information