A SYSTEMATIC APPROACH FOR COST OPTIMAL TOLERANCE DESIGN

Size: px
Start display at page:

Download "A SYSTEMATIC APPROACH FOR COST OPTIMAL TOLERANCE DESIGN"

Transcription

1 INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED AUGUST 007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE A SYSTEMATIC APPROACH FOR COST OPTIMAL TOLERANCE DESIGN Sotiria Ch. Dimitrellou, Stefaos C. Diplaris ad Michael M. Sfatsikopoulos Natioal Techical Uiversity of Athes (NTUA, Greece ABSTRACT This paper presets a ew method ad a prototype system for cost optimal tolerace desig i mechaical assemblies. The system overcomes iefficiecies ad/or hadicaps met i curret methods ad tools that require expert cost-tolerace iput refereced to the participatig i the assembly chai dimesios or the availability of case-drive experimetal cost-tolerace data. This is accomplished by itroducig the cocept of the Tolerace Elemet (TE, a machiig process related geometric etity with attributes associated with the accuracy cost ad idetifiable i coformace with the stadard idustrial uderstadig. It becomes thus possible to assig cost optimum ad ratioal compoet toleraces through a algorithmic mode that ca be directly itegrated i a CAD eviromet. Withi this -based o the TE approach- frame, machiig capability ad cost per TEclass of a particular machie shop are appropriately recorded ad processed ad cost-tolerace fuctios automatically established ad stored i the system database to be used for tolerace optimizatio. The latter oce created, eeds the updatig oly whe chages take place i the machie shop resources ad/or expertise. Tolerace allocatio ca be thus achieved with miimum maufacturig cost withi the machie shop accuracy gettig capability i a effort ad time efficiet way through realistic ad machie shop focused cost-tolerace data. A applicatio example demostrates the method ad its positive evaluatio i compariso with alterative problem solutios. Keywords: Toleracig, Tolerace allocatio, Cost-Tolerace Fuctio, Optimum Toleracig, Toleraces Chais 1 INTRODUCTION Withi the frame of further developmet of CAD tools emphasis is give to computer-aided toleracig techiques for cost optimal allocatio of toleraces i mechaical assemblies [1-4]. I egieerig desig as optimal toleracig is meat the assigmet of toleraces to the compoets of a mechaical assembly i terms ot oly of fuctioality but also of miimum maufacturig cost. The fuctioal performace of a assembly, as a result of the deviatios of its critical dimesios, is decisively affected by the compoet toleraces accordig to the tolerace chais. Tight toleraces geerally result to high dimesioal accuracy, quality ad modularity of the product. High accuracy is maily based, o the other had, o machiig processes ad always imposes additioal effort hece higher maufacturig costs. Give that accuracy costs costitute a vital issue i the idustrial productio, various cost-tolerace relatioships have bee proposed ad tried to this date, [3,5-8]. Critical characteristic of these relatioships however, is that their expoets ad coefficiets are obtaied experimetally uder particular each time experimetal coditios ad caot therefore be broadly used. CAD software for cost optimal tolerace allocatio does ot make use of such case-drive costtolerace fuctios as they may well ot be represetative of the machie shop where the compoets will be maufactured. Istead, they require from the user to feed the system with cost-tolerace data based o his ow judgemet ad cost-tolerace kowledge. The procedure is, apparetly, ot systematic ad subjective to the way the particular user uderstads the accuracy cost of a machiig tolerace. It ca also be time-cosumig i case the assembly has a large umber of membertoleraces. Cosiderable depedecy of the produced results o user iput, misiterpretatios, mistakes ad uecessary repetitios are uavoidable. ICED 07/170 1

2 I this paper a prototype system for cost optimal tolerace desig i mechaical assemblies is preseted. The system overcomes iefficiecies met i existig CAD tools that require from the user expert cost-tolerace iput or the availability of case-drive experimetal cost-tolerace data. The developed methodology itroduces the cocept of the Tolerace Elemets that are geometric etities with attributes associated with the accuracy cost of the specific machiig eviromet where the compoets will be maufactured. Oce established for this eviromet, the system automatically creates ad makes use of appropriate cost-tolerace fuctios for the assembly chai members uder cosideratio. Cost optimal tolerace desig ca thus be achieved i a systematic, cost ad time efficiet way by meas of realistic ad machie shop focused cost-tolerace data. The beefits of this system are demostrated ad discussed through a applicatio example. THE METHOD.1 Tolerace Elemets Accuracy cost is the cost required to produce a give dimesio withi its specified tolerace limits. It depeds, apparetly, o the processes ad resources eeded for the part productio. Give the workpiece material ad toleraces, the part geometrical characteristics such as size, shape, feature details, iteral surfaces, are take ito cosideratio for plaig the machiig operatios, programmig the machie tools, specifyig fixtures, etc. These geometrical characteristics have thus a direct impact o the machiig cost of the required accuracy by determiig, idirectly, its magitude [9]. A Tolerace Elemet (TE is defied as a 3D form feature of particular shape, size ad tolerace. It icorporate attributes associated with its shape, size, positio, the presece of additioal feature details ad the ratio of the pricipal dimesios of the part to which it belogs. To each TE correspods oe cost-tolerace fuctio that stads for its accuracy cost ad is directly related with the particular machie shop where the TE will be produced (machie tools, ispectio equipmet, supportig facilities, expertise. Tolerace Elemets are classified through a five level class hierarchy system, Figure 1. Class level attributes are all machiig process related, geeric ad straightforwardly idetifiable i coformace with the existig idustrial uderstadig. Figure 1. TE classificatio ICED 07/170

3 I first level, TEs are classified accordig to the basic geometry of the part to which they belog, i.e. rotatioal TEs ad prismatic TEs. Rotatioal TEs belog to rotatioal parts maufactured maily by turig ad borig, while prismatic TEs belog to prismatic parts maily maufactured by millig. I secod level, TEs are classified accordig to the size ratio of the pricipal dimesios of the part to which they belog, cosiderig the required resources for part machiig ad/or the elastic deformatios due to cuttig forces or part ow weight. I this way TEs are classified as short [L/D 3] ad log [L/D >3] TEs, followig a typical way of classificatio [10-11]. For a rotatioal part, D represets its largest diameter, L the part legth. For a prismatic part L represets its largest dimesio ad D the largest oe i the directio of the two remaiig Cartesia axes. I third level TEs are classified to exteral ad iteral oes as the achievemet of tight toleraces i iteral TEs usually results to higher accuracy cost. The fourth TE classificatio level distiguishes betwee plai ad complex TEs depedig o the absece or presece of additioal feature details. Such details iclude grooves, wedges, ribs, threads or otches. They do ot chage the pricipal TE geometry but they idirectly cotribute to the icrease of the accuracy cost. I the fial fifth level, the ivolvemet of the TE size to the accuracy cost is cosidered. TEs are classified, accordig to the omial size of their participatig i the chai dimesio, ito six groups by itegratig two sequetial ISO 86-1 size rages. The five-digit TE classificatio code is show i Table 1. Figure illustrates a rotatioal part with rotatioal TEs ad their codes. Table 1. TE codig scheme DIGIT 1 DIGIT DIGIT 3 DIGIT 4 1 Rotatioal TE 1 Short TE 1 Exteral TE 1 Plai TE 0 Prismatic TE 0 Log TE 0 Iteral TE 0 Complex TE DIGIT Dimesio 10 mm 10< Dimesio 30 mm 3 30< Dimesio 80 mm 4 80< Dimesio 180 mm 5 180< Dimesio 315 mm 6 315< Dimesio 500 mm Figure. Rotatioal TEs (assembly chai i the axis directio ICED 07/170 3

4 . Modellig of cost-tolerace fuctios Based o the TE-method the actual machiig accuracy capabilities ad the relative cost per TE-class of a particular machie shop are recorded through the Database Feedback Form (DFF of Figure 3. The latter icludes the accuracy cost for all the 6=96 TE-classes i the size rage mm ad toleraces rage IT6-IT10. The relative cost cocept represets, o a comparative basis, the expoetial icrease of costs required for expertise, effort ad resources as the toleraces become tighter, [3,6,8,11]. The 10-grade relative cost scale is show i Table. A DFF is filled oce, whe the system is commissioed, by the expert egieers of the machie shop where the assembly compoets will be maufactured. It ca the be updated each time chages occur i the shop machies, facilities ad/or expertise. Processig of the database data is performed per TE-class through the least-squares approximatio i order to costruct the cost-tolerace relatioship of the power fuctio type [1,7], k ( t = A + B t C / (1 I equatio (1 C(t is the relative cost for the productio of the machiig tolerace ±t ad A, B, k are costats. Costat A represets the cost for producig the TE dimesio with highly relaxed accuracy. Withi the frame of this work this cost compoet is costraied to the relative cost of IT10. The secod part of equatio (1 costitutes, therefore, the accuracy cost for the productio of the TEdimesio with icreased accuracy. Cost-tolerace fuctios established with the described way for all the TE-classes are stored i the system database ad become thus available for machie shop focused cost optimum toleracig. Figure 3. Database Feedback Form ICED 07/170 4

5 Table. Relative cost scale Machiig Relative Cost Ufeasible 10 Extremely difficult 9 Quite difficult 8 Difficult 7 Feasible with some effort 6 Feasible 5 Easily feasible 4 Easy 3 Quite easy Extremely easy 1 3 TOLERANCE DESIGN I a -member dimesioal chai the toleraces of the idividual dimesios D i, i=1,,,, cotrol the variatio of a critical ed-dimesio D 0, accordig to the chai, D 0 = f ( D1, D,..., D where f (D i ca be either a liear or oliear fuctio. To esure that the ed-dimesio will be kept withi its specified tolerace zoe, two approaches are usually employed for tolerace allocatio. The worst-case costrai, that provides for 100% iterchageability, results usually to tight toleraces ad hece to high accuracy costs, f f t1 + t D D 1 f t t D 0 I case that a certai rejectio percetage ca be cosidered as acceptable, the the root-sum-squares costrai that implies the ormal distributio for the dimesioal deviatios is used istead, ( (3 f D 1 t 1 f + D t + f... + t t0 D (4 I above equatios t 0 ad t i are the toleraces of the ed-dimesio D 0 ad the dimesio D i respectively. A additioal costrai that arises from the capability of the process ad machie tools to be used is, ti Tm m = X, Y, Z with T m represetig the available accuracies alog the machiig axes X, Y, Z. Cost optimum toleracig of the assembly chai dimesios ca thus be pursued through the miimizatio of the oliear objective fuctio, C total ki ( t t = Ci ( ti = [ Ai + Bi / ti ] mi, ki 1,.., Bi / ti mi (6 i= 1 i= 1 subject to the costrais (3 or (4 ad (5. 4 METHOD IMPLEMENTATION The prototype software has bee developed usig Microsoft Excel ad Matlab tools. It cosists of two major modules, amely the database module ad the tolerace allocatio module. For the developmet of the database module the add-i Excel Lik is used that allows for data exchage betwee the two eviromets. A expert egieer of the machie shop fills the Database Feedback Form at the system commissioig stage ad sets the curret machie shop accuracy capability. The database module rus oly at this stage ad ay time sice DFF eeds updatig. Cost-tolerace fuctios for the TE-classes are thus automatically computed ad stored i the database. i= 1 (5 ICED 07/170 5

6 The secod module that deals with tolerace allocatio cosists of three submodules: (i module for the requiremets defiitio, (ii module for TE ad cost-tolerace fuctio idetificatio, ad (iii module providig for the optimum solutio through the miimizatio of the automatically established objective fuctio. A user-friedly iterface has bee developed to provide the user with a iteractive widows eviromet for easy ad efficiet system operatio. Sequetial Quadratic Programmig (SQP algorithm of the Matlab Optimizatio Toolbox for costraied oliear optimizatio is used. Startig poit of the algorithm is take the tolerace grade IT10. The flow charts of the database ad the tolerace allocatio modules are show i Figures 4 ad 5 respectively. Figure 4. Database module Figure 5. Tolerace allocatio module ICED 07/170 6

7 5 APPLICATION EXAMPLE AND DISCUSSION I the assembly of compoets A-B-C of Figure 6 below the dimesio D 4 = 75±0.5mm is cotrolled through the two dimesioal chais (D1,D,D3,D4,D5,D6,D7,D8, (D8,D9,D10,D11. Worst case cost optimum toleracig is required for all the chai dimesios. The machie shop where the assembly compoets will be maufactured has a IT6 best capability ad its DFF processed ad results stored. Chai equatios ivolved are, Figure 6. Applicatio example [ D1 ( D6 D7 D cot D3 D5 D8 ] D3 D4 = si (7 D 8 = D11 D10 D9 Case TEs ad cost-tolerace fuctios retrieved by the algorithm from the database are show i Table 3. The total cost model was costructed i accordace with the relatioships (3, (5 ad (6 ad the optimizatio process fially produced the results quoted i Table 4. For system performace evaluatio are also give, i the same table, the results produced by two alterative approaches, a covetioal (ot optimized mode that applies same IT grade, here IT8, for all the chai dimesios startig from the highest IT that satisfies the costrais ad a commercially available toleracig tool. Users A ad B of the commercial tool followed User Istructios ad worked idepedetly usig their ow cost-tolerace kowledge to drive the tool ad produce the results. The total accuracy cost of all three approaches was calculated usig the cost-tolerace fuctios of the preset method, Table 3. Table 3. Cost tolerace fuctios of the applicatio example Dimesio TE Cost tolerace fuctio C ( t = t D /( D 0111 C ( t = / ( t D C 3 ( t3 = t D C 5 ( t5 = t D C 6 ( t6 = /( t D C ( t = ( t 7 7 / 7 (8 ICED 07/170 7

8 D C 9 ( t9 = /( t D C 10 ( t10 = /( t D C ( t = ( t / 11 Dimesio Table 4. Applicatio example results Toleracig Tool IT8 User A User B Preset system D 1 = 190mm ± ± ± ± D = 15 mm ± ± ± ± 0.06 D 3 = 45 ± 0.07 ± ± ± 0.05 D 5 = 14 mm ± ± ± 0.06 ± 0.07 D 6 = 95 mm ± 0.07 ± ± ± D 7 = 0 mm ± ± ± ± D 9 = 75 mm ± 0.03 ± 0.01 ± ± D 10 = 1 mm ± ± ± ± 0.07 D 11 = 97 mm ± 0.07 ± ± 0.00 ± 0.06 Accuracy cost: As it ca be see from the results, miimum total cost was achieved by the preseted system. The system leads to the same toleraces whatever is the IT grade the algorithm is asked to start the accuracy cost optimizatio. That does ot happe with the commercial tool whose results are also strogly user iput depedet. Time eeded to operate such a system is also much loger tha that of the preset method. The covetioal approach, o the other had, although very simple caot guaratee a optimum solutio as it does ot take ito cosideratio cost ifluecig parameters other tha the dimesioal size. Similar results from other case studies cofirm these observatios. 6 CONCLUSIONS Assigmet of proper toleraces to the compoets of a mechaical product is of major importace for the product quality, fuctioality, modularity ad maufacturig cost. This paper itroduced the Tolerace Elemet cocept ad preseted the developmet of a prototype system for the establishmet ad processig of ratioal ad machie shop focused cost-tolerace iformatio. The ew methodology overcomes iefficiecies ad hadicaps of the curretly available toleracig tools ad ca be easily itegrated ito a CAD eviromet. The system database oce created eeds updatig oly whe chages occur i the machie shop resources ad/or expertise. The developed system was used for cost optimal tolerace desig i mechaical assemblies ad produced realistic results i a small fractio of time otherwise required by alterative -computer aided or ot- problem solutios. ACKNOWLEGEMENTS This project is co-fuded by the Europea Uio Europea Social Fud & Natioal Resources EPEAEK II. REFERENCES [1] Zhag G. Simultaeous toleracig for desig ad maufacturig. I Advaced Toleracig Techiques, 1997, pp (Joh Wiley & Sos, New York. [] Huag M.F., Zhog Y.R. ad Xu Z.G. Cocurret process tolerace desig based o miimum product maufacturig cost ad quality loss. The Iteratioal Joural of Advaced Maufacturig Techology, 005, 5, [3] Hu J. ad Xiog G. Dimesioal ad geometric tolerace desig based o costraits. The Iteratioal Joural of Advaced Maufacturig Techology, 005, 6, [4] Sigh P.K., Jai S.C. ad Jai P.K. Advaced optimal tolerace desig of mechaical assemblies with iterrelated dimesio chais ad process precisio limits. Computers i ICED 07/170 8

9 Idustry, 005, 56, [5] Sfatsikopoulos M.M. A cost-tolerace aalytical approach for desig ad maufacturig. The Iteratioal Joural of Advaced Maufacturig Techology, 1990, 5, [6] Yeo S.H., Ngoi B.K.A. ad Che H. A cost-tolerace model for process sequece optimizatio. The Iteratioal Joural of Advaced Maufacturig Techology, 1996, 1, [7] Chase K.W. Tolerace allocatio methods for desigers. ADCATS Report No. 99 6, [8] Kulkari U.A. ad Bao H.P. Close-loop cost equatio for objects maufactured by millig. Joural of Maufacturig Sciece ad Egieerig, ASME, 003, 15, [9] Ullma D.G. The Mechaical Desig Process, 199 (McGraw-Hill, New York. [10] Opitz H. A Classificatio System to Describe Workpieces, 1970 (Pergamo Press, Oxford. [11] Ehrlespiel K. Kostegüstig Kostruiere, 1985 (Spriger-Verlag, Berli. Cotact: S. Ch. Dimitrellou Natioal Techical Uiversity of Athes (NTUA Departmet of Mechaical Desig & Cotrol Systems 9 Iroo Polytechiou Str , Athes Greece ( ( sdimitre@cetral.tua.gr ICED 07/170 9

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS

Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS 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

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones 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 information

The identification of key quality characteristics based on FAHP

The 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 information

1 Enterprise Modeler

1 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 information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization 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 information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy 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 information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A 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 information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: 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 information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

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 information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An 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 information

Cubic Polynomial Curves with a Shape Parameter

Cubic 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 information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 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 information

3D Model Retrieval Method Based on Sample Prediction

3D 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 information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian 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 information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An 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 information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. 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 information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis 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 information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

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 information

Polynomial 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

Polynomial 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 information

Stone Images Retrieval Based on Color Histogram

Stone 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 information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What 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 information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern 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 information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement 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 information

Available online at ScienceDirect. Procedia CIRP 53 (2016 ) 21 28

Available online at   ScienceDirect. Procedia CIRP 53 (2016 ) 21 28 vailable olie at www.sciecedirect.com ScieceDirect Procedia CIRP 53 (206 ) 2 28 The 0th Iteratioal Coferece o xiomatic Desig, ICD 206 systematic approach to couplig disposal of product family desig (part

More information

FEATURE RECOGNITION OF ROTATIONAL PARTS USING BIQUADRATIC BEZIER PATCHES

FEATURE RECOGNITION OF ROTATIONAL PARTS USING BIQUADRATIC BEZIER PATCHES roceedigs of the Iteratioal Coferece o Mechaical Egieerig 7 (ICME7) 9-31 December 7, Dhaka, Bagladesh ICME7- FEATURE RECOGNITION OF ROTATIONAL ARTS USING BIQUADRATIC BEZIER ATCHES J. Kumar 1 ad N. Roy

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile 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 information

Elementary Educational Computer

Elementary 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 information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 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 information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 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 information

ANN WHICH COVERS MLP AND RBF

ANN 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 information

Optimal Tolerance Allocation Based on Fuzzy Comprehensive Evaluation and Genetic Algorithm

Optimal 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 information

Service Oriented Enterprise Architecture and Service Oriented Enterprise

Service Oriented Enterprise Architecture and Service Oriented Enterprise Approved for Public Release Distributio Ulimited Case Number: 09-2786 The 23 rd Ope Group Eterprise Practitioers Coferece Service Orieted Eterprise ad Service Orieted Eterprise Ya Zhao, PhD Pricipal, MITRE

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis 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 information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

An Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem

An 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 information

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables

2D 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 information

Performance Plus Software Parameter Definitions

Performance 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 information

BASED ON ITERATIVE ERROR-CORRECTION

BASED 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 information

Baan Tools User Management

Baan Tools User Management Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact 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 information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating 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 information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive 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 information

NON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE

NON-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 information

Fuzzy Linear Regression Analysis

Fuzzy 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 information

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,

More information

Lecture 21: Variation Risk Management

Lecture 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 information

The Magma Database file formats

The 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 information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning 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 information

Python Programming: An Introduction to Computer Science

Python 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 information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 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 information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

Structuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software

Structuring 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 information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

How do we evaluate algorithms?

How 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

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

Data Structures and Algorithms. Analysis of Algorithms

Data 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 information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Available online at ScienceDirect. Procedia CIRP 27 (2015 ) th CIRP conference on Computer Aided Tolerancing

Available online at   ScienceDirect. Procedia CIRP 27 (2015 ) th CIRP conference on Computer Aided Tolerancing Available olie at www.sciecedirect.com ScieceDirect Procedia CIRP 27 (205 ) 28 285 3th CIRP coferece o Computer Aided Toleracig Applicatio of Mote Carlo Method i Tolerace Aalysis Huiwe Ya, Xiagji Wu, Jiagxi

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN 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 information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task 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 information

Lecture 18. Optimization in n dimensions

Lecture 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 information

A Path Planning Method for Robotic Belt Surface Grinding

A Path Planning Method for Robotic Belt Surface Grinding Chiese Joural of Aeroautics 24 (2011) 520-526 Cotets lists available at ScieceDirect Chiese Joural of Aeroautics joural homepage: www.elsevier.com/locate/cja A Path Plaig Method for Robotic Belt Surface

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

FREQUENCY 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 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 information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running 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 information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A 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 information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

Image Segmentation EEE 508

Image 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 information

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An 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 information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies

More information

condition w i B i S maximum u i

condition 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 information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Customer Portal Quick Reference User Guide

Customer Portal Quick Reference User Guide Customer Portal Quick Referece User Guide Overview This user guide is iteded for FM Approvals customers usig the Approval Iformatio Maagemet (AIM) customer portal to track their active projects. AIM is

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha 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 information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms 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 information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals 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 information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

Examples and Applications of Binary Search

Examples and Applications of Binary Search Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

GPUMP: a Multiple-Precision Integer Library for GPUs

GPUMP: a Multiple-Precision Integer Library for GPUs GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN 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 information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) 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.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

Analysis of Algorithms

Analysis 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 information

What are Information Systems?

What are Information Systems? Iformatio Systems Cocepts What are Iformatio Systems? Roma Kotchakov Birkbeck, Uiversity of Lodo Based o Chapter 1 of Beett, McRobb ad Farmer: Object Orieted Systems Aalysis ad Desig Usig UML, (4th Editio),

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture 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 information

Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL

Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 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 information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A 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 information

Security of Bluetooth: An overview of Bluetooth Security

Security of Bluetooth: An overview of Bluetooth Security Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give

More information