FEATURE RECOGNITION OF ROTATIONAL PARTS USING BIQUADRATIC BEZIER PATCHES

Size: px
Start display at page:

Download "FEATURE RECOGNITION OF ROTATIONAL PARTS USING BIQUADRATIC BEZIER PATCHES"

Transcription

1 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 3 1 Departmet of Mechaical egieerig, B.B.S. College of Egieerig & Techology, haphamau Allahabad-1113 U Idia Departmet of Mechaical egieerig, M.N.N.I.T.Allahabad-114 U Idia jitedra5@rediffmail.com ABSTRACT For the automatio of the process plaig fuctio a complete represetatio of the part is very useful. Features recogitio is cosidered as the bridge betwee computer aided desig (CAD) ad computer aided process plaig (CA). The purpose of feature recogitio is to covert the geometric CAD data of a part ito a set of features suitable to support maufacturig activities such as i process plaig system. This paper proposes a method for features recogitio by usig biquadratic Bezier patch, which is similar to sytactic patter recogitio approach. I this paper a part is represeted by the some specific coordiates accordig to give table ad these coordiates are used oly for idetifies the differet faces of the part with the help of patter primitives. Now these coordiates are implemeted i biquadratic Bezier patch equatio for the purpose of feature recogitio of the rotatioal parts by matchig from predefied features. This method of feature recogitio is limited to the turig features such as all types of grooves, chamfer, cocave & covex surfaces, tapers, etc. Keywords: Form features; Feature recogitio; Surface represetatio; art represetatio Bezier patch 1. INTRODUCTION For maufacturig a part process plaig is ecessary which ivolves detailed descriptio of the part for the purpose of process plaig activity icludig selectio of processes, sequecig of the processes, selectio of machie tools ad cuttig tools, decisio about cuttig parameters, choice of jigs ad fixtures ad calculatio of machiig times ad costs. Computer aided process plaig has a very importat role for the itegratio of computer aided desig ad computer aided maufacturig, ad makes a purpose full relatio betwee CAD ad CAM. art descriptio of the CAD model i basic form of geometry ad topology that ca ot be used for directly for process plaig because it requires iformatio i the form of features ad ca be extracted from this CAD model. It is a problem for process plaig that how the feature ca be maufactured ad this iformatio ca be used i process plaig. I this paper a algorithm to recogize features by usig biquadratic Bezier patch which has got similarities with sytactic patter recogitio approach. The applicatio of this techique to recogize turig features is preseted. Turig features are selected i this study because they form the majority type of features i mechaical parts ad products. rocess plaig requires part form feature iformatio ot geometric iformatio. Hece extractig promisig approach to solve this problem [1]. the required iformatio from the CAD data is a problem that must be solved. Feature recogitio is the most Oral et al. [] defie computer aided optimum operatio ad tool sequeces that are to be used i Geerative rocess laig System developed for rotatioal parts. The recogitio of features such as U-groove, V-groove, slot, tapers, covex ad cocave form a importat subset of feature recogitio [3]. Kim et al. [1] deals with the developmet of a computer-aided process plaig system iterfaced with CAD for turig operatio. The method developed by Joshi ad Chag is a good example of a graph based approach to feature recogitio. I this the boudary represetatio of the part is traslated ito a graph where its odes represet faces ad its arcs represet edges [13]. Features are cosidered to be machied volumes ad are described i a hierarchical taxoomy that is desiged to be useful across a rage of machied compoets [6]. Feature recogitio is a sub-disciplie of solid modelig that focuses o the desig ad implemetatio of algorithms for detectig maufacturig iformatio from solid models produce by CAD system [4]. For the purposes of feature recogitio, segmetatio or shape aalysis it is ofte importat to compute curvature ICME7 1

2 iformatio. Razda ad Bae [7] preset a ovel method, which uses biquadratic Bezier patches as a surface fittig techique. Based o the CIM strategy, CA system allows the user to develop a itegrated structure that deals with the flow of iformatio betwee CAD, CA, MR ad CAM activities withi the compay [1]. Razda ad Bae [5] proposed a hybrid method, which takes advatage of both methods, ad create regios with complete feature loops. Satisfactory results have bee achieved for both CAD parts as well as other laser s caed objects such as boes ad ceramic.. ART RERESENTATION A object orieted part modular represets a part as a assembly of the form features. The part modular has the capability to represet ad store geometrical ad techological iformatio of each form feature. The form features class hierarchy classifyig the form features of a part as primary ad secodary features. The primary features give the overall shape to the part. The secodary features reside o the primary features ad add details to the part [11]. 3. SURFACE RERESENTATION Surfaces ca be described mathematically i 3D space by o-parametric or parametric equatios. There are several methods to fit o- parametric surfaces to a give set of data poits. The equatio of the surface or surface patch is give by = [x y z] T = [x y f(x, y)] T Where is the positio vector of a poit o the surface (figure 4.1). The atural form of the fuctio f (x, y) for a surface to pass through all the give data poits is a polyomial that is m i j Z = f( x, y) = y (1) i= j= ax ij Where the surface is described by a x y grid of size (m+1) * (+1) poits. The parametric represetatio of a surface meas a cotiuous vector valued fuctio (u, v) of two variables or parameters u ad v, where the variables are allowed to rage over some coected regio of the u v plae ad as they do so. (u, v) as sums every positio o the surface. The fuctio (u, v) at certai u ad v values is the poit o the surface at these values to described the parametric equatio of a 3D curved surface i space is (u, v) = [x y z] T = [x (u, v) y (u, v) z (u, v)] T () u mi u u max, v mi v v max This equatio gives the coordiates of a poit o the surface as the compoets of its positio vector. It uiquely maps the parametric space (E i u ad v values) to the Cartesia space (E 3 i x, y ad z) [8]. This equatio suggests that a geeral 3-d surface ca be modeled by dividig it ito a assembly of topological patches. The iterval is (, 1) for both u ad v. A patch is cosidered the basic mathematical elemet to model a composite surface. Some surfaces may cosist of oe patch oly while others may be a few patches. The topology of a patch may be rectagular or triagular. Triagular patches add more flexibility i surface modelig because they do ot require ordered rectagular array of data poits to create the surface as the rectagular patches do. 4. BEZIER CURVES AND SURFACES To obtai a more free form desig for aesthetic surfaces that satisfy some requiremets, the modelig techiques eed to provide more flexibility for chagig the shape. This ca be achieved by the use of Bezier curves amed after. Bezier, the desiger of the Frech car compay Reault, who iveted the procedure i the 196 s. Bezier curve uses the vertices as cotrol poits. The curve will pass through the first ad last poit with all other poits actig as cotrol poits. Figure 1 show the cotrol polygo ad the geerated smooth curve [9]. The flexibility of the process ca be see by chagig the positio of the idividual cotrol poits i space, thereby alterig the cotrol polygo. The flexibility of the curve becomes more with more cotrol poits. The process ca be exteded for the surfaces as well. Bezier select Berstei polyomials as the basis fuctios for the curves. They are specified as i Bi, ( u) = C(, i) u (1 u) Where i! Ci (, ) = i! i! ( ) Based o these basis fuctios, the equatio for the Bezier curve is give by ( u) bb ( u) = u (,1) i= For =3, we get i ( 1 u) 3 i, B,3 = B1,3 = 3(1 u u) B,3 = 3 u (1 u) 3 B3,3 = u ( u) = (1 u) b + 3 u(1 u) b + 3 u (1 u) b + u b The Bezier surface is the direct extesio of the Bezier curve. oits o a Bezier surface ca be specified as a extesio of the Bezier curve. m ( uv, ) bb ( ub ) ( v) uv, (,1) = i= j= ij i, m j, ICME7

3 Cotrol poits curve Cotrol polygoe features are those features that ca be created by machiig operatios o lathe or a turig machie. rismatic features ca be created by machiig operatios o a millig machie or a three-axis machiig ceter. With the special characteristics of the shapes ad operatios, rotatioal features are defied based o the D profile patter, ad the prismatic features are defied i terms of the 3D boudary faces Fig 1: Bezier curve ad the associated cotrol polygo Where b ij represet the rectagular array of cotrol poits (m+1) (+1) defiig the vertices of the characteristic polyhedro of the Bezier patch for a 4 4 poits. The matrix form of this equatio for a 4 4-cotrol poits is 3 (1 v) 3 3 3(1 v v) uv (, ) = (1 u) 3 u(1 u) 3 u(1 uu ) b 3 v (1 v) 3 v The matrix b cotais the poits that defie the characteristic polyhedro b b b b b b b b b = b1 b b3 b4 b b b b SYNTACTIC ATTERN-RECOGNITION AROACH The basic of the sytactic patter recogitio approach is the decompositio of patter ito sub patters or primitives such a decompositio of a chromosome structures i terms of primitives ad to detect ad ecode these primitives i the form of strig. Feature recogitio is a desig iterface for process plaig which is a automatic trasfer of part descriptio data from CAD system to process plaig system. Oral et al. [] have developed a sytactic patter recogitio techique for the extractio of maufacturig details from geometric models. I this system, a part is represeted as a sytactic patter made up of geometric primitives i D ad sixtee patter primitives were defied.. Turig surfaces ca be defied a elemets such as diameter, taper, face, arc, chamfer, ad groovig with the aim of patter primitives. 6. FEATURE DEFINITION A machiig feature ca be cosidered as a portio of part haveig a maufacturig attribute ad ca be created with certai machiig operatios. Rotatioal 7. FEATURE RECOGNITION ROCEDURE The part feature recogitio system that is developed has got similarities with sytactic patter recogitio approach. I sytactic patter recogitio approach 16 patter primitives are used to formalize the patter recogitio process. For example, a diameter ca be represeted by either the patter primitives A or C; a face ca be represeted by B or D. 7.1 atter rimitives The basic of this method is the decompositio of patters ito sub patters or primitives, that is the decompositio of complex patters ad sub patters is carried out util the simplest sub patters, kow as patter primitives, are obtaied. atter primitives will have simple descriptio ad ca easily be recogized. To desig part feature recogitio system, twety patter primitives have bee defied as show i figure. Each patter primitive is represeted by a specific coordiate ad this coordiate oly for idetifies the particular directio of primitive. These coordiates are show i table 1. It has differet shapes of lie ad arc segmets with a start poit, a termial poit, a ceter poit, ad a directio. A code i terms of coordiate is assiged to patter primitives to idetify them. With the help of patter primitives, turig surfaces such as diameter, taper, face, ad arc ca be defied specifically. 7. re- defied Features Each predefied feature cosists of three surfaces ad has a uique patter strig where patter strig is defied as a group of characters. Accordig to the directio some predefied features are show i table. The part feature recogitio system depeds o the umber of predefied features icluded ad the system is sophisticated whe it is used for a large umber of predefied features. I this method of feature recogitio a part is represeted by coordiates to formalize the patter recogitio process. I this all coordiates are varies from to 1 oly [u, v, (, 1)]. Bezier surface equatio is a parametric equatio of characteristic polyhedro ad the parameters are u ad v. oit o a Bezier surface are give by a simple expressio of geeral equatio for poits o a Bezier curve[9]. m ( uv, ) bb ( ub ) ( v) = i= j= ij i, m j, uv, (,1) (3) For features recogitio a biquadratic Bezier patch has bee used. The equatio of a biquadratic Bezier patch is ( uv, ) bb ( ub ) ( v) = i= o j= ij i, j, ICME7 3

4 uv, (,1) (4) Where b ij are Bezier cotrol poits, B i, (u) ad B j, (v) are Berstei basis fuctios i the u ad v parametric directio. i m i Bim, ( u) = C( m, i) u (1 u) m! Cmi (, ) = i! ( m i)! B, = (1 u) B1, = u(1 u) B, = u The equatio (4) ca be expaded to give (u, v) = B i, (u) [b i B, (v) + b i 1 B 1, (v) + b i B, (v)] i= = B, (u) [b B, (v) + b 1 B 1, (v) + b B, (v)] + B 1, (u) [b 1 B, (v) + b 1 1 B 1, (v) + b 1 B, (v)] + B, (u) [b B, (v) + b 1 B 1, (v) + b B, (v)] (6) 7.3 re-requisites of the model The followig assumptios are made for developmet of model: 1. Each patter primitive has give a uique code ad its coordiate accordig to give table.. Each pre-defied feature has a uique strig ad is a set of three coordiates. 3. The legth of patter primitive is ot cosidered. 4. The part feature recogitio system is applicable oly for two-dimesioal profile of ay rotatioal object. 5. Always read the strigs from left had sides. 6. At ay coditio remaiig patter strig will be p p 6 p [(.5,.5)(1, )(.6, -.6)(, )], which show shape of the raw material. p o p (, + ) ( ++, ) (, ) ( +, ) p 3 (u, v) = [ b B, (u) B, (v) + b 1 B, (u) B 1, (v) + b B, (u) B, (v) + b 1 B 1, (u) B, (v) + b 1 1 B 1, (u) B 1, (v) + b 1 B 1, (u) B, (v + b B, (u) B, (v) + b 1 B, (u) B 1, (v) + b B, (u) B, (v)] (7) p 7 p 5 The equatio ca be writte i a matrix form as b b1 b b1 uv (, ) = B,( ub ),( v) B, ( ub ) 1, ( v) B,( ub ),( v) b11 b1 b b1 b Now settig all the above values i matrix form accordig to equatio AB=, where A is computed from the Berstei basis fuctio cotributio of each poit, B is sigle colum matrix of Bezier cotrol poits b i j (figure 3) ad is the sigle colum matrix of poits to be fitted (p ) for the part [7]. B, ( u) B,( v ) B,( u ) B, ( v ) b b 1 1 b b1 3 b 11 = 4 b1 5 b 6 b1 7 B,( u) B, ( v) B,( u) B,( v) b p 8 p p Fig : atter rimitives 3 5 ICME7 4

5 Table 1: Sr. No. atter rimitive Coordiate 1 p o (, ) (,.5) 3 p (.5,.5) 4 p 3 (1,.5) 5 (1, ) 6 p 5 (1, -.3) 7 p 6 (.6 -.6) 8 p 7 (, -.3) 9 p 8 (1,.4) 1 p 9 (.4, 1) 11 (1,.7) 1 1 (.7, 1) 13 (1,.8) 14 3 (.8, 1) 15 4 (1,.6) 16 5 (.6, 1) 17 6 (.3,.5) 18 7 (.5,.3) 19 8 (.,.4) 9 (.4,.) 7.4 Model Developmet The model is follows a fixed procedural step. It has bee developed i C eviromet. The specific steps of procedure for recogizig features from the two-dimesioal profile of ay rotatioal object are described i the successive paragraphs of this paper. The algorithm is divided i six phases. The first phase cosiders the umber of turig features ad turig surfaces preset i -D profile of a rotatioal object. I the secod phase, a part is represeted by -D profile iformatio is expressed as a patter strig with the help of primitives ad its coordiates. I the third phase, a iput file is opeed for patter strig ad takig the prit out of the iput file makes subsequetly a maual checkig. The file ca be subsequetly modified i case if there is ay error I the fourth phase, the iput file created i phase three is utilized to calculatig Berstei basis fuctio for each surface ad used i biquadratic Bezier patch equatio, ad gettig the results i the form of sigle colum matrix of coordiates. I the fifth phase, the results are utilized to match the coordiates with the coordiate set of pre-defied feature. I the sixth phase, a output file is opeed to tore the umber of turig surface preset ad feature strigs that are matched with pre-defied features. The remaiig patter strig shows the shape of raw material. 7.5 Algorithm Ste: a. Create the profile view of the part. b. Assig a uique idetificatio umber correspodig to each turig surfaces. Specific rules are outlied for the idetificatio of turig surfaces: (i) The first surface is left ed of the part. (ii) Labelig will begi at surface 1 ad proceed i a clockwise maer. Step : Represet the part as a patter strig by usig patter primitives ad its correspodig coordiates. All coordiates are varies from to 1 [ uv, (,1)]. Step 3: Calculatig Berstei basis fuctio for each surface ad settig these i matrix form equatio of sigle colum matrix of a biquadratic Bezier patch. Ste: Examie the result of sigle colum matrix of coordiates if: a. A match is foud, extract the feature ad fill the void. Go to step 6. b. No match is foud. Go to step 5. Step 5: Create a ew feature, if possible ad store i the table of pre-defied feature. Step 6: Retrieve the features i chroological order. Stop. Fig 3: arametric space (Source: Ref. 9 Fi 3 t i 8. ILLUSTRATIVE EXAMLE A rotatioal part is cosidered ad figure 4 shows a biquadratic Bezier patch fitted to surface of the rotatioal part. Fig 4: A biquadratic Bezier atch fitted to surface of the rotatioal part rotatioal part ICME7 5

6 p Ste The part cosidered i the figure 5, creatig a two dimesioal profile of rotatioal part havig two grooves oe rectagular ad other is v-groove. art is desiged by revolvig the two-dimesioal profile about x-axis. I this figure total umber of turig surfaces are 13 p 6 p p 5 p 5 p 3 umber of extracted features are three (figure 6). Remaiig patter strigs give the shape of the blak. For example p p 6 p [(.5,.5) (1, ) (.6, -.6) (, )]. (.6, -.6) (.5,.5) (1, ) (1, ) (1, -.3) (1, ) p 6 p o Fig 5.: Two-dimesioal profile view of the part represet by patter primitives Step figure 5 represets the part as a patter strigs ad its coordiates by usig patter primitives accordig to table 1. All coordiates are varies from to 1 [u, v,(,1)]. atter Strig: p (.5,.5) (1, ) p 6 (.6, -.6) (1, ) p (.5,.5) (1, ) p 5 (1, -.3) (1, ) p 5 (1, -.3) p 3 (1,.5) (1, ) p 6 (.6, -.6) p (, ) Step 3 Now calculatig Berstei basis fuctio for each surface accordig to equatio (5) ad settig the results i matrix form accordig to equatio (9). We get the followig result i the form of sigle colum matrix of coordiates. For p (.5,.5) B,( u) B,( v) =.65 B,( u) B1, ( v) =.15 B,( u) B,( v) =.65 B1, ( u) B, ( v) =.15 B1, ( u) B1, ( v) =.5 B1, ( u) B, ( v) =.15 B,( u) B,( v) =.65 B,( u) B1, ( v) =.15 B ( u) B ( v) =.65,, Ste Read three coordiates at a time start from upper side ad match with predefied features from table. For example read coordiates (.5,.5)(1, )(.6, -.6) [p p 6 ] ad matched with pre-defied features. We ca see that this strig is ot matched with pre-defied features; skip the first coordiate ad read ext three coordiate set. Repeat the procedure, till the lowermost coordiate is evaluated ad update the patter strig. We get the followig results i the form of features. I this part total (1, ) (1, -.3) (1,.5) Fig 6:. Extracted features 9. RESULT AND DISCUSSION This method of feature recogitio by biquadratic Bezier patch performs better tha others ad has some similarities from sytactic patter recogitio approach. From above example we ca see that every part is requirig coordiates which are easily selected from the table: 1. Feature recogitio by this method is easy ad simple from earlier methods of feature recogitio. The methodology developed i this thesis has bee used for two-dimesioal profile view of differet rotatioal parts coverig various types of features. Subsequetly, a few examples are used to illustrate the validatio of the methodology. We ca see that the methodology developed here ca give approximately same result as compared to sytactic patter recogitio approach. 1. CONCLUSION The importat advatages of recogizig features usig coordiates iformatio of the rotatioal parts are its ability to easily recogize turig features. Further research is required to be coducted for compoud features. The feature iformatio ca be used to determie tool approach directios for machiig ad developmet of machiig sequeces. It has bee observed that ew features ca be idetified ad added to pre defied feature table. The outcome of the aalysis will result i creatig the blak, represeted by a set of primitives. The remaiig patter strig represets the shape of the raw material. The procedure developed by the author are based o certai assumptios such as every turig face is represeted by a specific coordiate. ICME7 6

7 = 6 6 = Table : Sr. No. redefied Features Strig Coordiates 1 p p (1, )(.5,.5)(, ) p 6 p (.6, -.6)(1, )(.5,.5) 3 p 5 p 3 (1, )(1, -.3)(1,.5) 4 p p p 6 (.5,.5)(, )(.6, -.6) 5 p 5 (1, )(1, -.3)(1, ) ICME7 7

8 11. REFERENCES 1. Liu, S., Feature extractio ad classificatio for rotatioal parts takig 3D data files as iput. Joural of the Chiese Istitute of Idustrial Egieers (5) Oral, A., ad Cemal Cakir, M., Automated cuttig tool selectio ad cuttig tool sequece optimizatio for rotatioal parts. Robotics ad Computer-Itegrated Maufacturig Ismail, N., Abu Baker, N., ad. Juri, A. H., Recogitio of cylidrical ad coical features usig edge boudary classificatio. Iteratioal Joural of Machie Tools & Maufacture Ha, J., ratt, M., ad Regli, W. C., Maufacturig Feature recogitio from solid models: A status report. IEEE Trasactios o Robotics ad Automatio (6).. 5. Razda, A., ad Bae, M., A hybrid approach to feature segmetatio of triagle meshes. Computer-Aided Desig Case, K., ad Haru, W. A. W., Feature-based represetatio for maufacturig plaig. Iteratioal Joural of roductio Research (17).. 7. Razda, A., ad Bae, M., Curvature estimatio scheme for triagle meshes usig biquadratic Bezier patches. Computer-Aided Desig Zeid, I., CAD/CAM Theory ad ractice. (New York: McGraw-Hill). pp Morteso, M. E., Geometric Modelig. (Washigto: Joh Wiley & Sos). pp Ciuraa, J., Garcia-Romeu, M. L., Castro, R., ad Alberti, M., A system based o machied volumes to reduce the umber of route sheets i process plaig. Computers i Idustry Shumugam, M. S., Mahesh,., ad Bhaskara Reddy, S. V., A method of prelimiary plaig for rotatioal compoets with C-axis features usig geetic algorithm. Computers i Idustry Kim, I., ad Cho, K., A itegratio of feature recogitio ad process plaig fuctios for turig operatio. Computers ad Idustrial Egieerig (1-4) Joshi, S., ad Chag, T. C., Graph-based heuristics for recogitio of machied features from a 3D solid model. Computer-Aided Desig ICME7 8

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

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

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

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

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

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

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

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

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

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

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

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n 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 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

Convex hull ( 凸殻 ) property

Convex hull ( 凸殻 ) property Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull

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

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

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

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

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed. MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics

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

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

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

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

Improving Template Based Spike Detection

Improving 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 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

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

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

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More 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

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

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Parametric 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

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

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

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

. 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

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

Panel for Adobe Premiere Pro CC Partner Solution

Panel for Adobe Premiere Pro CC Partner Solution Pael for Adobe Premiere Pro CC Itegratio for more efficiecy The makes video editig simple, fast ad coveiet. The itegrated pael gives users immediate access to all medialoopster features iside Adobe Premiere

More information

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control

EE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,

More information

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word

l-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity

More information

New HSL Distance Based Colour Clustering Algorithm

New 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

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT

GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT 6th Iteratioal DAAAM Baltic Coferece INDUSTRIAL ENGINEERING 24-26 April 2008, Talli, Estoia GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT Rahayem, M.; Kjellader,

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 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:

More information

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs

Outline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio

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

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

More information

Position and Velocity Estimation by Ultrasonic Sensor

Position and Velocity Estimation by Ultrasonic Sensor Positio ad Velocity Estimatio by Ultrasoic Sesor N Ramarao 1, A R Subramayam 2, J Chara Raj 2, Lalith B V 2, Varu K R 2 1 (Faculty of EEE, BMSIT & M, INDIA) 2 (Studets of EEE, BMSIT & M, INDIA) Abstract:

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

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR

More information

Direct Generative Vehicle Machining

Direct Generative Vehicle Machining 547 Direct Geerative Vehicle Machiig Zheyu Cheg 1, C. Greg Jese 2 ad W. Ed Red 3 1 Brigham Youg Uiversity, chegzy@email.byu.edu 2 Brigham Youg Uiversity, cese@byu.edu 3 Brigham Youg Uiversity, ered@et.byu.edu

More information

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Parabolic Path to a Best Best-Fit Line:

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

Automated Extraction of Urban Trees from Mobile LiDAR Point Clouds

Automated Extraction of Urban Trees from Mobile LiDAR Point Clouds Automated Extractio of Urba Trees from Mobile LiDAR Poit Clouds Fa W. a, Cheglu W. a*, ad Joatha L. ab a Fujia Key Laboratory of Sesig ad Computig for Smart City ad the School of Iformatio Sciece ad Egieerig,

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Appendix D. Controller Implementation

Appendix D. Controller Implementation COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

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

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

SCAN INSPECT TRACK SOLVE

SCAN INSPECT TRACK SOLVE SCAN INSPECT TRACK SOLVE Sca. Ispect. Track. Solve. These simple words drive the complex solutios we provide for the challeges our customers face. Need to sca a code? Not a issue. Ispect a vial? No problem.

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 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 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

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

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

A New Bit Wise Technique for 3-Partitioning Algorithm

A New Bit Wise Technique for 3-Partitioning Algorithm Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai

More information

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE

WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE WEBSITE STRUCTURE IMPROVEMENT USING ANT COLONY TECHNIQUE Wiwik Aggraei 1, Agyl Ardi Rahmadi 1, Radityo Prasetyo Wibowo 1 1 Iformatio System Departmet, Faculty of Iformatio Techology, Istitut Tekologi Sepuluh

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

PETRI NETS GENERATING KOLAM PATTERNS

PETRI NETS GENERATING KOLAM PATTERNS . Lalitha et al / Idia Joural of omputer Sciece ad Egieerig (IJSE) PETRI NETS GENERATING KOLAM PATTERNS. Lalitha epartmet of Mathematics Sathyabama Uiversity, heai-119, Idia lalkrish_24@yahoo.co.i K. Ragaraja

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Lip Contour Extraction Based on Support Vector Machine

Lip Contour Extraction Based on Support Vector Machine Lip Cotour Extractio Based o Support Vector Machie Author Pa, Xiaosheg, Kog, Jiagpig, Liew, Ala Wee-Chug Published 008 Coferece Title CISP 008 : Proceedigs, First Iteratioal Cogress o Image ad Sigal Processig

More information

Goals of this Lecture Activity Diagram Example

Goals of this Lecture Activity Diagram Example Goals of this Lecture Activity Diagram Example Object-Orieted Aalysis ad Desig - Fall 998 Preset a example activity diagram Ð Relate to requiremets, use cases, ad class diagrams Also, respod to a questio

More information

Area As A Limit & Sigma Notation

Area As A Limit & Sigma Notation Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your

More information

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna

A Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,

More information

Implementation of Panoramic Image Mosaicing using Complex Wavelet Packets

Implementation of Panoramic Image Mosaicing using Complex Wavelet Packets Available olie www.eaet.com Europea Joural of Advaces i Egieerig ad Techology, 2015, 2(12): 25-31 Research Article ISSN: 2394-658X Implemetatio of Paoramic Image Mosaicig usig Complex Wavelet Packets 1

More information

Math 10C Long Range Plans

Math 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 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

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

Orientation. Orientation 10/28/15

Orientation. Orientation 10/28/15 Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy

More information

Baan Finance Financial Statements

Baan Finance Financial Statements Baa Fiace Fiacial Statemets Module Procedure UP041A US Documetiformatio Documet Documet code : UP041A US Documet group : User Documetatio Documet title : Fiacial Statemets Applicatio/Package : Baa Fiace

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

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

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra 1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

More 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

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

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9. Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for

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

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

Mean cordiality of some snake graphs

Mean cordiality of some snake graphs Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:

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

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 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.

More information

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,

More information

COP4020 Programming Languages. Functional Programming Prof. Robert van Engelen

COP4020 Programming Languages. Functional Programming Prof. Robert van Engelen COP4020 Programmig Laguages Fuctioal Programmig Prof. Robert va Egele Overview What is fuctioal programmig? Historical origis of fuctioal programmig Fuctioal programmig today Cocepts of fuctioal programmig

More information

Data diverse software fault tolerance techniques

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

South Slave Divisional Education Council. Math 10C

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

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research

More information

Neural Networks A Model of Boolean Functions

Neural Networks A Model of Boolean Functions Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de

More information