Kinematic Synthesis of Planar, Shape-Changing Rigid-Body Mechanisms

Size: px
Start display at page:

Download "Kinematic Synthesis of Planar, Shape-Changing Rigid-Body Mechanisms"

Transcription

1 Adrew P. Murray Mechaical ad Aerospace Egieerig, Uiversity of Dayto, Dayto, OH James P. Schmiedeler Bria M. Korte Mechaical Egieerig, The Ohio State Uiversity, Columbus, OH Kiematic Sythesis of Plaar, Shape-Chagig Rigid-Body Mechaisms This paper presets a kiematic procedure to sythesize plaar mechaisms, composed of rigid liks ad revolute joits, capable of approximatig a shape chage defied by a set of curves. These morphig curves, referred to as desig profiles, differ from each other by a combiatio of rigid-body displacemet ad shape chage. Desig profiles are coverted to piecewise liear curves, referred to as target profiles, that ca be readily maipulated. I the segmetatio phase, the geometry of rigid liks that approximate the shapes of correspodig segmets from each target profile is determied. I the mechaizatio phase, these rigid liks are joied together at their ed poits with revolute joits to form a sigle chai. Dyads are the added to reduce the umber of degrees of freedom (DOF s) to ay desired value, typically 1. The approach ca be applied to ay umber of desig profiles that ca be approximated with ay umber of rigid liks, which ca the be used to costruct a mechaism with ay umber of DOF s. Naturally, greater difficulty is ecoutered for larger umbers of desig profiles ad/or liks ad for more dramatic chages i shape. The procedure is demostrated with examples of sigle-dof mechaisms approximatig shape chages betwee two ad three desig profiles. DOI: / Itroductio For a mechaical system whose fuctio depeds o its geometric shape, the ability to alter that shape i a cotrolled maer ca ehace performace ad expad applicatios. Example systems with such capabilities, ofte kow as adaptive or morphig structures, iclude morphig airfoils 1, active aperture ateas 2, ad deformable mirrors for adaptive optics systems 3. A sigificat amout of research has bee devoted to actuatig adaptive structures usig smart materials techology. Morphig airfoils have bee proposed with magetostrictive 4,5, piezoelectric 6, ad shape memory alloy 7 11 actuators. Piezoelectric actuators have bee proposed for atea reflectors ad bimorph mirrors 15. Compliat mechaisms provide a meas of structurally imposig a shape chage 16 regardless of the type of actuatio. Saggere ad Kota 17 developed a sythesis procedure for compliat four-bars that guide their flexible couplers through a sequece of discrete prescribed precisio shapes that ivolve both shape chage ad rigid-body displacemet. Lu ad Kota 18 itroduced ad the refied 19 a more geeral approach usig fiite elemet aalysis ad a geetic algorithm to determie a optimized compliat mechaism s topology ad dimesios give the target profiles, support locatios, exteral loads, actuator types ad locatios, desig domai, ad material properties. Stubbs et al. 20 desiged a sigle-degree-of-freedom DOF, rigid-body mechaism that could morph betwee two desired airfoil shapes. The sythesis techique applies specifically to a quaterary-biary cross-liked mechaism that was selected based o the uique costraits of the specific morphig wig problem. Erdma et al. 21 show diagrams of two shape-chagig rigidbody mechaisms: a tire cotractor mechaism p. 94 that collapses to approximate circles of two differet radii ad a Watt Cotributed by the Mechaisms ad Robotics Committee of ASME for publicatioithejournal OF MECHANICAL DESIGN. Mauscript received July 21, 2006; fial mauscript received July 13, 2007; published olie February 4, Review coducted by Thomas R. Chase. Paper preseted at the ASME 2006 Desig Egieerig Techical Cofereces ad Computers ad Iformatio i Egieerig Coferece DETC2006, Philadelphia, PA, September 10 13, six-bar air spoiler p. 75 i which just two liks provide a shape chage ad sythesis ivolves solvig two separate motio geeratio problems i sequece. Rigid-body mechaisms offer a umber of advatages for the practical implemetatio of adaptive structures. They provide a higher load-carryig capacity tha compliat mechaisms ad would likely require fewer actuators actig i parallel, such as alog the legth of a airfoil with chagig camber, to resist exteral loads. With rigid liks, sythesis ca be primarily kiematic, so the system ca be modeled without a priori kowledge of exact exteral loads. Also, rigid-body mechaisms ca typically achieve larger displacemets, eablig more dramatic shape chages. Furthermore, actuatio is ot a additioal developmet eed because existig techology rather tha, for example, smart materials techology is typically used to actuate rigid-body mechaisms. The primary disadvatage is that a large umber of rigid bodies is required to approximate a complex shape chage, which ca lead to sigificat frictio accumulated i the correspodigly large umber of joits, desig challeges to avoid mechaism sigularities, ad poor force trasmissio. This paper presets a methodology for the kiematic desig of plaar mechaisms, cosistig of rigid liks joied together by revolute joits, that ca approximate a desired chage betwee a arbitrary umber of shapes defied by curves termed desig profiles. The three curves i Fig. 1 a are example desig profiles. The basic desig strategy is to divide the desig profiles ito segmets such that oe edge of a sigle rigid body ca approximate the shapes of the correspodig segmets from all of the desig profiles. Sectio 3 explais how the segmetatio is accomplished, ad Sec. 2 provides the required mathematical defiitios ad operatios. The rigid bodies correspodig to adjacet segmets are joited together at their ed poits with revolutes to form a chai that ca be maipulated to approximate each desig profile. Figure 1 b shows a chai of four rigid bodies positioed to approximate each of the desig profiles i Fig. 1 a. Each rigid body is just a curve at this stage, which costitutes oe edge of a rigid body i the completed mechaism. Mechaizatio, the, as described i Sec. 4, ivolves defiig the full geometry of these rigid bodies ad addig more liks so that the motio of the coected set of edges ca be cotrolled to Joural of Mechaical Desig Copyright 2008 by ASME MARCH 2008, Vol. 130 /

2 Fig. 1 a Desig profiles that defie a shape chage. b Chai of four rigid segmets joited together show relative to each desig profile. c Solutio sigle-dof mechaism sythesized from the chai. pass through all of the desig profiles. I Fig. 1 b, the three positios of each segmet defie a three-precisio-positio motio geeratio problem that ca be solved with traditioal techiques. I Fig. 1 c, five liks were added betwee the existig chai ad the groud via such techiques to yield a sigle-dof mechaism. This same example is explaied i more detail i Sec. 5, ad Sec. 6 briefly describes a secod example of a mechaism that chages from a shape approximatig the letter U to oe approximatig the letter D. Coclusios are preseted i Sec Rigid Lik Geometry The procedure for geeratig rigid liks that compose a shapechagig likage ivolves covertig the desired curves, deoted as desig profiles, ito target profiles that are readily maipulated ad compared. This sectio presets methods for dealig with a etire desig profile. I practice, desig profiles are divided ito segmets as described i Sec. 3, so the methods preseted here are actually applied to idividual segmets of the desig profiles rather tha the etire profiles. 2.1 Desig Profiles. A set of p desig profiles specifies a shape-chage problem, where a desig profile is a curve defied such that a ordered set of poits o the curve ad the arclegth betwee ay two such poits ca be determied. The piecewise liear curves solid lies i Fig. 2 are simple examples of desig profiles. I practice, desig profiles are likely specified either i parametric form like the composite splies stadard i computatioal geometry 22 or as piecewise liear curves, the stadard i this work. If a desig profile is specified by the lie segmets coectig the ordered set of poits, a i,b i T,,...,m, the legth of the ith segmet of the desig profile is c i = a i+1 b i+1 a i b i = ai+1 a i 2 + b i+1 b i 2 ad the arclegth of the etire desig profile is m 1 C d = c i 1 2 q q+1 c i g 1 c s c i otig the case where q=0 ad the gth poit is o the first liear segmet of the desig profile. The, x g y g = a q b q+1 + g 1 c s c i aq+2 a q+2 b q+2 b q+2 a b q+1 a q+1 b q+1 4 ad all poits o the target profile may be determied. Thus, a target profile is the piecewise liear curve composed of the lie segmets coectig the ordered set of poits z i = x i,y i T, i =1,...,, ad ay desig profile ca be represeted by a target profile of two or more poits. Usig the defiitios of segmet ad curve legths i Eqs. 1 ad 2, the arclegth of the target profile is deoted as C. Sice poits o the target profile are separated by equal arclegths alog the desig profile, they are ot at equidistat itervals alog the target profile, as see i Fig. 2. The target profile arclegth is less Target Profiles. The desig profiles may be defied by ay umber of poits, but are coverted to target profiles that all have the same umber of poits to allow for idetificatio of correspodig poits o each. I Fig. 2, five poits geerate the target profiles, represeted by the dashed lies. The first ad last poits of a target profile ecessarily coicide with the first ad last poits of the desig profile: x 1,y 1 T = a 1,b 1 T ad x,y T = a m,b m T. The poits of the target profile are located at equal arclegths of c s =C d / 1 alog the desig profile. To locate the gth poit of the target profile, determie q such that Fig. 2 Two desig profiles solid lies ad their target profiles dashed lies. The top three-poit desig profile labeled a,b is represeted by a five-poit target profile labeled x,y. The five-poit, ulabeled bottom desig profile has the same arclegth as the top desig profile, but the two five-poit target profiles have differet arclegths / Vol. 130, MARCH 2008 Trasactios of the ASME

3 tha or equal to the correspodig desig profile arclegth, C C d. The most sigificat loss of shape iformatio occurs where the curvature is largest for a cotiuous desig profile or where the agle at a vertex is smallest for a piecewise liear desig profile. Large values of produce smaller variatios betwee the desig ad target profiles ad i the distaces betwee cosecutive poits o the target profile. The heuristic employed i this work is selectig such that the target profile arclegth is greater tha 99% of the desig profile arclegth, C 0.99C d. As a fuctio of, C is ot mootoic. I Fig. 2, the horizotal segmet of the top desig profile is twice the legth of the vertical segmet, so C=C d if is a multiple of 4. The choice of =5, as depicted, results i a target profile shorter tha that for =4. For this example, the at which C 0.99C d, with o icrease i resultig i C 0.99C d,is= Shifted Profiles. From a set of p desig profiles, let the jth target profile be defied by, z ji = x ji y ji T,,...,. A rigidbody trasformatio i the plae, Z ji =Az ji +d, where cos A = si ad d = d 1 si cos d 2 will relocate the profile preservig the respective distaces betwee poits withi it. Ay profile relocated i this fashio is called a shifted profile. Target ad mea profiles described i Sec. 2.4 are both shifted to perform desig operatios without alterig the origial desig problem. The distace betwee target profiles j ad k is defied to be D = x ji x ki 2 + y ji y ki 2 = z ji z ki 2 Viewig the target profile s poits as a sigle poit i 2-dimesioal space, this distace is the square of the Euclidea orm i that space, so D is a appropriately defied metric. Determiig the rigid-body trasformatio that shifts target profile j to the locatio that miimizes D with respect to target profile k is referred to as the image registratio problem. This problem was origially partially solved i three dimesios 23,24 ad for a arbitrary umber of dimesios 25 utilizig sigular value decompositio. These solutios were later show to produce reflectios istead of rotatios for certai data sets, ad a corrective measure was proposed 26. The derivatio that follows restricts the problem to two dimesios, yieldig a closed-form solutio. To determie the rigid-body trasformatio that shifts target profile j to the locatio that miimizes D with respect to target profile k, oe must fid ad d such that D = 0 ad D d = 0 6 where D, that ow measures the distace betwee the shifted j ad the oshifted k, is D = Z ji z ki 2 = z T ji z ji + d T d + z T ki z ki +2d T Az ji 2z T ki Az ji 2d T z ki The result is a pair of simultaeous equatios i ad d: z ki d T si 5 7 cos ji =0 8 cos si z Fig. 3 a Three target profiles. b Two of the target profiles are shifted to miimize D relative to the third. c A mea profile solid lie. d The mea profile shifted to miimize D relative to each of the origial target profiles. Az ji + d z ki = 0 9 Itroducig the defiitio z ji =z jt = x jt,y jt T, Eq. 9 becomes d = 1 z k T Az jt 10 Substitutig Eq. 10 ito Eq. 8 elimiates d ad simplifies to a liear equatio i cos ad si. The solutio for is give by 1 x k T y jt x jt y kt x ki y ji x ji y ki ta = x ji x ki + y ji y ki 1 x j T x kt + y jt y kt 11 The value of is used to costruct the matrix A, ad the Eq. 10 yields d. 2.4 Mea Profiles. A mea profile is a sigle profile that approximates the shapes of all target profiles i a set. A mea profile z mi = x mi y mi T,,...,, is formed by shiftig target profiles 2 through p such that their respective distaces relative to referece target profile 1 are miimized. The, a ew piecewise liear curve defied by poits, each the geometric ceter of the set of p correspodig poits i the shifted target profiles, is geerated. That is, z 1i + p Z ji j=2 z mi = i =1,..., 12 p For example, two target profiles i Fig. 3 a are shifted i Fig. 3 b to their respective distace-miimizig positios relative to the first profile. Figure 3 c shows the mea profile that approxi- Joural of Mechaical Desig MARCH 2008, Vol. 130 /

4 mates the target profiles whe regarded as rigid bodies. I Fig. 3 d, this mea profile is shifted via a rigid-body trasformatio to approximate the shape ad locatio of the target profiles. Note that a ew trasformatio is calculated to shift the mea profile to each of the target profiles i their origial locatios. The described procedure of creatig target profiles, geeratig a mea profile, ad shiftig the mea profile to its D miimizig locatio relative to each of the target profiles potetially coverts a shape-chage problem to a rigid-body guidace problem. If the mea profile acts as a sufficiet approximatio to the desig profiles, as it may i the case of the three locatios of the mea profile i Fig. 3 d, the the problem is coverted to the desig of a mechaism for three fiitely separated positios of a movig lamia. Assumig that the mea profile is isufficiet i this capacity, a process for the segmetatio of the target profiles ito multiple approximatig rigid bodies is itroduced. 3 Segmetatio The procedure for geeratig target profiles from desig profiles is always performed for each desig profile s etire arclegth. The process for geeratig mea profiles, however, ca be accomplished across ay subset of the target profiles. For example, give five target profiles of 100 poits, poits may be used to geerate a mea profile, defiig a piecewise liear curve that approximates poits oly. I fact, the procedure for geeratig a mea profile may be applied to ay segmet of the target profiles. With the target profiles divided ito s segmets, correspodig segmets from all of the target profiles are used to geerate mea profiles that defie the geometry of the rigid liks. The key is to divide the target profiles so as to reduce the error i approximatig the desig profiles, producig the descriptio of a chai of two or more rigid liks coected by revolute joits to better approximate the shape chage. 3.1 Error Metric. The distace D is a poor error metric for segmetatio because it depeds o a segmet s umber of poits. A better metric, the error E, is defied as follows. For mea profile l, the error E lj associated with matchig the correspodig segmet i target profile j is the maximum distace betwee ay two correspodig poits o the two profiles whe the mea profile is shifted to the distace-miimizig locatio relative to the target profile segmet. The error E l associated with this mea profile is the maximum value of E lj for all target profiles j=1,...,p. The overall error E is the maximum value of E l for all mea profiles l=1,...,s. Geerally speakig, E is the distace that quatifies the sigle, worst-case poit-to-poit matchig betwee the mea profiles ad the target profiles. 3.2 Uiform Segmetatio. To geerate a likage composed of s rigid liks, a iitial solutio might divide the target profiles ito s segmets of roughly equal umbers of poits, the last poit of a segmet beig the first poit of the ext segmet. A mea profile is geerated for each set of segmets. For example, give target profiles of =102 poits, if s=4, the segmets are composed of poits 1 26, 26 51, 51 76, ad The first three segmets ad their correspodig mea profiles each have 26 poits, ad the last has 27. Oce geerated, each mea profile ca be shifted idividually to the locatio relative to its correspodig segmet i each target profile that miimizes D. The positios of the s mea profiles relative to each other will differ as they are superimposed o, or shifted to, each target profile. The ed poits of the mea profile segmets i geeral will ot coicide i ay of the positios at this stage. They will later be joied together with revolute joits i the mechaizatio stage. 3.3 Segmetatio to Meet Specified Error. A alterative to uiform segmetatio for iitiatig a desig is to specify a acceptable error E a istead of the umber of segmets. I this case, segmets are grow poit by poit alog the target profiles, startig with segmets of oly two poits. A mea profile is geerated from the set of target profile segmets, the error E l for the mea profile is computed, ad provided that E l is less tha E a, the process is repeated by addig aother poit to the segmets. Ultimately, the poit that causes E l to exceed E a for the set is excised from the segmets. The process the begis agai with a ew segmet formed from the last poit of the just completed segmet ad the excised poit. This geerates a ukow umber of segmets, the last of which geerally has the smallest error. This discussio of segmetatio holds fixed ad, therefore, places a lower boud o E. If o limits are placed o or s, a arbitrarily small error ca be achieved by the segmetatio process. Note that this is true eve i the presece of desig profiles of differet arclegths. At this stage i the desig process, the segmets are separate rigid bodies ad ot yet coected via revolute joits. Oce coected, the error is see to grow. Cosider the logest target profile as havig arclegth C L, ad the shortest C S. Give that the rigid bodies i the chai ca be made arbitrarily short i theory, a chai of arclegth C L +C S /2 may be geerated that exactly matches the target profiles over the portios for which the chai ad profiles alig. Aligig the chai at oe ed of either target profile, ad the aligig the chai itself with the target profile, produces a error at the other ed of C L C S /2. However, the error miimizig locatio of the chai would distribute the error equally at both eds, ot etirely at oe ed. Thus, the theoretical miimum error for the coected chai is observed to be oe-fourth the differece i arclegth betwee the logest ad shortest target profiles. 3.4 Error-Reducig Segmetatio. To reduce E, the segmetatio locatios o the target profiles are moved regardless of how the iitial segmetatio was accomplished. Segmets o the profiles where the shape chage is most dramatic are shorteed to distribute the error more equally across all of the segmets the goal i this work, but ot a requiremet. Startig with segmet 1, the umber of poits i each segmet l, except for the last segmet s, is icreased by 1 if E l Ē ad decreased by 1 if E l Ē, where Ē is the average of all the E l s. The umbers of poits i segmets 1 ad s chage by 1 ad i the other segmets by zero or 2. Although E s does ot explicitly determie whether segmet s icreases or decreases i legth, its effect o Ē does so idirectly. As a example, let four mea profiles be used to approximate a set of target profiles each defied by 102 poits. With uiform segmetatio, the mea segmets approximate poits 1 26, 26 51, 51 76, ad If E 1,E 3 Ē E 2,E 4, the ew segmets cotai poits 1 25, 25 52, 52 75, ad Segmet 2 icreases by two poits, ad segmet 3 retais the same umber of poits, although they are differet poits from the previous iteratio. With the target profile segmets redefied through this method, a ew mea profile is geerated for each set, the error E is recomputed, ad the process is repeated util the value of E ceases to decrease. Because the error may actually icrease i the short term, possibly idicatig oly a local miimum, the process cotiues for several iteratios after E icreases, ad each E is compared to several previous iteratios istead of just the immediate predecessor. The segmetatio that provides the smallest value of Ē is the error-reducig segmetatio, ad the correspodig mea profiles defie the geometry of the rigid liks that compose the likage. Because the target profiles typically cotai hudreds or thousads of poits, alterig segmets by two poits is a modest chage, ad exhaustive approaches that examie sigle-poit alteratios are ulikely to offer sigificat beefit. The procedures preseted i Secs. 2 ad 3 work without regard for the differeces i arclegth i the origial desig profiles. There is o explicit eed for the p desig profiles specifyig a shape-chage problem to have the same arclegth. The error i approximatio is geerally smaller if all p profiles have roughly equal arclegth. From the desiger s stadpoit, the errors itro / Vol. 130, MARCH 2008 Trasactios of the ASME

5 Fig. 4 Portios of two rigid segmets solid light gray ad black lies show at top i their idividual distacemiimizig positios relative to a portio of a target profile dashed medium gray lies ad at bottom assembled together as a chai with a revolute at their ed poits. This is a portio of target profile 1 ad the solutio segmets from the example i Sec. 5 show i a differet orietatio. The error for the two segmets i combiatio icreases slightly after they are assembled, primarily because of the displacemet of the left segmet light gray. duced by these methods, ad certaily durig the mechaizatio process i the ext sectio, may ot yield satisfactory mechaical desigs. Table 1 Rigid segmet ed poits prior to ad followig assembly ito a chai for positio 1 of the example mechaism described i Sec. 5 i Iitial segmet i ed poit Iitial segmet i+1 start poit Fial revolute coectio , , , , , , , , , Mechaizatio Oce a set of rigid-body segmets has bee geerated through the segmetatio process, these segmets are joied together at their ed poits with revolute joits to form a likage. The, liks are added to costrai the likage to have a reduced umber of DOF s. The goal is to achieve a mechaism of a chose umber of DOF s without icreasig the error i the shape-chage approximatio beyod a acceptable value. 4.1 Morphig Chai of Rigid Segmets. Sice the segmeted mea profiles are geerated idividually, their ed poits will geerally ot coicide i their distace-miimizig positios relative to the target profiles, as show i the top portio of Fig. 4 ad the middle colums of Table 1. Coectig the rigid segmets at their ed poits with revolute joits requires movemet away from these positios. Therefore, the error i approximatig the shape chage with the rigid-body segmets icreases due to their beig joied i a chai, as show i the bottom portio of Fig. 4. If the error is excessive, oe optio is to icrease the umber of rigid bodies geerated via the segmetatio process. Typically, the drop i maximum error dimiishes with each additioal segmet, as show for the example i Sec. 5. Other optios iclude weightig the poit-to-poit error metric, weightig the distace betwee mea ad target profile segmets, ad coectig the rigid-body segmets with revolute joits located at poits other tha the ed poits. While umerical optimizatio techiques could be applied, the authors curretly utilize a ad hoc approach to alig the coected rigid-body chai with the target profiles. The rigid segmets are costructed i the sketchig mode of a parametric desig software package, ad geometric costrait programmig GCP 27 techiques are employed. Adjacet rigid segmets are costraied to have coicidet ed poits, which is equivalet to their coectio with revolute joits. The etire chai is maipulated to approximate the desig or target profile so as to visually miimize the error, ad the process is repeated for each profile. The result is a set of p arragemets of the coected rigid-body segmets to which additioal liks of a mechaism ca be added to reduce the umber of DOF s. The coordiates of the revolute coectio poits for positio 1 of the mechaism described i Sec. 5 are give i the last colum of Table Addig Biary Liks. Biary liks may be added betwee the existig chai ad the groud util a sigle-dof mechaism is achieved. Multi-DOF mechaisms may provide a better match to the target profiles, recogizig that reduced actuatio requiremets may come at a cost to accuracy of the shapechage approximatio. To costrai a s-lik ope chai to be a M-DOF mechaism, s+2 M biary liks must be added betwee segmets of the chai ad the groud, per Gruebler s equatio 21. To covert a ope chai ito a 1-DOF mechaism, s+1 such biary liks are required, so at least oe rigid segmet must have two biary liks to groud idetifyig a four-bar sublikage. The other segmets i the chai may have zero except for the ed segmets, oe, or two biary liks to groud. I fact, ay cosecutive i liks of the origial s-lik ope chai may have at most i+1 biary liks to groud. A strategy that has prove effective is to idetify oe segmet for a four-bar sublikage ad add a sigle biary lik to the other segmets, formig a series of coected five-bar sublikages. The selectio of the segmet for the four-bar sublikage is arbitrary; however, experiece shows that selectig a iterior segmet ofte makes sigularity avoidace, as described i Sec. 4.3, easier. 4.3 Locatig Biary Liks. If the umber of target profiles is less tha or equal to 5, it is theoretically possible to add biary liks betwee the existig chai ad the groud without icreasig the error i approximatig the shape chage. The p locatios of each segmet defie a p fiitely separated positio problem. For p 5, p-positio circle ad ceter poits ca be foud for each segmet 21, while for p 6, least-squares approximatios such as those developed by Sarkisya et al. 28 ca be used to locate circle ad ceter poits. Certaily, additioal freedoms exist whe p is small. I the three-desig-profile example i Sec. 5, ay poit i the plae ca be selected as a circle/ceter poit ad the correspodig ceter/circle poit will be uiquely defied. With oly two desig profiles, as i the example i Sec. 6, a ifiity of ceter/circle poits exists for each circle/ceter poit chose i the plae. Regardless of the umber of target profiles, the desiger has the flexibility to choose circle ad ceter poits that do ot represet exact solutios to the p fiitely separated positio problem. I such a case, the error i the shape-chage approximatio icreases due to the additioal costraits of the added liks. A key cosideratio i locatig the additioal biary liks is to avoid sigular cofiguratios betwee the desig positios that would prevet the mechaism from matchig all of the target profiles, preferably with a sigle actuator. Desig for multiple actuators is ot explicitly cosidered here sice it ca be dealt with by applyig the sigle-dof methods ad sice reductio to a sigle DOF is the more difficult problem. This is particularly challegig, potetially prohibitively so, for dramatic shape chages ad those requirig large umbers of liks. Note, however, that a subtle shape chage defied by as may as eight or more very similar desig profiles is much easier to achieve with a sigle-dof mechaism tha is a dramatic shape chage defied by just two very disparate desig profiles. Sigularities are more easily avoided through a small rage of motio. For four or more desig profiles, selectig oexact or o-least-squares solutio circle/ceter-poit pairs may be required to avoid sigularities. Therefore, accurately approximatig dramatic chages betwee may disparate desig profiles would likely be extremely difficult, if ot impossible. A graphical method, based o stadard motio limit aalysis Joural of Mechaical Desig MARCH 2008, Vol. 130 /

6 Fig. 5 a Proximity to sigularity of the four-bar sublikage of the example i Sec. 5. The maximum trasmissio agle is show with solid lies, ad the miimum with dashed. b Sigular cofiguratios betwee desig positios with a cadidate circle/ceter-poit pair for additioal rigid segmet. 21, ca be used to check for the sigularities as each additioal biary lik is added. Begiig with the lik i the ope chai to be coected to groud by the two biary liks the four-bar sublikage, selectio of the first biary lik provides a kow path betwee the desig positios for its circle poit. A locatio is the eeded for a secod circle poit for which o sigular cofiguratio is reached as the kow path is traced. Two vectors are costructed i each of the target positios, oe betwee the existig circle poit ad the potetial ew circle poit ad oe from the potetial ew circle poit to its correspodig ceter poit. The mechaism is i a sigular cofiguratio whe these two vectors are colliear, so a sig chage i the agle betwee the two vectors whe cosiderig all of the target profiles idicates that a sigular cofiguratio occurs betwee them. Thus, o sig chage betwee ay two cofiguratios is a ecessary coditio but is ot sufficiet because two sig chages could occur. A advatage of usig GCP techiques for the mechaizatio is that the mechaism ca be readily maipulated through its full rage of motio after each biary lik is added to verify that the agle does ot exhibit a sig chage betwee ay of the target cofiguratios. A useful heuristic is to costruct two circles cetered at the potetial ew ceter poit. Oe circle has a radius equal to the sum of the distace from the existig circle poit to the ew circle poit ad the distace from the ew circle poit to the ew ceter poit. The other circle has a radius equal to the differece of these two distaces. If the path of the existig circle poit approaches either circle as the mechaism is maipulated, it is approachig a sigularity, so this provides a straightforward graphical check of the proximity to sigularity, as show i Fig. 5 a. With the four-bar sublikage i place, the coupler poit that attaches to the ext lik of the ope chai ow follows a kow path. A locatio is the eeded for the circle poit o this ext lik for which o sigular cofiguratio is reached as the kow path is traced. Two vectors are costructed i each of the target positios, oe betwee the existig coupler coectio poit ad the potetial ew circle poit ad oe from the potetial ew circle poit to its correspodig ceter poit. Agai, o sig chage i the agle betwee the two vectors whe cosiderig all of the target profiles idicates a potetially sigularity-free choice of biary lik, ad maipulatig the mechaism through its rage of motio cofirms the choice. The same circular costructios provide the graphical check of proximity to sigularity, ad i all cases, operatio farther from sigularity is preferred. Figure 5 b shows the sigular cofiguratios associated with a cadidate circle/ceter-poit pair that would prevet the mechaism from movig betwee the desig positios with the iput i the four-bar sublikage. Takig trasmissio agle i its broadest sese to mea the smallest agle betwee ay uactuated lik joited to groud ad the floatig lik to which it is joited, a sigularity occurs i a shape-chagig mechaism whe ay trasmissio agle goes to 0 deg or 180 deg. The procedure detailed above assumes that the iitially selected biary lik of the four-bar sublikage is the iput ad eables sequetial additio of biary liks such that each associated trasmissio agle does ot become 0 deg or 180 deg throughout the motio, otig that the iitially selected biary lik may ot be the best driver of the mechaism upo completio of the desig. The threshold of fidig a mechaism that avoids trasmissio agles of 0 deg ad 180 deg throughout the motio is deemed sufficiet to justify the methodologies preseted i this paper. Typically, performace is better if trasmissio agles are betwee 30 deg ad 150 deg. I the examples i Secs. 5 ad 6, trasmissio agles are well outside of this rage, ad drivability problems would likely result i mechaism prototypes. As a further sythesis cosideratio, because the trasmissio agle varies betwee the kow profiles, ad ot always favorably, selectig biary liks with a stricter guidelie tha deg at the precisio positios icreases the likelihood of locatig a practical solutio. A graphical procedure that could be implemeted to cotrol the trasmissio agle of the four-bar sublikage for sythesis problems ivolvig two ad three desig profiles is give by Chase 29 based o Su ad Waldro s 30 approach for up to four profiles. Note that the iput lik eed ot be part of the four-bar sublikage, but could be ay biary lik joited to groud that moves mootoically betwee all of the desig positios. I the example i Sec. 6, ay oe of five biary liks, oe of which are part of the four-bar sublikage, could be the iput. Ufortuately, the authors are ot aware of ay rigorous techiques for sigularity / Vol. 130, MARCH 2008 Trasactios of the ASME

7 Fig. 6 Sigle-DOF mechaism chagig betwee three desig profiles free sythesis whe the iput is ot withi the four-bar sublikage, so ad hoc methods are employed i such cases. 5 Three Desig Profile Example To demostrate its effectiveess, the desig methodology is applied to a example of a shape chage defied by the three desig profiles show i Fig. 3 a. The poits defiig these targets are listed i Table 2. No uits are listed because ay uit of legth would be appropriate. Profiles 2 ad 3 each cosist of eight liear segmets, while profile 1 cosists of six liear segmets, so it is clear that o rigid body of fiite legth could exactly match all three profiles. The arclegths differ by less tha 1%. Target profiles of 1800 poits are geerated from these three desig profiles to satisfy the 99% arclegth criterio i Sec Usig the segmetatio process of Secs. 3.3 ad 3.4, four segmets resulted i a acceptably small error E of 0.047, which is less tha 0.7% of the arclegth of the shortest desig profile. With five segmets, E=0.043, so the small error reductio does ot warrat the additioal complexity of havig the extra segmet. Employig oly three segmets, however, resulted i a sigificat Table 2 6 Defiig poits of the desig profiles i Figs. 3 a ad Profile 1 Profile 2 Profile 3 2.3, , , , , , , , , , , , , , , , , , , , , , , , ,2.4 Joural of Mechaical Desig MARCH 2008, Vol. 130 /

8 Fig. 7 Sigle-DOF mechaism chagig from U to D icrease i error to These errors oly apply to the segmetatio process, so the achievable error followig mechaizatio is larger. To achieve a sigle-dof mechaism, the methods of Sec. 4.1 were used to assemble the four segmets ito a chai with revolute joits at their ed poits, ad the methods of Secs. 4.2 ad / Vol. 130, MARCH 2008 Trasactios of the ASME

9 were used to add five biary liks betwee the chai ad the groud, as show i Fig. 6. Care was take to locate all of the ceter poits withi the regio roughly bouded by the desig profiles to avoid havig liks of extreme legth. Two biary liks were added to oe of the iterior shape-chage liks to establish a four-bar sublikage for actuatig the mechaism. As idicated i Fig. 6, this four-bar is a crak rocker, so it offers actuatio betwee the three desig profiles with a cotiuously rotatig iput. The coordiates of the revolute joits of this mechaism whe it is i positio 1 are give i Table 3. The mechaism is show i the desig positios i Figs. 6 a, 6 d, ad 6 g. Itermediate positios are show betwee each of the desig positios. As show most clearly i Fig. 6 f, the liks of the mechaism do overlap betwee the secod ad the third desig positio such that several of the liks would eed to be offset i parallel plaes i a prototype of this mechaism. Icreasig the allowable desig space for the ceter poits might allow the desiger to avoid this circumstace. Followig mechaizatio, the value of E for the mechaism was As aticipated, this value was larger tha that followig just the segmetatio stage, but it is still small less tha 0.9% of the arclegth of the shortest desig profile. 6 Two Desig Profile Example Desig profiles represetig the letters U ad D would seem to require a more dramatic shape chage. Figure 7 shows a sigle- DOF solutio mechaism for this problem defied by the poits listed i Table 4 agai without uits. Note that the U is taller tha the D because the two have the same arclegth. For each desig profile, 2600 poits were used to geerate the target profile, agai to satisfy the 99% arclegth criterio described i Sec Although there are oly two desig profiles, eight segmets were required to accomplish the shape chage with a error E of about 0.15% of the total arclegth usig the segmetatio process i Secs. 3.3 ad 3.4. As such, ie additioal biary liks were added to achieve a sigle-dof mechaism. I this case, care was take to locate all of the ceter poits withi the D profile. The coordiates of the revolute joits of this mechaism whe it is i positio 1 are give i Table 5. Table 3 Coordiates of the revolute joits of the mechaism show i Fig. 6 a Ceter poits Circle poits Morphig chai revolutes 3.132, , , , , , , , , , , , ,1.874 Table 4 Defiig poits of the desig profiles i Fig. 7 U desig profile 1.000, , , , , , , , , , ,7.500 D desig profile 1.500, , , , , , , , , , , , ,7.000 Table 5 Coordiates of the revolute joits of the mechaism show i Fig. 7 a Ceter poits A sigle four-bar sublikage was costructed with the segmet that forms the upper left portio of each letter, but this is ot where the mechaism is actuated because the shorter crak of the four-bar is ear a sigularity i the D cofiguratio. Ay of the biary liks attached to the segmets that form the right side of the U could serve as the iput sice all of them rotate mootoically betwee the desig cofiguratios. The mechaism does ot, however, have a crak iput that ca make a full rotatio, so the shape chage caot be executed with a cotiuously rotatig actuator uless a additioal likage is added. Followig mechaizatio, the error E grows to The fivefold icrease from the segmetatio error is ot surprisig give the larger umber of liks to be joied together i this example compared to the previous example. The error is still small eough that the two letters are clearly deoted with the mechaism, which is the metric for this example. Acceptable errors i other mechaisms will be applicatio depedet. 7 Coclusios This work itroduces a systematic procedure to sythesize mechaisms composed of rigid liks joied together with revolute joits to approximate a desired shape chage defied by a arbitrary umber of morphig curves. The procedure ivolves comparig piecewise liear curves to defie the geometry of the rigid liks that approximate the shapes with a miimum amout of error. Additioal biary liks ca be added to the chai of shapechage liks to reduce the umber of degrees of freedom of the mechaism. The procedure is applied to two examples of sigle- DOF mechaisms desiged for shape chages defied by ope curves. It is equally applicable to multi-dof mechaisms. The authors believe that the procedure will eable desigers to leverage the advatages rigid-body mechaisms offer i developig ad implemetig morphig structures. Ackowledgmet This material is based o the work supported i part by the Natioal Sciece Foudatio uder Grat No to A. Murray. Refereces Circle poits Morphig chai revolutes 1.827, , , , , , , , , , , , , , , , , , Moer, H. P., 2001, Realizatio of a Optimized Wig Camber by Usig Formvariable Flap Structures, Aerosp. Sci. Techol., 5, pp Washigto, G. N., 1996, Smart Aperture Ateas, Smart Mater. Struct., 5 6, pp Marti, J. W., Mai, J. A., ad Nelso, G. C., 1998, Shape Cotrol of Deployable Membrae Mirrors, ASME Adaptive Structures ad Materials Systems Coferece, Aaheim, CA, pp Austi, F., Siclari, M. J., Va Nostrad, W., Weisesel, G. N., Kottamasu, V., ad Volpe, G., 1997, Compariso of Smart Wig Cocepts for Trasoic Cruise Drag Reductio, Proc. SPIE, 3044, pp Austi, F., ad Va Nostrad, W., 1995, Shape Cotrol of a Adaptive Wig for Trasoic Drag Reductio, Proc. SPIE, 2447, pp Ameduri, S., Esposito, C., ad Cocilio, A., 2001, Active Shape Airfoil Cotrol Through Composite Piezoceramic Actuators, Proc. SPIE, 4327, pp Joural of Mechaical Desig MARCH 2008, Vol. 130 /

10 7 Bart-Smith, H., ad Risseeuw, P. E., 2003, High Authority Morphig Structures, Proceedigs of the ASME Iteratioal Mechaical Egieerig Cogress, Washigto, DC. 8 Jardie, P., Flaaga, J., Marti, C., ad Carpeter, B., 1997, Smart Wig Shape Memory Alloy Actuator Desig ad Performace, Proc. SPIE, 3044, pp Marti, C. A., Jasmi, L., Flaaga, J., Appa, K., ad Kudva, J. N., 1997, Smart Wig Wid Tuel Model Desig, Proc. SPIE, 3044, pp Quackebush, A., Bilai, A., Batcho, P., Mckillip, R., ad Carpeter, B., 1997, Implemetatio of Vortex Wake Cotrol Usig SMA-Actuated Devices, Proc. SPIE, 3044, pp Webb, G. V., Lagoudas, D. C., ad Kulkarii, M., 1999, Adaptive Shape Cotrol for a SMA-Actuated Aerofoil Rib Structure, Proceedigs of the ASME Iteratioal Mechaical Egieerig Cogress, Nashville, TN, pp Agelio, M., ad Washigto, G., 2001, Poit Actuated Aperture Atea Developmet, Proc. SPIE, 4334, pp Yoo, H. S., ad Washigto, G., 1998, Piezoceramic Actuated Aperture Ateae, Smart Mater. Struct., 7 4, pp Yoo, H. S., Washigto, G., ad Theuisse, W. H., 2000, Aalysis ad Desig of Doubly Curved Piezoelectric Strip-Actuated Aperture Ateas, IEEE Tras. Ateas Propag., 48 5, pp Marti, J. W., Redmod, J. M., Barey, P. S., Heso, T. D., Wehlburg, J. C., ad Mai, J. A., 2000, Distributed Sesig ad Shape Cotrol of Piezoelectric Bimorph Mirrors, J. Itell. Mater. Syst. Struct., 11, pp Saggere, L., ad Kota, S., 1999, Static Shape Cotrol of Smart Structures Usig Compliat Mechaisms, AIAA J., 37, pp Saggere, L., ad Kota, S., 2001, Sythesis of Plaar, Compliat Four-Bar Mechaisms for Compliat-Segmet Motio Geeratio, ASME J. Mech. Des., 123 4, pp Lu, K. J., ad Kota, S., 2003, Desig of Compliat Mechaisms for Morphig Structural Shapes, J. Itell. Mater. Syst. Struct., 14, pp Lu, K. J., ad Kota, S., 2005, A Effective Method of Sythesizig Compliat Adaptive Structures Usig Load Path Represetatio, J. Itell. Mater. Syst. Struct., 16 4, pp Stubbs, M. D., Whittier, W. B., ad Reiholtz, C. F., 2004, Sigle Degreeof-Freedom Morphig Wig Desig ad Sythesis, Proceedigs of the ASME 2004 Desig Egieerig Techical Cofereces, Salt Lake City, UT. 21 Erdma, A., Sador, G., ad Kota, S., 2001, Mechaism Desig: Aalysis ad Sythesis, 4th ed., Pretice-Hall, New York. 22 Faux, I. D., ad Pratt, M. J., 1985, Computatioal Geometry for Desig ad Maufacture, Wiley, New York. 23 Hor, B. K. P., 1987, Closed-Form Solutio of Absolute Orietatio Usig Orthoormal Matrices, J. Opt. Soc. Am. A, 5 7, pp Hor, B. K. P., 1987, Closed-Form Solutio of Absolute Orietatio Usig Uit Quaterios, J. Opt. Soc. Am. A, 4 4, pp Aru, K. S., Huag, T. S., ad Blostei, S. D., 1987, Least-Squares Fittig of Two 3-D Poit Sets, IEEE Tras. Patter Aal. Mach. Itell., PAMI-9 5, pp Umeyama, S., 1991, Least-Squares Estimatio of Trasformatio Parameters Betwee Two Poit Patters, IEEE Tras. Patter Aal. Mach. Itell., 13 4, pp Kizel, E. C., Schmiedeler, J. P., ad Peock, G. R., 2006, Kiematic Sythesis for Fiitely Separated Positios Usig Geometric Costrait Programmig, ASME J. Mech. Des., 128 5, pp Sarkisya, Y. L., Gupta, K. C., ad Roth, B., 1973, Kiematic Geometry Associated with the Least-Square Approximatio of a Give Motio, ASME J. Eg. Id., 95 2, pp Chase, T. R., 2006, A Note o the Waldro Costructio for Trasmissio Agle Rectificatio, ASME J. Mech. Des., 128 3, pp Su, J. W. H., ad Waldro, K. J., 1981, Graphical Trasmissio Agle Cotrol i Plaar Likage Sythesis, Mech. Mach. Theory, 37 4, pp / Vol. 130, MARCH 2008 Trasactios of the ASME

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

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

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

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

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

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More 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

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More 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

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More 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

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

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

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

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

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

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

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

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

Research Article Kinematics Analysis and Modeling of 6 Degree of Freedom Robotic Arm from DFROBOT on Labview

Research Article Kinematics Analysis and Modeling of 6 Degree of Freedom Robotic Arm from DFROBOT on Labview Research Joural of Applied Scieces, Egieerig ad Techology 13(7): 569-575, 2016 DOI:10.19026/rjaset.13.3016 ISSN: 2040-7459; e-issn: 2040-7467 2016 Maxwell Scietific Publicatio Corp. Submitted: May 5, 2016

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

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

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

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

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

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

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More 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

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

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More 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

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

. 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

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More 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

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

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

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

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More 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

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Freeform Optimization: A New Capability to Perform Grid by Grid Shape Optimization of Structures

Freeform Optimization: A New Capability to Perform Grid by Grid Shape Optimization of Structures 6 th Chia-Japa-Korea Joit Symposium o Optimizatio of Structural ad Mechaical Systems Jue 22-25, 200, Kyoto, Japa Freeform Optimizatio: A New Capability to Perform Grid by Grid Shape Optimizatio of Structures

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

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

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

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

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More 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

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

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

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More 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

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour

Diego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio

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

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More 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

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

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Appendix A. Use of Operators in ARPS

Appendix A. Use of Operators in ARPS A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

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

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

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

Optimized Aperiodic Concentric Ring Arrays

Optimized Aperiodic Concentric Ring Arrays 24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity

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

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More 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

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

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More 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

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

It just came to me that I 8.2 GRAPHS AND CONVERGENCE

It just came to me that I 8.2 GRAPHS AND CONVERGENCE 44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot

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

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

are two specific neighboring points, F( x, y)

are two specific neighboring points, F( x, y) $33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'

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

Handwriting Stroke Extraction Using a New XYTC Transform

Handwriting Stroke Extraction Using a New XYTC Transform Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig

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

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

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

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets

More 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

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

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

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

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

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

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design

COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad

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

Fire Recognition in Video. Walter Phillips III Mubarak Shah Niels da Vitoria Lobo.

Fire Recognition in Video. Walter Phillips III Mubarak Shah Niels da Vitoria Lobo. Fire Recogitio i Video Walter Phillips III Mubarak Shah Niels da Vitoria Lobo {wrp65547,shah,iels}@cs.ucf.edu Computer Visio Laboratory Departmet of Computer Sciece Uiversity of Cetral Florida Orlado,

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