Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
|
|
- Rosalyn Lawson
- 5 years ago
- Views:
Transcription
1 IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical Egg Dept, Adhiyamaa College of Egg, Hosur , T. N. State) Idia 2 (Pricipal, M.N.R.College of Egg, Sagareddy Dist, Hyderabad-5 72, A.P.State, Idia 3 (Pricipal, Adhiayamaa College of Egg, Hosur 6359, T.N.State) Idia. d.(pricipal, Sri Bhagava Mahaveer Jai College of Egg, Bagalore, K.A. State,) Idia. e. (Professor, Mech Egg Dept G.Pulla Reddy College of Egg, Kurool, A.P.State,) Idia. Abstract- The mai obective of this paper is to make redudacy allocatio for Series Parallel Systems with multiple costraits i order to determie the compoet reliabilities (r ), the umber of compoets i each stage (x ), stage reliability (R ) ad the System Reliability (R s ) i each stage for the give Cost ad Weight costraits to maximize the System Reliability. The system used is a Series Parallel cofiguratio by usig optimizatio techiques, such as Lagragea Multiplier Method ad Dyamic Programmig. The Reliability Model has bee developed for Cost ad Weight costats. The authors i their work make a attempt to egotiate the impact of Cost ad Weight as costats for the Mathematical Fuctio r c d b π.ta The developed models are hady with high applicatio value particularly 2 i the case of Itegrated Reliability Model for redudat systems with Series Parallel cofiguratio. Geerally reliability is treated as the fuctio of Cost but i ay give practical situatio apart from cost other costrait like Weight will have hidde impact o the reliability of the system. I this model the Lagragea techique is implemeted to determie the umber of compoets as itegers ad the variatio i Cost ad weight is foud more, this leads to itroduce Dyamic Programmig techique by takig the umber of compoets as real umbers. The model has yielded very ecouragig results ad it ca be applied to ay type of system, simple or complex. The advatage of this model is very flexible ad requires little processig time. Keywords: System Reliability; Stage Reliability; Series Parallel System; Multiple costraits;. INTRODUCTION This Paper treats a System with may stages i Series Parallel cofiguratio. To build high reliability i to a system, a Desig Egieer usually resorts to redudat uits for each stage, but must stay with i the resources available, i.e. costraits improved o the desig, such as Cost ad Weight. The optimum redudacy depeds o Reliability, Cost ad Weight etc. of each stage. The reliability of a System ca be maximized subect to the resource costraits to determie the optimum umber of redudat compoets for each stage, whe the reliability of each compoet is kow i other situatios, the reliability of the system ca be maximized subect to the resource costrait to determie the reliability of the compoets i the system whe the umber of Redudat uits i each stage is kow. As o Today the literature o maximizatio of System Reliability problems are cosidered, there is o much work reported o Itegrated Reliability Model for Redudat Systems with multiple costats. I this sceario the authors wat to make a attempt to optimize the Reliability of a System with Multiple Costats.To study ad optimize the Itegrated Reliability Model for Redudat Systems with Multiple Costraits is cosidered with Cost ad Weight as costats, for the give kow mathematical fuctio r π.ta 2 c b d 2. STATEMENT OF THE PROBLEM To determie the ukows i.e. the umber of compoets (x ), the compoet reliabilities (r ) the stage reliability (R ) at each stage for a give multiple costats to maximize the system reliability. Though Cost has direct relatio i maximizig System Reliability, the idirect impact of weight as o additioal costrait i optimizig the Reliability of a Redudat System presets a ovel begiig i the metioed area of research. The Series Parallel Systems are cosidered with Cost ad Weight as costraits to maximize the Reliability of a redudat system as its obective fuctio. 3. ASSUMPTIONS OF THE MODEL. All the compoets i each stage are assumed to be idetical. 2. The compoets are assumed to be statistically idepedet i.e. the failure of oe compoet does ot affect the performace of the other compoets i the system. ISSN: P a g e
2 IOSR Joural of Egieerig 3. A compoet is either i workig coditio or oworkig coditio. r π c d.ta (4) 2 b Where c is cost costrait ad b, d are costats. 7. PROBLEM FORMULATION System Reliability for the give cost fuctio R R s = (5) FIG : SERIES-PARALLEL CONFIGURATION 4. NOMENCLATURE: R s = System Reliability. R = Stage Reliability, <R < F= Lagragea fuctio r = Reliability of each compoet i stage, <r <. x = No. of compoets i stage. c =Cost coefficiet of each compoet i stage w = Weight coefficiet of each compoet i stage. C o = Maximum allowable System Cost. W o = Maximum allowable System Weight. b = Scalig factor for stage used i the fuctio d = Shapig factor for stage used i the fuctio p = Costat used i weight fuctio. q = Costat used i weight fuctio. 5. MATHEMATICAL MODEL Cosider that there are statistically idepedet stages i Series with x statistically idepedet i each stage. System Reliability for the give cost fuctio R R s = Subected to x = ( r ) () c. x C (2) w. x W (3) No egativity restrictio x is a iteger ad r, R > 6. MATHEMATICAL FUNCTION Cost co efficiet of each compoet i stage is derived from the followig relatioship betwee Cost ad Reliability. Cost coefficiet of each uit i stage is derived from the followig relatioship betwee cost ad reliability π c d r.ta (6) 2 b d r c b. ta (7) π/2 Sice cost costrait is liear i x c.x C (8) Similarly weight costrait is also liear i x w.x W (9) Substitutig equatios (6) ad (7) i (8) ad (9) we get the followig relatio d r b. ta.x C π/2 () q r p. ta.x W π/2 () The umber of compoets at each stage x is give through the relatio x l(r l(r ) ) (2) Maximize R [ ( r ) ] (3) s x ISSN: P a g e
3 IOSR Joural of Egieerig Subect to the costraits d r l( R ) b. ta. C π/2 l( r ) (4) q r l( R ) p. ta. W π/2 l( r ) (5) 8. LAGRANGEAN METHOD Solvig the proposed formulatio usig Lagragea method. F R 2 s p b. ta r /( / 2) l( ) q R. tar /( / 2). W d. l( r ) l( R ) C l( r ) (6) where λ ad λ 2 are Lagragea multipliers ad F beig Lagragea fuctio. The umber of compoets i each stage (x ), optimum compoet reliability (r ), stage reliability (R ) ad the system reliability (R s ) are derived from the Lagragea method. The method provides real valued solutio with referece to cost ad weight. The statioary poit ca be obtaied by differetiatig the Lagragea fuctio with respect to R, r, λ, ad λ 2 9. RESULTS AND DISCUSSIONS The followig reliability desig tables related to cost ad weight are calculated by usig the compoet reliabilities ad the umber of compoets derived from Lagragea method. 9. Case Study: Cosider the case of a Mechaical system with three stages for which the compoet Reliability is give by the equatio (4). To determie the optimum compoet reliability, stage reliability, umber of compoets i each stage ad the System Reliability ot to exceed the system cost Rs.25, Weight of the system 3kg. The compoet Reliabilities, Stage Reliabilities, Number of compoets i each stage ad the System Reliability are determied by solvig the above mathematical fuctio by usig MATLAB Versio 7. ad are preseted i the followig tables. 9.2 Cost ad Weight as costraits: 9.2. Reliability Desig Without x roudig off: Table I. Reliability desig relatig to Cost i (Rs): Stage r R x c c. x Total Cost 25. Table II. Reliability desig relatig to Weight (Kg): Stage r R x c c. x Total Cost 3. System Reliability Reliability Desig with x roudig off: The reliability desig is reestablished by cosiderig the values of to be itegers (by roudig off the value of to the earest iteger) ad the relevat results relatig to cost ad weight are preseted i the followig table, further givig the iformatio by calculatig the variatio due to cost ad weight ad the system reliability (before ad after roudig off).table: 3Reliability desig relatig to Cost i Rupees. Table III. Reliability desig relatig to Cost i (Rs) : Stage r R x c c. x Total Cost Table IV. Reliability desig relatig to Weight (Kg): Stage r R X W W. X Total Cost 39.8 System Reliability (R s ) =.84 Variatio i total Cost = 7.82% Variatio i total Weight = 6.6% Variatio i System Reliability = 4.88%. DYNAMIC PROGRAMMING: To optimize the desig by usig Dyamic Programmig the same case problem discussed i the precedig chapter has bee cosidered by takig the values of Compoet Reliabilities (r ), the umber of compoets i each stage (x ), Stage Reliabilities (R ) ad the System Reliability (R s ) as iputs. This Approach is particularly useful i optimizig the desig with the values of x s to be itegers, which are highly appreciated for practical implemetatio to real life problems. The umber of compoets, which was take as a real umber has bee chaged to a iteger. The output has come i two stages with correspodig Stage Reliability is show i Table V. ISSN: P a g e
4 IOSR Joural of Egieerig Table V DYNAMIC PROGRAMMING STAGE : No.of Stage Reliability Compoets No.of Compoets Table VI DYNAMIC PROGRAMMING STAGE 2: Stage Reliability No.of Compoets Table VII DYNAMIC PROGRAMMING STAGE 3: Stage Reliability RELIABILITY DESIGN- COST: From the Dyamic Programmig tables the maximum System Reliability is.672 with a total COST of Rs ad the correspodig optimal values are as show below. Table VIII: Reliability desig relatig to Cost i (Rs): STAGE r R x c c.x T T A L C O S T RELIABILITY DESIGN - WEIGHT: From the Dyamic Programmig tables the maximum System Reliability is.672 with a total WEIGHT of 39.8 ad the correspodig optimal values are as show below. Table IX: Reliability desig relatig to Weight i (Kg) STAGE r R x w x.w T T A L W E I G H T 39.8 System Reliability =.672 Variatio i Total Cost = 7.82% Variatio i Total Weight = 6.6% Variatio i System Reliability = 25.4 %.3 Sesitivity Aalysis: It is observed that whe the iput data of compoet reliability is icreased percet there percet icrease i system reliability. Similarly whe percet decrease i iput data there will be 5.5 percet decrease ISSN: P a g e
5 IOSR Joural of Egieerig i system reliability is observed. Whe oe factor is varied, keepig other factors costat, variatio i Cost ad Weight is as show i Table X. Table X Sesitivity Aalysis: Variatio i compoet reliability(r ) For % icrease COST 26.5% icreases WEIGHT 27.35% icreases System Reliability 28% icreases For % decrease COST 29.78% icreases WEIGHT 22.3% icreases System Reliability 5.6% icreases The aalysis cofirms that the cost ad weight are more sesitive to iput data. 2. CONCLUSION Primarily this paper is focused i allocatig redudacy uits with multiple costraits for a reliability system, where i the developmet of itegrated reliability model is discussed i detail. The paper ifers that the multiple costraits problem is first treated through Lagragea method where this method provided a real valued solutio ad as such may be ifeasible for practical implemetatio. For this reaso, the problem solved by Dyamic Programmig, which proved a ideal solutio to take the umber of compoets i iteger values ad to fid the exact system reliability. The variatio of Cost, Weight ad System Reliability is aalyzed with respect to compoet reliability i the form of Sesitivity aalysis. This model ca also be further ivestigated for differet mathematical fuctios of iterest ad also ca be applied for Parallel Series cofiguratio systems, where the applicatio of these models for such systems will be feasible oly whe the cost of the system is very low. [5] Dhigra.A.K., Optimal Apportiomet of Reliability ad Redudacy i Series Systems uder Multiple Obectives, IEEE Trasactios o Reliability, Vol.-4, No.4, December 992, PP [6] Flehiger.B.J., System reliability as a fuctio of system age, Effects of itermittet compoet usage ad periodic maiteace, preseted at 959 IRE Natioal Covetio, New York, March 959. [7] Gopal.K., Aggrawal.K.K, ad Gupta.J.S, A ew method for solvig Reliability Optimizatio problem, IEEE Trasactios o Reliability, Vol.R-29, No., April 98, PP [8] Gordo.R., Optimum Compoet Redudacy for maximum System Reliability, Operatios Research., Vol.5, March 957, PP [9] Deb.K., Optimizatio for Egieerig Desig: Algorithms ad Examples, Pretice-Hall of Idia private limited, New Delhi, 995. [] Hwag.C.L., Lai.K.C, Tillma.F.A. & Fa.L.T. Optimizatio of System Reliability by the sequetial ucostraied miimizatio techique, IEEE Trasactios o Reliability, Vol.R-24, No.2, Jue 975, PP [] S.V.Suresh Babu, Dr.D.Maheswar ad Dr.G.Ragaath, Optimizatio of System Reliability for Redudat Systems with Multiple Costraits, Iteratioal Joural o Advaced Scieces i Egieerig ad Techology (IJAEST), August, 2, Page No.99-22, Vol.No.2. Issue No.2. [2] Misra.K.B. A Method of Solvig Redudacy Optimizatio problems, IEEE Trasactios o Reliability. Vol.R-2, No.5, August 97, PP-7-2. [3] Rosario Romera, Jose E.Valdes ad Romulo I.Zequeira, Active-Redudacy Allocatio i Systems, IEEE Trasactios o Reliability, Vol.53, No.3, Sep 24. REFERENCES: [] Misra.K.B., Dyamic Programmig formulatio of Redudacy allocatio problem, Iteratioal Joural of Math Educatioal Sciece, Techology (U.K), Vol.2, July-September 97(a), PP [2] Balagurusamy.E. Reliability Egieerig, TMH, 984. [3] Tillma.F.A., Hwag.C.L., ad Way Kuo., Optimizatio of System Reliability, Marvel Dekker, New York,98. [4] Kuo.W, Li.H, Xu.Z, ad Zhag.W, Reliability Optimizatio with Lagrage Multiplier ad Brach ad Boud Techique, IEEE Trasactios o Reliability, Vol.R-36, No.5, December 987, PP ISSN: P a g e
Solving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationOptimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method
Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationChoosing an Optimal Set of Libraries
IEEE TRANSACTIONS ON RELIABILITY, VOL. 45, NO. 2, 1996 JUNE Choosig a Optimal Set of Libraries Oded Berma Uiversity of Toroto, Toroto Michal Cutler, Member IEEE State Uiversity of New York, Bighamto Keywords
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationFuzzy Linear Regression Analysis
12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationNovel Encryption Schemes Based on Catalan Numbers
D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha
More informationAn Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem
Iteratioal Joural of Systems Sciece ad Applied Mathematics 206; (4): 58-62 http://www.sciecepublishiggroup.com/j/ssam doi: 0.648/j.ssam.206004.4 A Algorithm to Solve Fuzzy Trapezoidal Trasshipmet Problem
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationPLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)
wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 52 Number 9 December 2017
Iteratioal Joural of Mathematics Treds ad Techology (IJMTT) Volume 5 Number 9 December 7 Optimal Solutio of a Degeerate Trasportatio Problem Reea.G.patel, Dr.P.H.Bhathawala Assistat professor, Departmet
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationSecond-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems
Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute
More informationFuzzy Transportation Problem Using Triangular Membership Function-A New approach
Vol3 No.. PP 8- March 03 ISSN: 3 006X Trasportatio Proble Usig Triagular Mebership Fuctio-A New approach a S. Solaiappaa* K. Jeyaraab Departet of Matheatics Aa UiversityUiversity College of Egieerig Raaathapura
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationA Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem
P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic
More informationANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES
ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationResearch Article A New Formulation of the Set Covering Problem for Metaheuristic Approaches
ISRN Operatios Research Volume 2013, Article ID 203032, 10 pages http://dx.doi.org/10.1155/2013/203032 Research Article A New Formulatio of the Set Coverig Problem for Metaheuristic Approaches Nehme Bilal,
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationA Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion
27. A Fully olyomial Time Approximatio Scheme for Timig Drive Miimum Cost Buffer Isertio ABSTRACT Shiya Hu Dept. of Electrical ad Computer Egieerig Michiga Techological Uiversity Houghto, Michiga 4993
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More information2D Isogeometric Shape Optimization considering both control point positions and weights as design variables
1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul
More informationHigh-Speed Computation of the Kleene Star in Max-Plus Algebra Using a Cell Broadband Engine
Proceedigs of the 9th WSEAS Iteratioal Coferece o APPLICATIONS of COMPUTER ENGINEERING High-Speed Computatio of the Kleee Star i Max-Plus Algebra Usig a Cell Broadbad Egie HIROYUKI GOTO ad TAKAHIRO ICHIGE
More informationProbability of collisions in Soft Input Decryption
Issue 1, Volume 1, 007 1 Probability of collisios i Soft Iput Decryptio Nataša Živić, Christoph Rulad Abstract I this work, probability of collisio i Soft Iput Decryptio has bee aalyzed ad calculated.
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationNew algorithms for minimization of non linear functions by numerical methods
Available olie at www.pelagiaresearchlibrary.com Advaces i Applied Sciece Research, 11, (6:176-189 ISSN: 976-861 CODEN (USA: AASRFC New algorithms for miimizatio of o liear fuctios by umerical methods
More informationEFFICIENT MULTIPLE SEARCH TREE STRUCTURE
EFFICIENT MULTIPLE SEARCH TREE STRUCTURE Mohammad Reza Ghaeii 1 ad Mohammad Reza Mirzababaei 1 Departmet of Computer Egieerig ad Iformatio Techology, Amirkabir Uiversity of Techology, Tehra, Ira mr.ghaeii@aut.ac.ir
More informationA Study on Weibull Distribution for Estimating the Reliability Dr. P. K. Suri 1, Parul Raheja 2
www.ijecs.i Iteratioal Joural Of Egieerig Ad Computer Sciece ISSN:239-7242 Volume 4 Issue 7 July 205, Page No. 3447-345 A Study o Weibull Distributio for Estimatig the Reliability Dr. P. K. Suri, Parul
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationCOMP Parallel Computing. PRAM (1): The PRAM model and complexity measures
COMP 633 - Parallel Computig Lecture 2 August 24, 2017 : The PRAM model ad complexity measures 1 First class summary This course is about parallel computig to achieve high-er performace o idividual problems
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationA SYSTEMATIC APPROACH FOR COST OPTIMAL TOLERANCE DESIGN
INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 8-31 AUGUST 007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE A SYSTEMATIC APPROACH FOR COST OPTIMAL TOLERANCE DESIGN Sotiria Ch. Dimitrellou,
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationIJESMR International Journal OF Engineering Sciences & Management Research
[Geetha, (10): October, 015] ISSN 39-6193 Impact Factor (PIF):.3 Iteratioal Joural OF Egieerig Scieces & Maagemet Research CONSTRUCTION OF DIOPHANTINE QUADRUPLES WITH PROPERTY D(A PERFECT SQUARE) V.Geetha
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationCharacterizing graphs of maximum principal ratio
Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first
More information