Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS
|
|
- Abigayle Marsh
- 6 years ago
- Views:
Transcription
1 28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets of a assembly. The allotted tolerace has direct relatio with the maufacturig ad quality cost of the mechaical assembly. I this chapter, mathematical (aalytical) formulatio for simultaeous tolerace allocatio usig various methods like Worst Case Sceario (WCS), Root Sum Square (RSS) method, Spoot s Modified criteri a (SM) ad Estimated Mea Shift (EMS) criteria have bee explaied. Moreover, the importace of tolerace of positio cotrol is discussed i detail. 3.1 MATHEMATICAL FORMULATION OF THE PROBLEM The existig literature (Ye ad salustri, 2003) shows that maufacturig costs have bee icreased due to the allocatio of tight toleraces after employig quality loss ad tolerace sythesis methods. The cocurret tolerace allocatio method simultaeously assigs toleraces to strike balace betwee quality ad maufacturig cost ad optimizes cost over the life of the product. It is also importat to ote that positioal tolerace (Data, 2005) which is a geometric tolerace is also havig a impact o the total
2 29 cost of a assembly. I the preset thesis, the optimizatio of tolerace sythesis problem has bee solved after cosiderig both the maufacturig ad quality cost for various mechaical assemblies, such as, pisto-cylider, wheel-mout ad rotor-key. For rotor-key assembly, positioal cotrol is icorporated i the stackup coditios. By combiig maufacturig ad quality cost measures, this method tries to get equilibrium betwee them ad attai a miimal total cost (CT) of the assembly. I the preset model, process ad desig toleraces are cosidered to be the decisio variables. The maufacturig cost is a fuctio of process toleraces, whereas the quality loss is a fuctio of desig toleraces. Depedig o the miimizatio of total cost of assembly a optimizatio problem is formulated as follows. 3.2 FORMULATION AS AN OPTIMIZATION PROBLEM I this preset work, the objective fuctio cosidered miimizes the total cost (CT) i.e maufacturig ad quality cost of the assembly. I the objective fuctio, the weights W1 for maufacturig cost ad W2 for quality cost are icorporated. The Assumptios for Formulatig the Mathematical Model are give below: 1. The desig fuctio ca be retrieved ad formulated from a assembly cotext. This fuctio defies a relatioship betwee a set of deviatios i a dimesio chai ad a product performace
3 30 characteristic. I this work desig fuctio is assumed oedimesioal. 2. The resultat tolerace of a dimesio chai is give. This is the fuctioal tolerace, which comes from fuctioal or customer requiremets ad is available from the outset of a desig project. 3. A process pla for each dimesio is give. I a cocurret egieerig eviromet, it is commoplace to fid maufacturig egieers developig process plas while desigers are still detailig the product. Eve with icomplete or ureliable iformatio, a maufacturig egieer ca estimate a process pla. 4. Each process has a ormal distributio ad is uder statistical cotrol. This allows six-sigma theory to be applied. 5. The dimesios i a dimesio chai ad the processes for each dimesio are idepedet. below. The formulatio of the problem as optimizatio problem is give Mi. pi 2 C() T W C tpij W 2 K i j y, (3.1) Subjected to: t T i 1 id f, worst case criteria (3.2) or 2 t i 1 id T f, RSS criteria (3.3) or
4 31 Z tid tid Tf i 1 i mitid (1) mi tid Tf i 1 3 i 1 Spotts criteria (3.4) or Estimated mea shift criteria (3.5) All the above costraits are used to optimize the objective fuctio without positio cotrol (that is, geometrical tolerace). The costraits with positio cotrol (Data, 2005) are give below. t 1 id T i f T positio worst case criteria (3.6) or 2 t i 1 id T f T positio RSS criteria (3.7) or 1 2 or 2 tid tid Tf Tpositio i 1 i 1 Spotts criteria (3.8) Z 2 2 mitid (1) mi tid Tf Tpositio i 1 3 i 1 Estimated mea shift criteria (3.9) ad ad ad t ij t i j 1 mi max ij ij ij Tp ij, (3.10) tp tp tp, (3.11) tp ipi t id, (3.12)
5 32 where the costrait equatios 3.2 to 3.9 represets the desig tolerace costraits for differet cases, whereas equatio 3.10 idicates the maufacturig tolerace costrait. Moreover, the equatios 3.11 ad 3.12 represet the process tolerace costraits ad desig toleraces costraits, respectively. The sigificace of the termiology used i the above equatios is give below. The total maufacturig cost of a assembly represets the summatio of the maufacturig costs of idividual machiig process for the etire compoet s dimesio. Table 3.1 shows a few cost fuctios proposed by Dog et al. (1991, 1994) which have a extra edge over the traditioal cost fuctios i modelig the maufacturig cost tolerace characteristics precisely. The expoetial cost fuctio model proposed by Spekhart (1972) has proved to be the best amog all. Table 3.1: Cost tolerace models Cost tolerace Model Combiatio of reciprocal powers Ad expoetial Combiatio of liear ad Expoetial fuctio B splie cost model Cubic polyomial model Fourth order polyomial model Fifth order polyomial model Mathematical Represetatio c C() t a b/ t dexp() et C() t a bt cexp() dt C()()()()()() t a B t a B t a B t a B t a B t C() t a a t a t a t C() t a a t a t a t a t C() t a a t a t a t a t a t
6 33 A way to evaluate ecoomic loss from a quality deviatio elimiatig the eed to create the uique fuctio for every quality characteristic is provided by Taguchi quality loss fuctio (Taguchi, 1989). These losses comprise of customer satisfactio, performace, ad maufacturig ad supplier efficiecy. These are real i ature ad ca be estimated i moey terms. Figure 3.1 depicts Taguchi s Loss Fuctio ad is defied as follows: Moetary loss is a fuctio of each product feature (x), ad its differece from the best (target) value. Figure 3.1: Taguchi s Loss Fuctio ad ormal distributio x = measuremet of a compoet characteristic. T = X target value. a = extet of loss whe the quatity of x deviates from the quatity of T b = extet that x deviates from T. I this illustratio, T = mea of the sample of X s. The Nomial characteristic is pictorially depicted i the Figure 3.2. The loss ( L) icreases as the output value ( y) departs from the
7 34 target value ( m) risig the mea squared deviatio. No loss is show eve whe the output value equal the target value (y = m). Figure 3.2: Graphical represetatio of the Nomial Characteristic Quality loss is quatified, as a quadratic expressio represetig the loss to the deviatio of a product property L(Y) = k(y-m) 2, (3.13) where k=a/tf, A is the replacemet cost. Whe the dimesio does ot match the tolerace requiremets, Tf is the fuctioal tolerace requiremet, m is the fuctioal dimesio target value, ad y represets the desig characteristic. A ormal distributio havig the mea at the target value is assumed to be the fuctioal dimesio. The stadard deviatio of the fuctioal dimesio represets the quality loss. The loss fuctio the ca be give as follows QL = E(L(Y)) = k( (μ m) 2 +σy 2 ), (3.14) where µ is the mea ad σ 2 y is the variace of Y. The distace of the mea of Y i.e µ from the target value m ad the variace of Y are
8 35 liearly combied i the equatio. Durig parameter desig a quality egieer alters µ to reduce the quality loss. The value of process variability σy will ot be affected by these adjustmets. Fially the quality loss may be show as: QL = E(L(Y))= k σy 2, (3.15) Based o the desig fuctio, a set of idividual quality characteristics ca be used to estimate the overall quality characteristic. It is to be oted that Taylor s series expressios ca be used to foud these approximate fuctios. The idividual quality characteristic i terms of the resultat variace is expressed as fallows: 2 2 f 2 y i 1 x xi, (3.16) i Toleraces are i geeral related ad desiged i combiatio with the applicatio of a particular maufacturig process. The the process capability idex Cp, is writte as: t Cp id, (3.17) 3 xi The above expressio ca be modified as t id xi, (3.18) 3C pi Substitutig the Equatio 3.18 i Equatio 3.16
9 f t id y, (3.19) i 1 x i 3C p ad the total quality loss is 3.3 CONSTRAINTS 2 QL t d k y, (3.20) The optimizatio problem discussed above has costraits pertaiig to both desig ad maufacturig toleraces Desig Tolerace Costraits The fudametal cosideratios of various dimesios of the assembly are based o the desig tolerace. The desig tolerace costrait is formulated with a coditio that i the dimesioal chai, accumulated tolerace should ot go over the specified tolerace o the fuctioal dimesio. Several approaches had bee proposed to estimate the accumulated toleraces, which are valid uder variable coditios. I additio to regular stack up approaches, like RSS ad worst case (Paul, 1999), other otraditioal approaches, such as Spoot s criteria ad Estimated Mea Shift criteria have also bee used. The relatioships related to these cases are give i equatios 3.2 to 3.9. Worst case sceario (WCS): The ame worst case sceario implies that it adds or subtracts all the upper or lower toleraces coected with the omial set poit for idividual compoet. I this case, laws of probability are ot
10 37 cosidered ad it keeps the assembly at the highest or lowest possible dimesio. All the part dimesios are summed up at the worst case miimum or maximum tolerace values (paul, 1999). Based o the worst possible coditio, the simplest of all is the method of extremes (equatio 3.2). The outcome of this method allocates very precise toleraces, which i tur lead to higher maufacturig costs of a assembly Root Sum of Squares (RSS) method: RSS is a kid of statistical toleracig method. This method is helpful to take care of the rare case of all dimesios occurrig at their ed limits oe after the other. The said method is a mathematical treatmet method of the data to assist the tolerable additio of measures of variability. The mere assumptio cosidered i the Root-sum-square (RSS) criteria (Paul, 1999) (equatio 3.3) is a ormal process distributio with the mea cetered at the omial value. It is also called as simple statistical model ad depeds o impractical assumptio. The applicatio of this method yields low maufacturig cost of assembly due to very loose toleraces. Spotts Modified (SM) criteria: This method is used due to its simplicity. Some modificatios have bee proposed to accout for the realistic distributios of process. Based o mea results of WC ad RSS stack-up coditios, Spott s developed a ew method called Spotts modified (SM) criteria (Spott s, 1978). This model is represeted i equatio 3.4.
11 38 Estimated Mea Shift (EMS) Criteria: A itegrated approach where we ca cotrol the amout of mea shift is proposed by Greewood ad Chase (1987). It cotais the RSS ad the WC as the ed cases, ad it ca reproduce ay itermediate value. I this model, the rage of mea shift factor is cosidered as (0.0, 1.0) ad represets a amout by which the midpoit is estimated to shift, as a fractio of the tolerace rage. If a process is closely cotrolled, the a small value of mea shift, such as 0.25 is used. If the amout of iformatio kow about the process is less, a high value of mea shift factor is cosidered. If the value of mea shift factor is equal to 1.0 for all the compoets, it represets the Worst Case model ad if the mea shift factor is zero for all of the compoets, the approach is similar to Root Sum Square Model. I the preset study, the value of mea shift (m i) is to be cosidered to be 0.25 for close cotrol i all the cases. This model is represeted i equatio 3.5. Geometric Toleraces - Tolerace of Positio Cotrol: I geometric tolerace methods, tolerace of positio cotrol (TOP cotrol) is oe of the importat methods. It defies the locatio tolerace of a feature of size from its origial positio. There are two ways of specifyig the TOP cotrol boudary. The first method is to specify TOP tolerace zoe o RFS basis, where as the secod method employs either MMC or LMC. I both the methods, the FOS ceter plae should be i the idetified tolerace zoe of the cotrol frame.
12 39 Advatages of Tolerace of Positio: While comparig the Tolerace of Positio ad Coordiate Toleracig, the former is foud to have distict advatages over the latter. To ame a few, the advatages are: 1. TOP allows datum shift ad additioal toleraces-bous. 2. It gives 57% larger cylidrical tolerace zoes tha square zoes. 3. TOP gives protectio to the part fuctio. 4. Maufacturig costs are reduced. 5. Accumulatio of tolerace is reduced by TOP cotrol. TOP cotrols geerally employ cylidrical tolerace zoes. Figure 3.3 shows the coversio of a liear tolerace ito cylidrical tolerace zoe. It is importat to ote that a additioal tolerace of 57% will be gaied usig a cylidrical tolerace zoe. I additio to this, additioal toleraces of 50 to 100% are goig to be added i the form of bous ad datum shift, which leads to the lower maufacturig cost. Figure 3.3: Coversio of square zoe to cylidrical positioal tolerace zoe.
13 40 Trasformatio of square zoe ito cylidrical zoe: The true positio of a feature is described geerally by the positio tolerace, as it chooses a datum ad the omial locatio of a poit, a lie, or a plae of the feature. Let us cosider the positio tolerace to be x, the the correspodig liear dimesioal tolerace is give by dividig x with 2 2 (Yua, 1999). The expressio for this model usig GLi, (basic dimesio) ad GPTi (positioal tolerace) is i the followig form: GLi ± GPT i Maufacturig Tolerace Costraits Process capability ad the amout of machiig allowace for each operatio are importat factors to be kept i mid durig machiig tolerace allocatio. The actual amout of material removed may vary because of process wise maufacturig errors. Hece, cumulative sum of maufacturig toleraces of all the processes is to be take ito accout while fixig the rage for metal removal. I practice, typical levels of material removal are set o the basis of each process. The costraits o maufacturig tolerace formulated are show i equatio The term tij represets the maufacturig tolerace of j th operatio for producig i th dimesio, while Tpij deotes the deformatio allowace of j th operatio.
14 Process Tolerace Costrait Every process or operatio may have certai accuracy ad must be performed withi its process capability. The process tolerace costraits are formulated i equatio Simultaeous tolerace sythesis model cosiders two costs workig had i had; Maufacturig Cost ad Quality Loss. While maufacturig cost is expressed as a fuctio of process toleraces, Quality loss is expressed i terms of desig toleraces. Quality loss eed ot be cosidered for the itermediate process toleraces as they are ot the fial toleraces. Sice quality loss is associated with desig toleraces, the toleraces of the last processes will be sufficiet. By computig Quality loss i this maer, we ca add the maufacturig cost to it. The desig tolerace costraits are formulated i equatio SUMMARY I the preset chapter, a aalytical model for simultaeous allocatio of toleraces for mechaical assemblies after applyig various methods, such as WCS, RSS, SM ad EMS have bee discussed i detail. Moreover, the ifluece of tolerace of positio cotrol has bee discussed. Fially, a itroductio to the evolutioary algorithms has also bee explaied. The applicability of above models to various mechaical assemblies, such as pisto cylider, wheel- mout ad rotor-key assemblies, are cosidered as
15 42 a optimizatio problem i the followig chapter. It is to be oted that the above optimizatio problems have bee solved usig three evolutioary algorithms, such as GA, DE ad PSO.
Bezier 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 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 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 informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
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 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 information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
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 informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
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 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 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 informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
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 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 informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
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 informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
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 information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationLecture 21: Variation Risk Management
Lecture : Variatio Ris Maagemet Quality Types Total Quality Huma resources Maufacturig Orgaizig ad operatig Product ad Services Desig What is variatio? Variatio = Deviatio from omial variatio: the etet
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationSolving 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 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 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 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 information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
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 informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationA MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS
Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
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 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 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 informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
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 informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationA General Framework for Accurate Statistical Timing Analysis Considering Correlations
A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationApparent Depth. B' l'
REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '
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 informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
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 informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
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 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 informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
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
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationNON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE
14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationHow Reliable are the Ground Motion Prediction Equations?
20th Iteratioal Coferece o Structural Mechaics i Reactor Techology (SMiRT 20) Espoo, Filad, August 9-4, 2009 SMiRT 20-Divisio IV, Paper 662 How Reliable are the Groud Motio Predictio Equatios? Iztok Peruš
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
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 informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationThe identification of key quality characteristics based on FAHP
Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationData Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types
Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationAlgorithm. Counting Sort Analysis of Algorithms
Algorithm Coutig Sort Aalysis of Algorithms Assumptios: records Coutig sort Each record cotais keys ad data All keys are i the rage of 1 to k Space The usorted list is stored i A, the sorted list will
More informationPackage popkorn. R topics documented: February 20, Type Package
Type Pacage Pacage popkor February 20, 2015 Title For iterval estimatio of mea of selected populatios Versio 0.3-0 Date 2014-07-04 Author Vi Gopal, Claudio Fuetes Maitaier Vi Gopal Depeds
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationBasic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.
5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
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 information27 Refraction, Dispersion, Internal Reflection
Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
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 informationIntro to Scientific Computing: Solutions
Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile
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 informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
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 informationOptimal Tolerance Allocation Based on Fuzzy Comprehensive Evaluation and Genetic Algorithm
It J Adv Mauf Techol (2000) 16:461 468 2000 Spriger-Verlag Lodo Limited Optimal Tolerace Allocatio Based o Fuzzy Comprehesive Evaluatio ad Geetic Algorithm S. Ji, X. Li, Y. Ma ad H. Cai The Advaced Machiig
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationXbar/R Chart for x1-x3
Chapter 6 Selected roblem Solutios Sectio 6-5 6- a) X-bar ad Rage - Iitial Study Chartig roblem 6- X-bar Rage ----- ----- UCL:. sigma 7.4 UCL:. sigma 5.79 Ceterlie 5.9 Ceterlie.5 LCL: -. sigma.79 LCL:
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
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 informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
More information