An Architecture for Making Judgments Using Computing with Words 1
|
|
- Alexina Cox
- 5 years ago
- Views:
Transcription
1 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , An Archtecture fr Makng Judgments Usng Cmputng wth Wrds 1 Jerry M. Mendel Integrated Meda Systems Center Unversty f Suthern Calfrna Ls Angeles, CA mendel@sp.usc.edu Telephne: (213) Fax: (213) Abstract Our thess s that cmputng wth wrds needs t accunt fr the uncertantes asscated wth the meanngs f wrds, and that these uncertantes requre usng type-2 fuzzy sets. Dng ths leads t a prpsed archtecture fr makng judgments by means f cmputng wth wrds a perceptual cmputer the Per-C. The Per-C ncludes an encder, a type-2 rule-based fuzzy lgc system, and a decder. It lets all human-cmputer nteractns be perfrmed usng wrds. In ths paper, a quanttatve language s establshed fr the Per-C, and many pen ssues abut the perceptual cmputer are descrbed. 1 Ths paper s an expanded versn f Mendel (2001b). 1
2 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , INTRODUCTION Zadeh (1996, 1999) cned the phrase cmputng wth wrds [see, als, Wang (2001)]; but ur thess s that wrds mean dfferent thngs t dfferent peple and s there s uncertanty asscated wth wrds, whch means that fuzzy lgc (FL) must smehw use ths uncertanty when t cmputes wth wrds [Mendel (1999, 2001a)]. Type-1 FL handles uncertantes abut the meanngs f wrds by usng precse membershp functns (MFs) that the user beleves captures the uncertanty f the wrds. Once the type-1 MFs have been chsen, all uncertanty abut the wrds dsappears, because a type-1 MF s ttally precse. Because f that, type-1 MFs cannt handle the uncertantes abut wrds. We mantan that cmputng wth wrds requres usng type-2 fuzzy sets 2. Tday, cmputng wth wrds must stll be dne usng numbers, and, therefre, numerc ntervals must be asscated wth wrds. An earler paper [Mendel (1999)] reprted n an emprcal study that was perfrmed t determne hw the scale 0 10 can be cvered wth wrds (r phrases). In typcal engneerng applcatns f FL, we dn t wrry abut ths, because we chse the number f fuzzy sets that wll cver an nterval arbtrarly, and then chse the names fr these sets just as arbtrarly (e.g., zer, small pstve, medum pstve, and large pstve). Ths wrks fne fr many engneerng applcatns, when rules are extracted frm data. Hwever, t s questnable practce when rules are extracted frm peple. Put anther way, machnes dn t care abut wrds, but peple d. In Mendel (1999), we frst establshed a vcabulary f 16 canddate wrds r phrases terms that we thught wuld let us cver ths nterval. Thse terms are: nne, very lttle, a small amunt, a lttle bt, a bt, sme, a mderate amunt, a far amunt, a gd amunt, a cnsderable amunt, a szeable amunt, a large amunt, a substantal amunt, a lt, an extreme amunt, and a maxmum amunt. We then surveyed students and asked them t prvde the end-pnts fr ntervals n the scale f 0 10 that they asscated wth each term. The 16 terms were randmzed n the survey and we cllected 70 useable surveys. We then cmputed mean and standard devatn values fr the tw end-pnts f each f the 16 term s nterval, and pltted the nterval fr each term. These results are depcted n Fgure 1. 2 A bref ntrductn t type-2 fuzzy sets s prvded n Appendx A. 2
3 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , nne a lttle bt a small amunt very lttle sme a bt a cnsderable amunt a far amunt a gd amunt a mderate amunt a substantal amunt a large amunt a szeable amunt a maxmum amunt an extreme amunt a lt Fgure 1: All 16 labels and ther ntervals and uncertanty bands. Sld lnes are drawn between the sample means fr the nterval end-pnts and dashed lnes are fr ±1 standard devatn abut each mean end-pnt. One f the mst strkng cnclusns drawn frm ths prcessed data s: lngustc uncertanty appears t be useful n that t lets us cver the 0 10 range wth a much smaller number f terms than wthut t. Fgure 2 depcts ths fr fve terms [Fgure 2-3 n Mendel (2001a) demnstrates cverage f the 0 10 range fr three terms]. Put n the cntext f frng rules, n a rule-based fuzzy lgc system 3 (FLS), uncertanty can fre rules. Ths cannt ccur n the framewrk f a type-1 FLS; but t can ccur n the framewrk f a type-2 FLS. Uncertanty can therefre be used t cntrl the rule explsn that s s cmmn n a FLS. If, fr example, we gnred uncertanty, and had rules wth three antecedents, each f whch s descrbed by sx terms, t culd take 216 rules t cmpletely 3
4 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , descrbe the fuzzy rule base. On the ther hand, usng three terms fr each antecedent requres a rule base wth nly 27 rules. Ths s an 87.5% reductn n the sze f the rule base. nne t very lttle sme a mderate amunt a maxmum amunt a large amunt Fgure 2: Althugh fve labels cver 0 10, there s nt much verlap between sme f them. It s when the standard devatn nfrmatn s used that suffcent verlap s acheved. Fnally, as cnjectured n Mendel (2001a) uncertanty s gd n that t lets peple make decsns (albet cnservatve nes) rapdly. Perhaps ths s why sme peple can make decsns very quckly and thers cannt. The latter may have parttned ther varables nt s many fne sets that they get hung up amng the resultng enrmus number f pssbltes. They are the eternal prcrastnatrs. Ths cnjecture s supprted by Klr and Werman (1998) wh state: Uncertanty has a pvtal rle n any effrts t maxmze the usefulness f systems mdels. Based n these prelmnary deas, n the rest f ths paper a specfc archtecture s prpsed fr makng judgments by cmputng wth wrds (by judgment we mean an assessment f the level f a varable f nterest). Such a cmputer wll be called a Perceptual Cmputer Per-C fr shrt. We beleve that a generc all-purpse methdlgy can be fund fr makng judgments by cmputng wth wrds, but that the specfc detals wll be cntext dependent. S, fr example, makng judgments by cmputng wth wrds fr dagnstc medcne wll have detals that are dfferent frm thse fr makng judgments by cmputng wth wrds fr accuntng. There are many nterestng and pen ssues asscated wth cmputng wth wrds, sme f whch are psed belw. 3 See Appendx B fr a hgh-level descrptn f a FLS. 4
5 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , FRAMEWORK FOR A PERCEPTUAL COMPUTER The archtecture fr a perceptual cmputer s depcted n Fgure 3. Perceptns (.e., granulated terms, wrds) actvate the Per-C and are als utput by the Per-C; s, t s pssble fr a human t nteract wth the Per-C just usng a vcabulary wrds. The mappng f wrds nt wrds ccurs wthn the Per-C and s accmplshed usng the mathematcs f type-2 rule-based FLSs. The humans that nteract wth the Per-C d nt have t be cncerned wth the mathematcal detals, althugh the desgner f the Per-C must be. Perceptual Cmputer (Per-C) Perceptns (wrds) W Perceptns (wrds) W d Encder E D Decder Type-2 Fuzzy set W R Numbers Type-2 Fuzzy Lgc System O Fgure 3: Archtecture f a Perceptual Cmputer (Per-C). We let W dente the th wrd frm a vcabulary, V, f N V wrds (terms),.e., N V = { W } V =1 (1) Ths vcabulary s cntext-dependent, and may cntan sme terms that are cmmn acrss cntexts r that are used as adjectves (e.g. sme, a lt f, a maxmum amunt f). V s the vcabulary that a human uses t nterface wth the Per-C and whch the Per-C uses t cmmuncate ts fndngs back t a human (e.g., the 16 terms n Fgure 1). Each wrd n V must have a type-2 MF asscated wth t, whch suggests that nterval survey nfrmatn must be btaned fr t. New wrds can be added t V, just as a chld cntnues t add wrds t hs r her vcabulary, and nterval nfrmatn abut each wrd n V may als change ver tme. 5
6 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , The encder transfrms lngustc perceptns nt type-2 fuzzy sets that actvate a rule-based type-2 FLS, dented R. We dente the type-2 fuzzy set utput f the encder as W. Nte that the encder s the same as a fuzzfer; hwever, t always utputs a type-2 fuzzy set, whereas a general-purpse fuzzfer culd utput sngletn, type-1 r type-2 fuzzy sets [e.g., Mendel (2001a)]. Ths s why we dstngush between an encder and a fuzzfer. A type-2 FLS s rule-based, and ts rules are cntext dependent. The rules are IF-THEN rules (whch can nclude a rch varety f rules, e.g., ncmplete IF rules, mxed rules, fuzzy statement rules, cmparatve rules, unless rules, and quantfer rules [Wang (1997)]) whse antecedents and cnsequent are wrds that are frm antecedent and cnsequent vcabulares, V A and V C, where V A = { W } A =1 N A! V (2) and V C = { W C } = 1 N C! V (3) In ths paper, we assume that the wrds used n V A and V C are subsets f the wrds n V, and, that N A << N V and N C << N V (e.g., V mght be the 16 terms n Fgure 1, whereas V A and V C mght be the fve terms n Fgure 2). The latter assumptns mean that there s a carser granulatn asscated wth the antecedents and cnsequent than n the verall vcabulary. Ths s ne way t cntrl rule explsn. It s mprtant, hwever, t allw the human t nteract wth the Per-C usng the larger vcabulary s that ths nteractn s as natural as pssble. Because the wrds n V A and V C are subsets f the wrds n V, they wll each have a type-2 MF asscated wth them. We dente the ttalty f antecedent wrd type-2 MFs as V A, and the ttalty f cnsequent wrd type-2 MFs as V C. The utput f the type-2 FLS s a number, O, whch s a result f a sequence f nternal peratns nference, type-reductn, and defuzzfcatn whch we shall descrbe n Sectn 3. At a very hgh 6
7 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , level, we can descrbe ths utput as O = f [ W, V A, V C ], where the exact nature f the nn-lnear functn f [!] depends n many specfc chces that have t be made wthn the type-2 FLS (e.g., knd f nference, type-reductn, and defuzzfcatn). The decder, D, maps O = f [ W, V A, V C ] nt a wrd W d,.e., W d = D(O)! V (4) Hw t actually d ths s als brefly dscussed n Sectn SOME DETAILS OF THE PERCEPTUAL COMPUTER The man gal f ths sectn s t arrve at an nput-utput frmula fr the Fgure 3 Per-C. T d ths we must prvde sme detals fr the elements f the Per-C. A. Vcabulary Cntent experts need t be part f the prcess f establshng a meanngful vcabulary fr specfc judgments. Ths vcabulary shuld be as large as pssble n rder t prvde a human wth as much flexblty as pssble. After a behavr f nterest s dentfed fr whch judgments wll be made (e.g., flrtatn), the ndcatrs f that behavr must be establshed (e.g., eye cntact, tuchng, actng wtty, smlng, cmplementng, prmpng). A small subset f the ndcatrs needs t be establshed, because rules wll be establshed fr that small subset. Ths can be dne by means f an asscated survey n whch ndcatrs are rank-rdered. Scales then need t be establshed fr each ndcatr and the behavr f nterest 4. Names and nterval nfrmatn need t be establshed fr each f the ndcatr s fuzzy sets and behavr f nterest s fuzzy sets. Dng ths leads t the vcabulary V, and the antecedent and cnsequent vcabulares V A and V C. It als leads t the type-2 MFs that are used fr the wrds n all vcabulares. Althugh the nterval surveys descrbed n Sectn 1 cntan uncertanty nfrmatn abut each term, hw t use that nfrmatn t derve an 7
8 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , asscated type-2 MF s an pen ssue. Mendel (2001a) advcates transfrmng the nterval uncertantes nt a ftprnt f uncertanty (FOU) fr each term, but ths requres makng an a prr chce fr the shape f the prmary MF (e.g., a Gaussan prmary MF whse mean and/r standard devatn are uncertan). Chsng a FOU t mdel lngustc uncertanty s analgus t chsng a prbablty densty functn t mdel randm uncertanty. There s n unque chce fr a FOU, just as there s n unque chce fr a type-1 MF. Hpefully a Per-C wll be rbust t the chce f MF shapes, just as, e.g., a type-1 fuzzy lgc cntrller s. Recent results (Mendel, 2001d) abut FOUs have demnstrated that a smlar lkng FOU can be btaned fr a trangular prmary MF (where there can be uncertantes abut all three vertces), a trapezdal prmary MF (where there can be uncertantes abut all fur vertces), and a Gaussan prmary MF (where bth the mean and standard devatn are uncertan). It appears, therefre, that granulatn f a type-1 fuzzy set t a type-2 fuzzy set reduces the prblem f determnng the type-1 MFs. Because the type-2 FLS perates n numbers, scales must be establshed fr each ndcatr and the behavr f nterest 5. Cmmnly used scales are 1 thrugh 5, 0 thrugh 5, 0 thrugh 10, etc. The survey descrbed n Sectn 1 fr the 16 terms was perfrmed n a cntext-free stuatn. An pen ssue s whether r nt such cntext-ndependent results can be appled when the terms are used wthn a specfc cntext, e.g. f sme, n a cntext-ndependent stuatn, s lcated (n a scale 0 10) n the nterval [0.5, 6], then are sme tuchng and sme prmpng lcated ver that same nterval? There may als be stuatns where a natural scale already exsts fr an ndcatr (e.g., pressure, temperature). Is the nterval asscated wth, e.g. lw pressure prprtnately the same as the nterval asscated wth lw temperature? If nt, then s there a way t acheve a scale-nvarance fr wrds s that cntext-ndependent-ntervals can be used n cntext-dependent stuatns? Humans seem t understand certan terms n a cntext-free stuatn, and are able t apply them n cntextdependent nes, and als understand terms n a cntext and are able t adapt them t ther cntexts; s, we cnjecture that t ught t be pssble fr cmputers t d lkewse. The FOUs fr the wrds n V are pre-cmputed usng the wrd surveys descrbed abve. Anther pen ssue s hw much uncertanty ne shuld asscate wth the nterval end-pnts. Let! L and 4 Fr sme judgments (e.g., wealth), the ndcatrs and judgments wll have natural scales, whereas fr thers (e.g., flrtatn) n natural scales exst. Instead f usng scales, t may be pssble t use a lne f arbtrary length and percentages that are asscated wth that length. 5 See ftnte 4 fr an alternatve apprach. 8
9 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , 2002.! R dente the standard devatn fr the left and rght end-pnts f a wrd s nterval, respectvely, and! dente a fractn f uncertanty,.e. 0! "!1; then, when we use!" L r!" R fr nterval end-pnt uncertantes, what s!? If! s chsen t large then all MFs wll verlap t much. A thery s needed t gude us n hw much uncertanty shuld be used t characterze the uncertanty f wrds. B. Encder The encder transfrms a wrd nt a type-2 MF µ W. A type-2 MF s three-dmensnal. Each element f a FOU has a pssblty value a secndary MF assgned t t. The unn f all pssblty values defned ver the FOU cnsttutes the type-2 MF. The FOU fr each f the wrds n V s pre-cmputed, as descrbed n Sectn 3.A. The remanng ssue s what t chse fr the secndary MFs. Mendel (2001a, 2001b) advcates usng nterval sets because then all remanng peratns wthn the type-2 FLS are manageable. Addtnally, even fr a type-1 FLS there s n ne best chce fr the shape fr a MF, s why shuld we cmpund ths by tryng t chse secndary MFs as arbtrary shapes? Anther very mprtant reasn fr usng nterval type-2 fuzzy sets s that all set-theretc laws (e.g., DeMrgan s, dstrbutve, asscatve, etc.) are satsfed regardless f whch t-nrm r t-cnrm are used. Ths s nt the case when arbtrary type-2 fuzzy sets are used [see Appendx B n Mendel (2001a)], whch culd cause serus prblems n a rule-based system. C. Type-2 FLS As descrbed n Appendx B, a type-2 FLS cnssts f a fuzzfer and an nference engne fllwed by type-reductn and defuzzfcatn. The fact that all wrds are encded usng type-2 fuzzy sets means that the encder already accmplshes fuzzfcatn. Rules, whch establsh the detaled archtecture f the FLS, are the heart f any FLS. They reman the same regardless f whether we use type-2 r type-1 fuzzy sets n the nference engne. What changes s the way n whch we mdel the antecedent and cnsequent fuzzy sets. T begn, a specfc archtecture must be chsen fr the FLS. Ths wll depend n part n hw many ndcatrs f a judgment are cnsdered t be sgnfcant. Mre than tw ndcatrs cause a prblem, because 9
10 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , peple d nt lke t answer many questns and have great dffculty n crrelatng mre than tw thngs at a tme (e.g., a tw-antecedent rule can be nterpreted as prvdng the crrelatn between the tw antecedents). S, f mre than tw ndcatrs are requred, then sme new archtecture(s) wll be needed fr the type-2 FLS, e.g. a parallel ntercnnectn f sub-advsrs, r a herarchcal archtecture. T-date, n such archtectures have been publshed fr type-2 FLSs, s ths s anther pen ssue. Chces must be made t mplement the (cmpstnal) nference engne, namely the mplcatn (!) and t-nrm (!) t be used. Althugh Mamdan mplcatns and prduct r mnmum t-nrms are wdely used n many engneerng applcatns f a FLS, fr the Per-C the knd f mplcatn and t-nrm t use are pen ssues. In fact, any chces fr mplcatn r t-nrm dfferent frm thse just mentned wll requre new results be develped fr the extended sup-star cmpstn f a type-2 FLS, whch s yet anther pen ssue. Yager and Flev (1994), fr example, prpse that Mamdan mplcatn and lgc mplcatn ( ~ p! q ) are the lwer and upper bund fr the nference engne, and establsh a prcedure cmprmse fuzzy reasnng n whch a lnear cmbnatn (.e., a parametrc mdel) f these tw extremes s used. Further dscussns abut the many chces that have t be made fr the nference engne as cmpared t rule-related uncertantes are gven n Mendel and Wu (2002). Rules are type-2 cmpstns, and n Fgure 3 are dented as R,.e. R = R ( V A, V C ) = R ( V A, V C!) (5) Inferencng n a type-2 FLS s dne usng the extended sup-star cmpstn [Mendel (2001a)] whch transfrms W and R nt anther type-2 fuzzy set, I, and nvlves a t-nrm peratn,.e., I = I ( W, R ) = I ( W, V A, V C ) = I ( W, V A, V C!,!) (6) 10
11 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , Inferencng s very straghtfrward fr an nterval type-2 FLS 6. Fllwng the nference engne s type-reductn (TR) 7. TR maps a type-2 fuzzy set nt a type-1 fuzzy set. Just as there are many defuzzfcatn methds fr a type-1 FLS, there are many TR methds fr a type-2 FLS. Whether r nt ne TR methd s best fr a Per-C s yet anther pen ssue. Whether fred utput sets shuld be cmbned prr t r as part f TR s yet anther pen ssue (as t s fr defuzzfcatn). Wthut gng nt the detals f hw t perfrm TR, we can smply vew t as a nn-lnear peratr n I,.e., fr an nterval type-2 FLS, TR = f TR [ I ( W, V, V A C!,!)] = [y l, y r ] (7) where [y l, y r ] s an nterval type-1 fuzzy set, and y l = y l [ I ( W, V, V A C!,!, f TR )] (8) and [ ] (9) y r = y r I ( W, V, V A C!,!, f TR ) The fnal peratn wthn the type-2 FLS s defuzzfcatn, whch s the mappng f the type-1 fuzzy set TR nt a number, O, a type-0 fuzzy set. The bvus chce fr defuzzfcatn s the center f gravty (COG) f type-1 set TR,.e. { } [ I ( W, V, V A C!,!, f TR )] y r [ I ( W, V, V A C!,!, f TR )] O = COG(TR) = COG f TR I [ ( W, V, V!,!) ] A C = 1 2 y l (10) 6 See Appendx D fr nferencng results fr sngletn nterval type-2 FLSs. Mre general results fr nn-sngletn nterval type-2 FLSs (n whch measurements that actvate the FLS are mdeled ether as type-1 r type-2 fuzzy sets) can be fund n Mendel (2001a, Chapters 11 and 12). 7 See Appendx C fr a bref dscussn abut type-reductn methds. 11
12 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , Equatn (10) s the nput-utput frmula fr the type-2 FLS wthn the Per-C. D. Decder The decder, D, perates n O t prvde a wrd W d as n (4),.e., W d = D(O) = D[ COG(TR) ] { [ ]} = D" COG f TR I ( W, # $ V, V!,!) A C % &' ( V (11) Observe that the utput f the decder s a wrd frm the vcabulary V. Hw t g frm MF numercal values fr a varable t a lngustc descrptn f that varable fr type-1 fuzzy sets s well knwn; hwever, hw t d ths fr type-2 fuzzy sets s nt s well knwn. Cnsder, fr example, the type-1 stuatn depcted n Fgure 4 at x = x!. Ths value f x nly generates a nn-zer membershp value n the fuzzy set F 4 = Medum Pstve; hence, x = x! can be descrbed lngustcally, wthut any ambguty, as Medum Pstve. The stuatn at x = x! dfferent, because ths value f x generates a nn-zer membershp value n tw fuzzy sets F 4 = Medum Pstve and F 5 = Very Pstve. It wuld be very awkward t speak f x! s as beng Medum Pstve t degree µ F4 ( x!!) and Very Pstve t degree µ F5 ( x!!). Peple just dn t cmmuncate ths way. Instead, we usually cmpare µ F4 ( x!!) and µ F5 ( x!!) t see whch s larger 8, and then assgn x! speak f x! as beng Medum Pstve. t the set asscated wth the larger value; hence, n ths example, we wuld We can frmally descrbe what we have just explaned, as fllws. Gven P fuzzy sets F wth MFs µ F (x), = 1,, P. When x = x!, evaluate all P MFs at ths pnt, and then cmpute [ ] " µ Fm (! max µ F1 ( x!), µ F2 ( x! ),, µ ( x! ) FP Then, L( x!) " F m,.e., x ). Let L( x!) dente the lngustc label asscated wth x!. 8 There s a lterature that deals wth ther ways fr dng ths; hwever, all ther ways are mre cmplcated than the present way, and usually rely n the avalablty f truth data. Such data s usually nt avalable when cmputng wth wrds. 12
13 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , [ ] (12) L( x!) = arg max "F µ F1 ( x!), µ F2 ( x! ),, µ ( x! ) FP Cnsder the type-2 stuatn depcted n Fgure 5 at x = x!. Ths value f x nly generates a nnzer membershp n the type-2 fuzzy set W 4 = Medum Pstve; hence, x = x! can be descrbed lngustcally, wthut any ambguty, as Medum Pstve. The stuatn at x = x! s qute dfferent, because ths value f x generates a range f nn-zer secndary MF values n the tw type- 2 fuzzy sets W 4 = Medum Pstve and W 5 = Very Pstve. It wuld be extrardnarly dffcult t cmmuncate ths lngustcally. An apprach (nt necessarly an ptmal ne, but ne that generalzes ts type-1 cunterpart t type-2 fuzzy sets), whch we descrbe next, s t frst cnvert the ntersectn f the vertcal lne at x = x! wth the FOUs nt a cllectn f numbers, after whch we can chse the lngustc label at x = x! usng the algrthm descrbed belw. µ F ( x) F 4 F 5 Medum Pstve Very Pstve x! x!! Fgure 4: Returnng t a lngustc label fr type-1 fuzzy sets. x The type-2 MFs µ W 4 (x,u) and µ W 5 (x,u) are characterzed by ther (shaded) FOUs, FOU( W 4 ) and FOU( W 5 ), respectvely. The upper and lwer MFs fr W 4 are µ W 4 (x) and µ W 4 (x), whereas the cmparable quanttes fr W 5 are µ W 5 (x) and µ W 5 (x). Cnsder, fr example, the vertcal lne at x = x!, and ts ntersectns wth the FOU fr W 4 (see Fgure 5). Asscated wth the nterval [ µ W 4 ( x!! ), µ W 4 ( x!!)] s the secndary MF f! [ ] x (u), u " µ W 4 ( x! ), µ W 4 ( x! ). Let the center f gravty f 13
14 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , x (u),!u " [ µ W ( x!! ), µ ( x!!) W ] be dented f cg 4 4 x! ( W 4 ). In a smlar manner, we can cmpute f!! f cg x! ( W 5 ). We can then cmpare f cg x! ( W 4 ) and f cg x! ( W 5 ). If f cg x! ( W 4 ) > f cg x!! ( W 5 ), then we wuld speak f x! as beng Medum Pstve ; therwse we wuld speak f x! as beng Very Pstve. We can frmally descrbe what we have just explaned as fllws. Gven N V type-2 fuzzy sets W wth MFs µ W (x,u), = 1,, N V. These MFs are characterzed by ther FOUs, FOU( W ), whse upper and lwer MFs are µ W (x) and µ W (x) ( = 1,, N V ), respectvely. Cnsder an arbtrary [ ]! f " value f x, say x = x!, and cmpute max f cg x! ( W ), f cg ( W ),, f cg ( W 1 x! 2 x! N v ) [ ] the center f gravty f the secndary MF f x! (u),"u # µ W ( x! ), µ W ( x!) lngustc label asscated wth x!. Then, L( x!) " W m,.e., cg x ( W m ) where f cg x! ( W ) s. Let L( x!) dente the L( x!) = arg max " [ cg x ( W ), f cg ( W ),, f cg ( W 1 x! 2 x! N v )] (13) W f! Fr nterval secndary MFs, t s easy t cmpute f cg x! ( W ), as cg f x! ( W [ ] (13) ) = 1 2 µ W ( x! ) + µ ( x!) W u W 4 Medum Pstve W 5 Very Pstve µ W 4 ( x!!) µ W 5 ( x!!) µ W ( x!!) 4 x! x!! µ W ( x!!) 5 Fgure 5: Returnng t a lngustc label fr type-2 fuzzy sets. The shaded regns are the FOUs fr the tw type-2 fuzzy sets. x 14
15 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , CONCLUSIONS We have presented a specfc archtecture fr makng judgments by cmputng wth wrds the perceptual cmputer (Per-C) and have argued that type-2 fuzzy sets must be used fr cmputng wth wrds. The fllwng ssues (ncludng thers) must be reslved befre the Per-C can be mplemented: 1. Hw shuld survey nterval nfrmatn abut wrds be used t derve an asscated type-2 MF? 2. Can cntext-ndependent results be appled when terms are used wthn a specfc cntext? Is there a way t acheve scale-nvarance fr wrds s cntext-ndependent ntervals can be used n cntext-dependent stuatns? Or, s there a way t map frm cntext-ndependent ntervals t cntext-dependent ntervals? 3. Hw much uncertanty shuld be asscated wth the nterval end-pnts. A methdlgy fr chsng r desgnng the uncertanty factr needs t be develped. 4. What are new archtectures fr type-2 FLSs that can be used n a Per-C? Can a specfc archtecture be valdated? 5. Whch mplcatns and t-nrms are mst apprprate fr a Per-C? What are the asscated extended sup-star cmpstn results fr them? It seems that, at the very least, we must accunt fr the uncertantes present n all rule-wrds, ncludng cnnectr wrds. Ths can be accmplshed by usng type-2 fuzzy sets fr antecedent and cnsequent wrds and parametrc peratrs fr cnnectr wrds. It may then be necessary t accunt fr the uncertantes asscated wth mplcatn and cmbnng f rules. Whether r nt t s necessary t parameterze the enrmus numbers f chces that are avalable fr the peratr mdels f mplcatn, unn, ntersectn, cmplement, t-nrm and t-cnrm, as n Yager and Flev (1994) remans t be explred. See Wu and Mendel (2001) fr mre dscussns abut ths. 6. Hw are fred rule utputs cmbned by peple? The engneerng lterature n FLSs has n adequate answer t ths questn. Yager and Flev (1994) ntrduce the ntn f sft rule aggregatn n whch rules are cmbned usng ether the SOWA-OR r the SOWA-AND. Ths apprach remans t be examned n the cntext f type-2 fuzzy sets. 7. Whch type-reductn methd s best fr a Per-C? 15
16 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , Is there a best way t return t a lngustc label fr a type-2 fuzzy set,.e., an ptmal decder? In the future, a cmputer-archtecture may cme nt beng that wll let us actually cmpute wth wrds. In the meantme, f we are t cmpute wth wrds, t must be dne wthn the framewrk f exstng cmputer archtectures, all f whch cmpute wth numbers. The Per-C lets us make judgments 9 by cmputng wth wrds usng exstng cmputer archtectures. APPENDIX A: Backgrund Knwledge abut Type-2 Fuzzy Sets In ths appendx we cllect sme mprtant defntns abut type-2 fuzzy sets. Fr mre detals abut such fuzzy sets, as well as many examples that llustrate the defntns, see Mendel (2001a). Defntn A-1: A type-2 fuzzy set, dented A, s characterzed by a (three-dmensnal) type-2 membershp functn µ A (x,u),.e., A = " (x,u) / (x,u) J x # [0,1] (A-1) µ x!x " u!j A x where!! dentes unn ver all admssble x and u, and 0! µ A (x,u)! 1. At each fxed value f x!x, J x s the prmary membershp f x and x s called the prmary varable. Defntn A-2: At each value f x, say x = x!, the 2D plane whse axes are u and µ (! A x,u) s called a vertcal slce f µ (x,u). A secndary membershp functn s a vertcal slce f µ A A (x,u). It s µ (x =! A x,u) fr x! "X and!u "J x # $[0,1],.e., µ (x = x!,u) " µ (! A A x ) = $ f (u) u x! J x! % [0,1] (A-2) u #J x! 16
17 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , n whch 0! f x " (u)!1. Because! x " # X, we drp the prme ntatn n µ ( x!), and refer t µ (x) A A as a secndary membershp functn; t s a type-1 fuzzy set, whch we als refer t as a secndary set. Based n the cncept f secndary sets, we can renterpret a type-2 fuzzy set as the unn f all secndary sets,.e., usng (A-2), we can re-express A n a vertcal-slce manner, as: A = {(x,µ (x))!x "X} (A-3) A r as A = " µ (x) x = x!x A [ f x (u) / u x!x u!j x " " ] x J x # [0,1] (A-4) Defntn A-3: The dman f a secndary membershp functn s called the prmary membershp f x. In (A-4), J x s the prmary membershp f x, where J x! [0,1] fr!x "X. Defntn A-4: The ampltude f a secndary membershp functn s called a secndary grade. In (A-2) and (A-4), f x (u) s a secndary grade. Defntn A-5: An nterval type-2 fuzzy set s a type-2 fuzzy set all f whse secndary membershp functns are type-1 nterval sets,.e., f x (u) = 1,!u "J x # [0,1],!x "X. Interval secndary membershp functns reflect a unfrm uncertanty at the prmary membershps f x, and are the nes mst cmmnly used n type-2 FLSs. Nte that an nterval set can be represented just by ts dman nterval, whch can be expressed n terms f ts left and rght endpnts as [l, r], r by ts center and spread as [c - s, c +s], where c = (l + r) / 2 and s = (r! l) / 2. 9 We clam nthng else fr the Per-C, althugh t s archtecture may als be useful fr ther knds f cmputng wth wrds. 17
18 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , Defntn A-6: Assume that each f the secndary membershp functns f a type-2 fuzzy set has nly ne secndary grade that equals 1. A prncpal membershp functn s the unn f all such pnts at whch ths ccurs,.e., µ prncpal (x) = " u x where f x (u) = 1 (A-5) x!x and s asscated wth a type-1 fuzzy set. Fr nterval secndary membershp functns, we defne the prncpal membershp functn as ccurrng at the unn f all prmary membershp mdpnts. Nte that when all membershp functn uncertantes dsappear, a type-2 membershp functn reduces t ts prncpal membershp functn. Defntn A-7: Uncertanty n the prmary membershps f a type-2 fuzzy set, A, cnssts f a bunded regn that we call the ftprnt f uncertanty (FOU). It s the unn f all prmary membershps,.e., FOU( A ) =! (A-6) J x!x x The term FOU s very useful, because t nt nly fcuses ur attentn n the uncertantes nherent n a specfc type-2 membershp functn, whse shape s a drect cnsequence f the nature f these uncertantes, but t als prvdes a very cnvenent verbal descrptn f the entre dman f supprt fr all the secndary grades f a type-2 membershp functn. Defntn A-8: Cnsder a famly f type-1 membershp functns µ A (x p 1, p 2,..., p v ) where p 1, p 2,..., p v are parameters, sme r all f whch vary ver sme range f values,.e., p!p ( = 1,, v). A prmary membershp functn (MF) s any ne f these type-1 membershp functns, e.g., µ A (x p 1 = p 1!, p 2 = p 2!,..., p v = p v! ). Fr shrt, we use µ A (x) t dente a prmary membershp functn. It wll be subject t sme restrctns n ts parameters. The famly f all prmary membershp functns creates a FOU. 18
19 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , Tw examples f very useful prmary MFs are: Gaussan MF wth uncertan mean and certan standard devatn, and Gaussan MF wth certan mean and uncertan standard devatn. Defntn A-9: An upper membershp functn and a lwer membershp functn are tw type-1 membershp functns that are bunds fr the FOU f a type-2 fuzzy set A. The upper membershp functn s asscated wth the upper bund f FOU( A ), and s dented µ (x),!x "X. The lwer membershp functn s asscated wth the lwer bund f FOU( A ), and s dented µ A (x),!x "X,.e., A µ A (x)! FOU( A ) "x #X (A-7) and µ A (x)! FOU( A ) "x #X (A-8) Because the dman f a secndary membershp functn has been cnstraned n Defntn A-1 t be cntaned n [0, 1], lwer and upper membershp functns always exst. APPENDIX B. Rule-Based Fuzzy Lgc Systems A rule-based FLS cntans fur cmpnents rules, fuzzfer, nference engne, and utput prcessr that are nter-cnnected, as shwn n Fgure B-1. Once the rules have been establshed, a FLS can be vewed as a mappng frm nputs t utputs (the sld path n Fgure B-1, frm Crsp nputs t Crsp utputs ), and ths mappng can be expressed quanttatvely as y = f (x). Ths knd f FLS s very wdely used n many engneerng applcatns f FL, such as n FL cntrllers and sgnal prcessrs, and s als knwn as a fuzzy cntrller, fuzzy system, fuzzy expert system, r fuzzy mdel. 19
20 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , FLS Rules Crsp nputs x Fuzzfer Output Prcessr Crsp utputs y Fuzzy nput sets Inference Fuzzy utput sets y = f( x) Fgure B-1: Fuzzy lgc system. Rules are the heart f a FLS, and may be prvded by experts r can be extracted frm numercal data. In ether case, the rules that we are nterested n can be expressed as a cllectn f IF THEN statements. Fuzzy sets are asscated wth terms that appear n the antecedents r cnsequents f rules, and wth the nputs t and utput f the FLS. Membershp functns are used t descrbe these fuzzy sets. Tw knds f fuzzy sets can be used n a FLS, type-1 and type-2. Type-1 fuzzy sets are descrbed by membershp functns that are ttally certan, whereas type-2 fuzzy sets are descrbed by membershp functns that are themselves fuzzy. The latter let us quantfy dfferent knds f uncertantes that can ccur n a FLS. A FLS that s descrbed cmpletely n terms f type-1 fuzzy sets s called a type-1 FLS, whereas a FLS that s descrbed usng at least ne type-2 fuzzy set s called a type-2 FLS. A type-2 FLS whse MFs are nterval type-2 fuzzy sets s called an nterval type-2 FLS. In ths paper we assume the use f nterval type-2 FLSs. Returnng t the Fgure B-1 FLS, the fuzzfer maps crsp numbers nt fuzzy sets. It s needed t actvate rules that are n terms f lngustc varables, whch have fuzzy sets asscated wth them. The nputs t the FLS prr t fuzzfcatn may be certan (e.g., perfect measurements) r uncertan 20
21 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , (e.g., nsy measurements). Type-1 r type-2 fuzzy sets can be used t mdel the latter measurements. The nference engne f the Fgure B-1 FLS maps fuzzy sets nt fuzzy sets. It handles the way n whch rules are actvated and cmbned. Just as we humans use many dfferent types f nferental prcedures t help us understand thngs r t make decsns, there are many dfferent FL nferental prcedures. In many applcatns f a FLS, crsp numbers must be btaned at ts utput. Ths s accmplshed by the utput prcessr, and s knwn as defuzzfcatn. The utput prcessr fr a type-1 FLS cnssts nly f a defuzzfer; hwever, the utput prcessr f a type-2 FLS cntans tw cmpnents: the frst maps a type-2 fuzzy set nt a type-1 fuzzy set and s called type-reductn, and the secnd perfrms defuzzfcatn n the latter set. Type-reductn s vervewed n Appendx C. APPENDIX C: Type-Reductn The type-reduced set prvdes an nterval f uncertanty fr the utput f a type-2 FLS, n much the same way that a cnfdence nterval prvdes an nterval f uncertanty fr a prbablstc system. The mre uncertantes that ccur n a type-2 FLS, whch translate nt mre uncertantes abut ts MFs, the larger wll be the type-reduced set, and vce-versa. Fve dfferent type-reductn methds are descrbed n Mendel (2001a). Each s nspred by what we d n a type-1 FLS [when we defuzzfy the (cmbned) utput f the nference engne usng a varety f defuzzfcatn methds that all d sme srt f centrd calculatn] and are based n cmputng the centrd f a type-2 fuzzy set. Usng the Extensn Prncple, Karnk and Mendel (2001) defned the centrd f a type-2 fuzzy set; t s a type-1 fuzzy set. Cmputng the centrd f a general type-2 fuzzy set can be very ntensve; hwever, fr an nterval type-2 fuzzy set, an exact teratve methd fr cmputng ts centrd has been develped by Karnk and Mendel (2001). Ths was pssble because the centrd f an nterval type-2 fuzzy set s an nterval type-1 fuzzy set, and such sets are 21
22 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , cmpletely characterzed by ther left- and rght-end pnts; hence, cmputng the centrd f an nterval type-2 fuzzy set nly requres cmputng thse tw end-pnts. Center-f-sets, centrd, center-f-sums, and heght type-reductn can all be expressed as Y TR (x) = y l, y r f y = 1 # M (C-1) [ ] =!! 1 y # f # f M "[ f M, f ] 1 "[ f 1, f ] M " y M M y # 1 " y 1 1 [ [ 1 M l, y r ] l, y r ] M!! f =1 Fr the dfferent type-reductn methds y l, y r, f, f and M have dfferent meanngs, as summarzed n Table C-1. The Karnk-Mendel teratve prcedure fr cmputng y r s: 1. Wthut lss f generalty, assume that the pre-cmputed y r 1 2.e., y r! y r!!! y rm. are arranged n ascendng rder; M M 2. Cmpute y r as y r =! f r y r! f r by ntally settng f r =1 =1 = ( f + f ) 2 fr = 1,, M, where f and f have been prevusly cmputed usng the equatns gven n Appendx D, respectvely, and let y r! " y r. 3. Fnd R (1! R! M "1) such that y r R R! y r "! y +1 r. M M 4. Cmpute y r =! f r y r! f r wth f r y r! " y r. =1 =1 = f fr! R and f r = f fr > R, and let 5. If y r! " y! r, then g t Step 6. If y r! = y! r, then stp and set y r! " y r. 6. Set y r! equal t y r!, and return t Step 3. The prcedure fr cmputng y l s very smlar t the ne just gven fr y r. Just replace y r by y l, and, n step 3 fnd L (1! L! M "1) such that y L L +1 l! y l "! y l. Addtnally, n step 2 we nw 22
23 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , M cmpute y l as y l = f y M! l! f l l by ntally settng f r =1 = 1 = ( f + f ) 2 fr = 1,, M, and, n M step 4 we cmpute y l as y l = f y M! l! f l l wth f l =1 = 1 = f fr! L and f l = f fr > L. These tw fur-step teratve-prcedures (Steps 1 and 2 are ntalzatn-steps) have been prven by Karnk and Mendel (2001) t cnverge t the exact slutns n n mre than M teratns. Table C-1: Meanngs f y l, y r, f, f and M n (C-1) fr dfferent type-reductn methds a. Type-reductn methd center-f sets centrd b center-f-sums c heght y l and y r defned f and f defned d M defned left and rght end pnts f the lwer and upper frng degrees number f rules centrd f the cnsequent f f the th rule the th rule y l = y r = y, the th pnt n the lwer and upper membershp number f sampled pnts sampled unverse f dscurse f grades f the th sampled the FLS s utput utput f the FLS s utput y l = y r = y, the th pnt n the sums f lwer and upper number f sampled pnts sampled unverse f dscurse f membershp grades fr the th the FLS s utput sampled pnt f all rule utputs y l = y r = y, a sngle pnt n the lwer and upper frng degrees number f rules cnsequent dman f the th f the th rule rule, usually chsen t be the pnt havng the hghest prmary membershp n the prncpal MF f the utput set a. Cmparable results fr mdfed heght type-reductn can be fund n Mendel (2001a), Sectn b. Prr t calculatng the centrd type-reduced set, the fred type-2 fuzzy sets are unned. c. Prr t calculatng the center-f-sums type-reduced set, the membershp functns f the fred type-2 fuzzy sets are added (r a lnear cmbnatn f them s frmed). d. See Appendx D fr frmulas fr f and f, as well as fr rule utputs and unned rule utputs. 23
24 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , APPENDIX D: Fuzzy Inference Engne Results fr Interval Type-2 Fuzzy Sets Cnsder a type-2 FLS havng p nputs x 1! X 1,..., x p!x p and ne utput y!y. We assume there are M rules where the lth rule has the frm R l : IF x 1 s F l 1 and! and x p s F l p, THEN y s G l l = 1,...,M (D-1) Ths rule represents a type-2 relatn between the nput space X 1!!! X p, and the utput space, Y, f the type-2 FLS. Asscated wth the p antecedent type-2 fuzzy sets, F l, are the type-2 MFs µ F l (x ) ( = 1,, p), and asscated wth the cnsequent type-2 fuzzy set G l µ G l (y). s ts type-2 MF The majr result fr an nterval sngletn type-2 FLS s summarzed n the fllwng: Therem D-1: [Lang and Mendel (2000), Mendel (2001a)] In an nterval sngletn type-2 FLS usng prduct r mnmum t-nrm, fr nput x = x! : (a) The result f the nput and antecedent peratns, s an nterval type-1 set, called the frng set,.e., F l ( x!) = [ f l ( x!), f l ( x!)] " [ f l, f l ] (D-2) where f l ( x!) = µ F ( x! 1 l 1 )!!!µ F ( x! p l p ) (D-3) and f l ( x!) = µ ( x! F 1 1)!!!µ ( x! l F p l p ); (D-4) (b) The rule R l fred utput cnsequent set, µ B l (y), s the type-1 nterval fuzzy set 24
25 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , µ B l (y) = " 1 b l, y!y (D-5) [ ] b l! f l! µ G l ( y), f l! µ G l ( y) where µ G (y) and µ (y) are the lwer and upper membershp grades f µ l G l G (y). l (c) Suppse that N f the M rules n the FLS fre, where N! M, and the cmbned utput type-1 fuzzy set, µ B (y), s btaned by cmbnng the fred utput cnsequent sets by takng the unn f the rule R l fred utput cnsequent sets 10 ; then, µ B (y) = # 1 b, y!y (D-6) b! [[ f 1! µ G 1 ( y ) ] "! " [ f N! µ G N ( y ) ] [, f 1! µ G ] [ 1 ( y ) "! " f N! µ G ] ] N ( y ) A cmplete prf f ths therem can be fund n Lang and Mendel (2000) and n Mendel (2001a). Generalzatns f ths therem t the very mprtant case when the nput t the type-2 FLS s a type-2 fuzzy set whch wuld be the case when the wrds that actvate the Per-C are mdeled as type-2 fuzzy sets are als gven n thse references. 10 We d nt necessarly advcate takng the unn f these sets. Part c merely llustrates the calculatns f ne chses t d ths. 25
26 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , REFERENCES Karnk N. N. and Mendel J. M. (2001): Centrd f a type-2 fuzzy set. Infrmatn Scences, Vl. 132, pp Klr G. J. and Werman M. J. (1998): Uncertanty-Based Infrmatn. Hedelberg, Germany: Physca-Verlag. Lang Q. and Mendel J. M. (2000): Interval type-2 fuzzy lgc systems: thery and desgn. IEEE Trans. n Fuzzy Systems, Vl. 8, pp Mendel J. M. (1999): Cmputng wth wrds, when wrds can mean dfferent thngs t dfferent peple. Prc. f Thrd Internatnal ICSC Sympsum n Fuzzy Lgc and Applcatns, Rchester Unv., Rchester, NY, June, pp Mendel J. M. (2001a): Uncertan Rule-Based Fuzzy Lgc Systems: Intrductn and New Drectns. Upper Saddle Rver, NJ: Prentce-Hall. Mendel J. M. (2001b): On the mprtance f nterval sets n type-2 fuzzy lgc systems. Prc. f IFSA/NAFIPS Cnference, Vancuver, Canada, July, pp Mendel J. M. (2001c): The Perceptual Cmputer: an archtecture fr cmputng wth wrds. Prc. IEEE Cnference n Fuzzy Systems, Melburne, Australa, December, pp Mendel J. M. (2002): Uncertanty, type-2 fuzzy sets, and ftprnts f uncertanty. The 9 th Int l. Cnference n Infrmatn Prcessng and Management f Uncertanty n Knwledge-Based Systems, Annecy, France, July, pp Mendel J. M. and Wu H. (2002): Uncertanty versus chce n rule-based fuzzy lgc systems. IEEE WCCI, FUZZ Cnference, Hnlulu, HI, May, pp Wang L.-X. (1997): A Curse n Fuzzy Systems and Cntrl. Upper Saddle Rver, NJ: Prentce- Hall. Wang P. P. (Ed.) (2001): Cmputng Wth Wrds. New Yrk: Jhn Wley & Sns, Inc. Yager R. R. and Flev D. P. (1994): Essentals f Fuzzy Mdelng and Cntrl. New Jersey: Jhn Wley & Sns, Inc. Zadeh L. A. (1996): Fuzzy lgc = cmputng wth wrds. IEEE Trans. n Fuzzy Systems, Vl. 4, pp Zadeh L. A. (1999): Frm cmputng wth numbers t cmputng wth wrds frm manpulatn f 26
27 Mendel, J. M., "An Archtecture fr Makng Judgments Usng Cmputng Wth Wrds," Int. J. Appl. Math. Cmput. Sc., vl. 12, N. 3, pp , measurements t manpulatn f perceptns. IEEE Trans. n Crcuts and Systems I: Fundamental Thery and Applcatns, Vl. 4, pp
A New Method for Solving Integer Linear. Programming Problems with Fuzzy Variables
Appled Mathematcal Scences, Vl. 4, 00, n. 0, 997-004 A New Methd fr Slvng Integer Lnear Prgrammng Prblems wth Fuzzy Varables P. Pandan and M. Jayalakshm Department f Mathematcs, Schl f Advanced Scences,
More informationCircuits Op-Amp. Interaction of Circuit Elements. Quick Check How does closing the switch affect V o and I o?
Crcuts Op-Amp ENGG1015 1 st Semester, 01 Interactn f Crcut Elements Crcut desgn s cmplcated by nteractns amng the elements. Addng an element changes vltages & currents thrughut crcut. Example: clsng a
More informationIntroduction to Electronic circuits.
Intrductn t Electrnc crcuts. Passve and Actve crcut elements. Capactrs, esstrs and Inductrs n AC crcuts. Vltage and current dvders. Vltage and current surces. Amplfers, and ther transfer characterstc.
More information14 The Boole/Stone algebra of sets
14 The Ble/Stne algebra f sets 14.1. Lattces and Blean algebras. Gven a set A, the subsets f A admt the fllwng smple and famlar peratns n them: (ntersectn), (unn) and - (cmplementatn). If X, Y A, then
More informationChapter 7. Systems 7.1 INTRODUCTION 7.2 MATHEMATICAL MODELING OF LIQUID LEVEL SYSTEMS. Steady State Flow. A. Bazoune
Chapter 7 Flud Systems and Thermal Systems 7.1 INTODUCTION A. Bazune A flud system uses ne r mre fluds t acheve ts purpse. Dampers and shck absrbers are eamples f flud systems because they depend n the
More informationFeedback Principle :-
Feedback Prncple : Feedback amplfer s that n whch a part f the utput f the basc amplfer s returned back t the nput termnal and mxed up wth the nternal nput sgnal. The sub netwrks f feedback amplfer are:
More informationWp/Lmin. Wn/Lmin 2.5V
UNIVERITY OF CALIFORNIA Cllege f Engneerng Department f Electrcal Engneerng and Cmputer cences Andre Vladmrescu Hmewrk #7 EEC Due Frday, Aprl 8 th, pm @ 0 Cry Prblem #.5V Wp/Lmn 0.0V Wp/Lmn n ut Wn/Lmn.5V
More information_J _J J J J J J J J _. 7 particles in the blue state; 3 particles in the red state: 720 configurations _J J J _J J J J J J J J _
Dsrder and Suppse I have 10 partcles that can be n ne f tw states ether the blue state r the red state. Hw many dfferent ways can we arrange thse partcles amng the states? All partcles n the blue state:
More informationSIMULATION OF THREE PHASE THREE LEG TRANSFORMER BEHAVIOR UNDER DIFFERENT VOLTAGE SAG TYPES
SIMULATION OF THREE PHASE THREE LEG TRANSFORMER BEHAVIOR UNDER DIFFERENT VOLTAGE SAG TYPES Mhammadreza Dlatan Alreza Jallan Department f Electrcal Engneerng, Iran Unversty f scence & Technlgy (IUST) e-mal:
More informationChapter 3, Solution 1C.
COSMOS: Cmplete Onlne Slutns Manual Organzatn System Chapter 3, Slutn C. (a If the lateral surfaces f the rd are nsulated, the heat transfer surface area f the cylndrcal rd s the bttm r the tp surface
More informationSection 3: Detailed Solutions of Word Problems Unit 1: Solving Word Problems by Modeling with Formulas
Sectn : Detaled Slutns f Wrd Prblems Unt : Slvng Wrd Prblems by Mdelng wth Frmulas Example : The factry nvce fr a mnvan shws that the dealer pad $,5 fr the vehcle. If the stcker prce f the van s $5,, hw
More informationCHAPTER 3 ANALYSIS OF KY BOOST CONVERTER
70 CHAPTER 3 ANALYSIS OF KY BOOST CONERTER 3.1 Intrductn The KY Bst Cnverter s a recent nventn made by K.I.Hwu et. al., (2007), (2009a), (2009b), (2009c), (2010) n the nn-slated DC DC cnverter segment,
More informationChapter 6 : Gibbs Free Energy
Wnter 01 Chem 54: ntrductry hermdynamcs Chapter 6 : Gbbs Free Energy... 64 Defntn f G, A... 64 Mawell Relatns... 65 Gbbs Free Energy G(,) (ure substances)... 67 Gbbs Free Energy fr Mtures... 68 ΔG f deal
More information6. ELUTRIATION OF PARTICLES FROM FLUIDIZED BEDS
6. ELUTRIATION OF PARTICLES FROM FLUIDIZED BEDS Elutratn s the prcess n whch fne partcles are carred ut f a fludzed bed due t the flud flw rate passng thrugh the bed. Typcally, fne partcles are elutrated
More informationRegression with Stochastic Regressors
Sectn 9 Regressn wth Stchastc Regressrs Meanng f randm regressrs Untl nw, we have assumed (aganst all reasn) that the values f x have been cntrlled by the expermenter. Ecnmsts almst never actually cntrl
More informationLecture 12. Heat Exchangers. Heat Exchangers Chee 318 1
Lecture 2 Heat Exchangers Heat Exchangers Chee 38 Heat Exchangers A heat exchanger s used t exchange heat between tw fluds f dfferent temperatures whch are separated by a sld wall. Heat exchangers are
More informationSection 10 Regression with Stochastic Regressors
Sectn 10 Regressn wth Stchastc Regressrs Meanng f randm regressrs Untl nw, we have assumed (aganst all reasn) that the values f x have been cntrlled by the expermenter. Ecnmsts almst never actually cntrl
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatnal Data Assmlatn (4D-Var) 4DVAR, accrdng t the name, s a fur-dmensnal varatnal methd. 4D-Var s actually a smple generalzatn f 3D-Var fr bservatns that are dstrbuted n tme. he equatns are the same,
More informationDesign of Analog Integrated Circuits
Desgn f Analg Integrated Crcuts I. Amplfers Desgn f Analg Integrated Crcuts Fall 2012, Dr. Guxng Wang 1 Oerew Basc MOS amplfer structures Cmmn-Surce Amplfer Surce Fllwer Cmmn-Gate Amplfer Desgn f Analg
More informationelement k Using FEM to Solve Truss Problems
sng EM t Slve Truss Prblems A truss s an engneerng structure cmpsed straght members, a certan materal, that are tpcall pn-ned at ther ends. Such members are als called tw-rce members snce the can nl transmt
More informationBig Data Analytics! Special Topics for Computer Science CSE CSE Mar 31
Bg Data Analytcs! Specal Tpcs fr Cmputer Scence CSE 4095-001 CSE 5095-005! Mar 31 Fe Wang Asscate Prfessr Department f Cmputer Scence and Engneerng fe_wang@ucnn.edu Intrductn t Deep Learnng Perceptrn In
More informationWater vapour balance in a building moisture exposure for timber structures
Jnt Wrkshp f COST Actns TU1 and E55 September 21-22 9, Ljubljana, Slvena Water vapur balance n a buldng msture expsure fr tmber structures Gerhard Fnk ETH Zurch, Swtzerland Jchen Köhler ETH Zurch, Swtzerland
More informationA Note on the Linear Programming Sensitivity. Analysis of Specification Constraints. in Blending Problems
Aled Mathematcal Scences, Vl. 2, 2008, n. 5, 241-248 A Nte n the Lnear Prgrammng Senstvty Analyss f Secfcatn Cnstrants n Blendng Prblems Umt Anc Callway Schl f Busness and Accuntancy Wae Frest Unversty,
More informationShell Stiffness for Diffe ent Modes
Engneerng Mem N 28 February 0 979 SUGGESTONS FOR THE DEFORMABLE SUBREFLECTOR Sebastan vn Herner Observatns wth the present expermental versn (Engneerng Dv nternal Reprt 09 July 978) have shwn that a defrmable
More informationV. Electrostatics Lecture 27a: Diffuse charge at electrodes
V. Electrstatcs Lecture 27a: Dffuse charge at electrdes Ntes by MIT tudent We have talked abut the electrc duble structures and crrespndng mdels descrbng the n and ptental dstrbutn n the duble layer. Nw
More informationCONVEX COMBINATIONS OF ANALYTIC FUNCTIONS
rnat. J. Math. & Math. S. Vl. 6 N. (983) 33534 335 ON THE RADUS OF UNVALENCE OF CONVEX COMBNATONS OF ANALYTC FUNCTONS KHALDA. NOOR, FATMA M. ALOBOUD and NAEELA ALDHAN Mathematcs Department Scence Cllege
More informationPT326 PROCESS TRAINER
PT326 PROCESS TRAINER 1. Descrptn f the Apparatus PT 326 Prcess Traner The PT 326 Prcess Traner mdels cmmn ndustral stuatns n whch temperature cntrl s requred n the presence f transprt delays and transfer
More informationMAXIMIN CLUSTERS FOR NEAR-REPLICATE REGRESSION LACK OF FIT TESTS. BY FORREST R. MILLER, JAMES W. NEILL AND BRIAN W. SHERFEY Kansas State University
The Annals f Statstcs 1998, Vl. 6, N. 4, 14111433 MAXIMIN CLUSTERS FOR NEAR-REPLICATE REGRESSION LACK OF FIT TESTS BY FORREST R. MILLER, JAMES W. NEILL AND BRIAN W. SHERFEY Kansas State Unversty T assess
More informationPHYSICS 536 Experiment 12: Applications of the Golden Rules for Negative Feedback
PHYSICS 536 Experment : Applcatns f the Glden Rules fr Negatve Feedback The purpse f ths experment s t llustrate the glden rules f negatve feedback fr a varety f crcuts. These cncepts permt yu t create
More informationExploiting vector space properties for the global optimization of process networks
Exptng vectr space prpertes fr the gbal ptmzatn f prcess netwrks Juan ab Ruz Ignac Grssmann Enterprse Wde Optmzatn Meetng March 00 Mtvatn - The ptmzatn f prcess netwrks s ne f the mst frequent prblems
More informationCTN 2/23/16. EE 247B/ME 218: Introduction to MEMS Design Lecture 11m2: Mechanics of Materials. Copyright 2016 Regents of the University of California
Vlume Change fr a Unaxal Stress Istrpc lastcty n 3D Istrpc = same n all drectns The cmplete stress-stran relatns fr an strpc elastc Stresses actng n a dfferental vlume element sld n 3D: (.e., a generalzed
More informationApproach: (Equilibrium) TD analysis, i.e., conservation eqns., state equations Issues: how to deal with
Schl f Aerspace Chemcal D: Mtvatn Prevus D Analyss cnsdered systems where cmpstn f flud was frzen fxed chemcal cmpstn Chemcally eactng Flw but there are numerus stuatns n prpulsn systems where chemcal
More informationENGI 4421 Probability & Statistics
Lecture Ntes fr ENGI 441 Prbablty & Statstcs by Dr. G.H. Gerge Asscate Prfessr, Faculty f Engneerng and Appled Scence Seventh Edtn, reprnted 018 Sprng http://www.engr.mun.ca/~ggerge/441/ Table f Cntents
More informationCHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India
CHAPTER 3 INEQUALITIES Cpyright -The Institute f Chartered Accuntants f India INEQUALITIES LEARNING OBJECTIVES One f the widely used decisin making prblems, nwadays, is t decide n the ptimal mix f scarce
More informationConduction Heat Transfer
Cnductn Heat Transfer Practce prblems A steel ppe f cnductvty 5 W/m-K has nsde and utsde surface temperature f C and 6 C respectvely Fnd the heat flw rate per unt ppe length and flux per unt nsde and per
More informationSpring 2002 Lecture #17
1443-51 Sprng 22 Lecture #17 r. Jaehn Yu 1. Cndtns fr Equlbrum 2. Center f Gravty 3. Elastc Prpertes f Slds Yung s dulus Shear dulus ulk dulus Tday s Hmewrk Assgnment s the Hmewrk #8!!! 2 nd term eam n
More informationReproducing kernel Hilbert spaces. Nuno Vasconcelos ECE Department, UCSD
Reprucng ernel Hlbert spaces Nun Vascncels ECE Department UCSD Classfcatn a classfcatn prblem has tw tpes f varables X -vectr f bservatns features n the wrl Y - state class f the wrl Perceptrn: classfer
More information55:041 Electronic Circuits
55:04 Electrnc Crcuts Feedback & Stablty Sectns f Chapter 2. Kruger Feedback & Stablty Cnfguratn f Feedback mplfer S S S S fb Negate feedback S S S fb S S S S S β s the feedback transfer functn Implct
More informationPhysics 107 HOMEWORK ASSIGNMENT #20
Physcs 107 HOMEWORK ASSIGNMENT #0 Cutnell & Jhnsn, 7 th etn Chapter 6: Prblems 5, 7, 74, 104, 114 *5 Cncept Smulatn 6.4 prves the ptn f explrng the ray agram that apples t ths prblem. The stance between
More informationTransient Conduction: Spatial Effects and the Role of Analytical Solutions
Transent Cnductn: Spatal Effects and the Rle f Analytcal Slutns Slutn t the Heat Equatn fr a Plane Wall wth Symmetrcal Cnvectn Cndtns If the lumped capactance apprxmatn can nt be made, cnsderatn must be
More informationEE 204 Lecture 25 More Examples on Power Factor and the Reactive Power
EE 204 Lecture 25 Mre Examples n Pwer Factr and the Reactve Pwer The pwer factr has been defned n the prevus lecture wth an example n pwer factr calculatn. We present tw mre examples n ths lecture. Example
More informationConservation of Energy
Cnservatn f Energy Equpment DataStud, ruler 2 meters lng, 6 n ruler, heavy duty bench clamp at crner f lab bench, 90 cm rd clamped vertcally t bench clamp, 2 duble clamps, 40 cm rd clamped hrzntally t
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationPhysic 231 Lecture 33
Physc 231 Lecture 33 Man pnts f tday s lecture: eat and heat capacty: Q cm Phase transtns and latent heat: Q Lm ( ) eat flw Q k 2 1 t L Examples f heat cnductvty, R values fr nsulatrs Cnvectn R L / k Radatn
More informationMedium Scale Integrated (MSI) devices [Sections 2.9 and 2.10]
EECS 270, Winter 2017, Lecture 3 Page 1 f 6 Medium Scale Integrated (MSI) devices [Sectins 2.9 and 2.10] As we ve seen, it s smetimes nt reasnable t d all the design wrk at the gate-level smetimes we just
More informationIGEE 401 Power Electronic Systems. Solution to Midterm Examination Fall 2004
Jós, G GEE 401 wer Electrnc Systems Slutn t Mdterm Examnatn Fall 2004 Specal nstructns: - Duratn: 75 mnutes. - Materal allwed: a crb sheet (duble sded 8.5 x 11), calculatr. - Attempt all questns. Make
More informationState-Space Model Based Generalized Predictive Control for Networked Control Systems
Prceedngs f the 7th Wrld Cngress he Internatnal Federatn f Autmatc Cntrl State-Space Mdel Based Generalzed Predctve Cntrl fr Netwred Cntrl Systems Bn ang* Gu-Png Lu** We-Hua Gu*** and Ya-Ln Wang**** *Schl
More informationt r m o o H Is The Sensitive Information Of Your Company Completely Secure?
: n t a c f t r e C 1 0 0 7 l 2 l O W S I y n a p m C r u Y w H t f e n e B Cyber crmnals are fndng ncreasngly clever ways every day t be able t peek ver yur shulder, and wth ths llegal ndustry beng an
More informationA Note on Equivalences in Measuring Returns to Scale
Internatnal Jurnal f Busness and Ecnmcs, 2013, Vl. 12, N. 1, 85-89 A Nte n Equvalences n Measurng Returns t Scale Valentn Zelenuk Schl f Ecnmcs and Centre fr Effcenc and Prductvt Analss, The Unverst f
More informationProblem Set 5 Solutions - McQuarrie Problems 3.20 MIT Dr. Anton Van Der Ven
Prblem Set 5 Slutns - McQuarre Prblems 3.0 MIT Dr. Antn Van Der Ven Fall Fall 003 001 Prblem 3-4 We have t derve the thermdynamc prpertes f an deal mnatmc gas frm the fllwng: = e q 3 m = e and q = V s
More informationLucas Imperfect Information Model
Lucas Imerfect Infrmatn Mdel 93 Lucas Imerfect Infrmatn Mdel The Lucas mdel was the frst f the mdern, mcrfundatns mdels f aggregate suly and macrecnmcs It bult drectly n the Fredman-Phels analyss f the
More informationLinear Plus Linear Fractional Capacitated Transportation Problem with Restricted Flow
Amercan urnal f Operatns Research,,, 58-588 Publshed Onlne Nvember (http://www.scrp.rg/urnal/ar) http://dx.d.rg/.46/ar..655 Lnear Plus Lnear Fractnal Capactated Transprtatn Prblem wth Restrcted Flw Kavta
More informationWeathering. Title: Chemical and Mechanical Weathering. Grade Level: Subject/Content: Earth and Space Science
Weathering Title: Chemical and Mechanical Weathering Grade Level: 9-12 Subject/Cntent: Earth and Space Science Summary f Lessn: Students will test hw chemical and mechanical weathering can affect a rck
More informationRelationships Between Frequency, Capacitance, Inductance and Reactance.
P Physics Relatinships between f,, and. Relatinships Between Frequency, apacitance, nductance and Reactance. Purpse: T experimentally verify the relatinships between f, and. The data cllected will lead
More informationChem 204A, Fall 2004, Mid-term (II)
Frst tw letters f yur last name Last ame Frst ame McGll ID Chem 204A, Fall 2004, Md-term (II) Read these nstructns carefully befre yu start tal me: 2 hurs 50 mnutes (6:05 PM 8:55 PM) 1. hs exam has ttal
More informationCHAPTER 24: INFERENCE IN REGRESSION. Chapter 24: Make inferences about the population from which the sample data came.
MATH 1342 Ch. 24 April 25 and 27, 2013 Page 1 f 5 CHAPTER 24: INFERENCE IN REGRESSION Chapters 4 and 5: Relatinships between tw quantitative variables. Be able t Make a graph (scatterplt) Summarize the
More informationPhys 344 Ch 5 Lect 4 Feb 28 th,
hys 44 Ch 5 Lect 4 Feb 8 th, 009 1 Wed /4 Fr /6 Mn /9 Wed /11 Fr / 1 55 Dlute Slutn 56 Chemcal Equlbrum Revew Exam (C 107 S 60, 61 Bltzmann Statstcs Bnus: hys Sr hess resentatns @ 4pm HW17: 7,76,8 HW18:8,84,86,88,89,91
More informationMODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards:
MODULE FOUR This mdule addresses functins SC Academic Standards: EA-3.1 Classify a relatinship as being either a functin r nt a functin when given data as a table, set f rdered pairs, r graph. EA-3.2 Use
More informationSubject description processes
Subject representatin 6.1.2. Subject descriptin prcesses Overview Fur majr prcesses r areas f practice fr representing subjects are classificatin, subject catalging, indexing, and abstracting. The prcesses
More informationHow do scientists measure trees? What is DBH?
Hw d scientists measure trees? What is DBH? Purpse Students develp an understanding f tree size and hw scientists measure trees. Students bserve and measure tree ckies and explre the relatinship between
More informationLead/Lag Compensator Frequency Domain Properties and Design Methods
Lectures 6 and 7 Lead/Lag Cmpensatr Frequency Dmain Prperties and Design Methds Definitin Cnsider the cmpensatr (ie cntrller Fr, it is called a lag cmpensatr s K Fr s, it is called a lead cmpensatr Ntatin
More informationExercises H /OOA> f Wo AJoTHS l^»-l S. m^ttrt /A/ ?C,0&L6M5 INFERENCE FOR DISTRIBUTIONS OF CATEGORICAL DATA. tts^e&n tai-ns 5 2%-cas-hews^, 27%
/A/ mttrt?c,&l6m5 INFERENCE FOR DISTRIBUTIONS OF CATEGORICAL DATA Exercses, nuts! A cmpany clams that each batch f ttse&n ta-ns 5 2%-cas-hews, 27% almnds, 13% macadama nuts, and 8% brazl nuts. T test ths
More informationRevision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax
.7.4: Direct frequency dmain circuit analysis Revisin: August 9, 00 5 E Main Suite D Pullman, WA 9963 (509) 334 6306 ice and Fax Overview n chapter.7., we determined the steadystate respnse f electrical
More informationIII. Operational Amplifiers
III. Operatnal Amplfers Amplfers are tw-prt netwrks n whch the utput vltage r current s drectly prprtnal t ether nput vltage r current. Fur dfferent knds f amplfers ext: ltage amplfer: Current amplfer:
More informationCAUSAL INFERENCE. Technical Track Session I. Phillippe Leite. The World Bank
CAUSAL INFERENCE Technical Track Sessin I Phillippe Leite The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Phillippe Leite fr the purpse f this wrkshp Plicy questins are causal
More information, which yields. where z1. and z2
The Gaussian r Nrmal PDF, Page 1 The Gaussian r Nrmal Prbability Density Functin Authr: Jhn M Cimbala, Penn State University Latest revisin: 11 September 13 The Gaussian r Nrmal Prbability Density Functin
More informationWRITING THE REPORT. Organizing the report. Title Page. Table of Contents
WRITING THE REPORT Organizing the reprt Mst reprts shuld be rganized in the fllwing manner. Smetime there is a valid reasn t include extra chapters in within the bdy f the reprt. 1. Title page 2. Executive
More informationENSC Discrete Time Systems. Project Outline. Semester
ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding
More informationA Decision Support System for Safe Switching Control
6th WSEAS Internatnal Cnference n CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Car, Egypt, Dec 29-31, 2007 214 A Decsn Supprt System fr Safe Swtchng Cntrl F. N. KOUMBOULIS, M. P. TZAMTZI,
More informationBASD HIGH SCHOOL FORMAL LAB REPORT
BASD HIGH SCHOOL FORMAL LAB REPORT *WARNING: After an explanatin f what t include in each sectin, there is an example f hw the sectin might lk using a sample experiment Keep in mind, the sample lab used
More information5 th grade Common Core Standards
5 th grade Cmmn Cre Standards In Grade 5, instructinal time shuld fcus n three critical areas: (1) develping fluency with additin and subtractin f fractins, and develping understanding f the multiplicatin
More informationStudy Group Report: Plate-fin Heat Exchangers: AEA Technology
Study Grup Reprt: Plate-fin Heat Exchangers: AEA Technlgy The prblem under study cncerned the apparent discrepancy between a series f experiments using a plate fin heat exchanger and the classical thery
More informationo o IMPORTANT REMINDERS Reports will be graded largely on their ability to clearly communicate results and important conclusions.
BASD High Schl Frmal Lab Reprt GENERAL INFORMATION 12 pt Times New Rman fnt Duble-spaced, if required by yur teacher 1 inch margins n all sides (tp, bttm, left, and right) Always write in third persn (avid
More informationA Proposal of Heating Load Calculation considering Stack Effect in High-rise Buildings
A Prpsal f Heatng Lad Calculatn cnsderng Stack Effect n Hgh-rse Buldngs *Dsam Sng 1) and Tae-Hyuk Kang 2) 1) Department f Archtectural Engneerng, Sungkyunkwan Unversty, 2066 Sebu-r, Jangan-gu, Suwn, 440-746,
More informationAnalytical Modeling of Natural Convection in Horizontal Annuli
Analytcal Mdelng f Natural Cnvectn n Hrzntal Annul Peter Teertstra, M. Mchael Yvanvch, J. Rchard Culham Mcrelectrncs Heat Transfer Labratry Department f Mechancal Engneerng Unversty f Waterl Waterl, Ontar,
More informationThe soft-margin support vector machine. Nuno Vasconcelos ECE Department, UCSD
he sft-margn supprt vectr machne Nun Vascncels EE Department USD lassfcatn a classfcatn prlem has t tpes f varales e.g. X - vectr f servatns features n the rld Y - state class f the rld X R fever ld pressure
More informationA New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation
III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.
More informationDrought Modelling based on Artificial Intelligence and Neural Network Algorithms: A case study in Queensland, Australia
Drught Mdellng based n Artfcal Intellgence and Neural Netwrk Algrthms: A case study n Queensland Australa Kavna S Dayal (PhD Canddate) Ravnesh C De Armand A Apan Unversty f Suthern Queensland Australa
More informationNUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION
NUROP Chinese Pinyin T Chinese Character Cnversin NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION CHIA LI SHI 1 AND LUA KIM TENG 2 Schl f Cmputing, Natinal University f Singapre 3 Science
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationCS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007
CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is
More informationLab #3: Pendulum Period and Proportionalities
Physics 144 Chwdary Hw Things Wrk Spring 2006 Name: Partners Name(s): Intrductin Lab #3: Pendulum Perid and Prprtinalities Smetimes, it is useful t knw the dependence f ne quantity n anther, like hw the
More informationLearn more at
Tensn and Expansn Analyss f Ppe-n-Ppe Rsers: Part A, Theretcal rmulatn Kevn Chuanjan Man, Bn Yue, Adam Szucs, Rcky Theth 2H ffshre nc. Hustn, TX, USA ABSTRACT Ths paper prvdes a mathematcal mdel fr accurate
More informationThe APS Transfer Line from Linac to Injector Synchrotron.
-------------..., The submtted mclnu;..crpt has been authred by a cntractr f the U. S. Gvernment under cntract N. W 31 19-ENG 38. Accrdngly, the U. S. Gvernment retans a nnexclusve, ryalty-free lcense
More informationREADING STATECHART DIAGRAMS
READING STATECHART DIAGRAMS Figure 4.48 A Statechart diagram with events The diagram in Figure 4.48 shws all states that the bject plane can be in during the curse f its life. Furthermre, it shws the pssible
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationBootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >
Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);
More informationMath Foundations 10 Work Plan
Math Fundatins 10 Wrk Plan Units / Tpics 10.1 Demnstrate understanding f factrs f whle numbers by: Prime factrs Greatest Cmmn Factrs (GCF) Least Cmmn Multiple (LCM) Principal square rt Cube rt Time Frame
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCurseWare http://cw.mit.edu 2.161 Signal Prcessing: Cntinuus and Discrete Fall 2008 Fr infrmatin abut citing these materials r ur Terms f Use, visit: http://cw.mit.edu/terms. Massachusetts Institute
More informationNOTE ON APPELL POLYNOMIALS
NOTE ON APPELL POLYNOMIALS I. M. SHEFFER An interesting characterizatin f Appell plynmials by means f a Stieltjes integral has recently been given by Thrne. 1 We prpse t give a secnd such representatin,
More informationFaculty of Engineering
Faculty f Engneerng DEPARTMENT f ELECTRICAL AND ELECTRONIC ENGINEERING EEE 223 Crcut Thery I Instructrs: M. K. Uygurğlu E. Erdl Fnal EXAMINATION June 20, 2003 Duratn : 120 mnutes Number f Prblems: 6 Gd
More informationOn quantum network coding
JOURNAL OF MATHEMATICAL PHYSICS 52, 03220 (20) On quantum netwrk cdng Avnash Jan,,a) Massm Franceschett,,b) and Davd A Meyer 2,c) Department f Electrcal and Cmputer Engneerng, Unversty f Calfrna, San Deg,
More informationAP Statistics Notes Unit Two: The Normal Distributions
AP Statistics Ntes Unit Tw: The Nrmal Distributins Syllabus Objectives: 1.5 The student will summarize distributins f data measuring the psitin using quartiles, percentiles, and standardized scres (z-scres).
More informationLesson Plan. Recode: They will do a graphic organizer to sequence the steps of scientific method.
Lessn Plan Reach: Ask the students if they ever ppped a bag f micrwave ppcrn and nticed hw many kernels were unppped at the bttm f the bag which made yu wnder if ther brands pp better than the ne yu are
More informationActivity Guide Loops and Random Numbers
Unit 3 Lessn 7 Name(s) Perid Date Activity Guide Lps and Randm Numbers CS Cntent Lps are a relatively straightfrward idea in prgramming - yu want a certain chunk f cde t run repeatedly - but it takes a
More informationPattern Recognition 2014 Support Vector Machines
Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft
More informationInternal vs. external validity. External validity. This section is based on Stock and Watson s Chapter 9.
Sectin 7 Mdel Assessment This sectin is based n Stck and Watsn s Chapter 9. Internal vs. external validity Internal validity refers t whether the analysis is valid fr the ppulatin and sample being studied.
More informationAristotle I PHIL301 Prof. Oakes Winthrop University updated: 3/14/14 8:48 AM
Aristtle I PHIL301 Prf. Oakes Winthrp University updated: 3/14/14 8:48 AM The Categries - The Categries is ne f several imprtant wrks by Aristtle n metaphysics. His tpic here is the classificatin f beings
More informationThe Support Vector Machine
he Supprt Vectr Machne Nun Vascncels (Ken Kreutz-Delgad) UC San Deg Gemetrc Interpretatn Summarzng, the lnear dscrmnant decsn rule 0 f g> ( ) > 0 h*( ) = 1 f g ( ) < 0 has the fllng prpertes th It dvdes
More informationModule B3. VLoad = = V S V LN
Mdule B Prblem The -hase lads are cnnected n arallel. One s a urely resste lad cnnected n wye. t cnsumes 00kW. The secnd s a urely nducte 00kR lad cnnected n wye. The thrd s a urely caacte 00kR lad cnnected
More information