ON SEMANTIC CONCEPT SIMILARITY METHODS
|
|
- Anabel Ford
- 5 years ago
- Views:
Transcription
1 4 ON SEMANTIC CONCEPT SIMILARITY METHODS Lu Yang*, Vinda Bhavsa* and Haold Boly** *Faculty of Comput Scinc, Univsity of Nw Bunswick Fdicton, NB, E3B 5A3, Canada **Institut fo Infomation Tchnology, National Rsach Council Canada, Fdicton, NB, E3B 9W4, Canada {lyang, bhavsa} AT unb.ca, haold.boly AT nc.gc.ca ABSTRACT Smantic matching is impotant in sach aas including databass, -Businss, cas-basd asoning (CBR), infomation tival, infomation intgation, wb svics and natual languag pocssing. In paticula, smantic concpt matching using taxonomis is an impotant tchniqu in ths aas. W psnt a suvy of smantic concpt similaity algoithms that can b usd fo concpt matching in taxonomis. W also popos a nw appoach that povids a fin concpt ganulaity masu. Kywods: smantic matching, concpt similaity, taxonomy, dpth scaling, shotst path lngth, infomation contnt. INTRODUCTION Syntactic matching algoithms match stings without considing any domain knowldg. Howv, th smantics of wods/stings vay basd on thi contxts. Fo xampl, th stings woodn chai and committ chai us th sam wod chai but it has totally diffnt smantics. Syntactic matching cannot distinguish such smantic diffncs and may lad to inaccuat o vn wong matchs in documnt tival, quy pocssing systms, and infomation intgation systms. Thfo, smantic matching tchniqus, such as schma matching and concpt matching in a taxonomy/ontology a quid. This pap focuss on concpt matching algoithms fo taxonomis. A taxonomy stuctus a body of knowldg into classs (concpts) and dfins lationships among thm, usually th subsumption (subclass-of) lationship []. A taxonomy is oftn psntd as a t o a dictd acyclic gaph (DAG). Each nod in a taxonomy t (DAG) is a concpt that might hav supconcpts and subconcpts. Concpt similaity algoithms that aim to match concpts in a taxonomy can b dividd into two catgois: (a) th dg-basd appoachs that consid th shotst path lngth [2] btwn two concpts, and (b) th nod-basd appoachs that mak us of th nod infomation contnt [3]. Combinations of ths two appoachs hav sultd in btt matchs, fo xampl th wok potd in [4] [5]. Enhancmnts to th two basic appoachs tak into account vaious factos such as link typs, link stngths, dg wights [6] [7], local dnsitis [5] and nod dpths [4]. W impov on th pvious dpth scaling mthods by a fin ganulaity similaity masu of two concpts. W dfin th concpt similaity in a taxonomy as follows. Dfinition. Givn a taxonomy T and a st C that contains all of th concpts in T, th similaity sim(c, c 2 ) of two concpts c C and c 2 C is a mapping sim: C [0.0,.0] (al intval). Although th a sval possibl link typs in a taxonomy, such as subclass-of/subsums, patof/has-pat, typ-of/has-typ, and instanc of/has instanc, th subclass-of lationship is th most impotant on among thm. This is th ason why many sachs pay mo attntion to th taxonomy that only has th subclass-of typ of links. To mak xpimntal sults compaabl, many of th sachs us WodNt [8] as thi smantic knowldg bas. WodNt is th poduct of a sach pojct at Pincton Univsity which has attmptd to modl th lxical knowldg of a nativ spak of English. Th infomation in WodNt is oganizd aound logical goupings calld synsts. Each synst consists of synonymous wod foms and smantic points that dscib lationships btwn th cunt synst and oth synsts.
2 On Smantic Concpt Similaity Mthods - Vinda Bhavsa 5 Sinc th distancs btwn abitay pais of adjacnt concpts a not ncssaily qual, dgwight assignmnt algoithms hav bn poposd to val th association dg of pant-child concpts [4] [6]. Sction 2 psnts pvious concpt similaity algoithms using taxonomis. Th dg-wight assignmnt is discussd in Sction 3. W psnt ou impovmnt on th lativ-dpth scaling in Sction 4. Finally, w giv th conclusion in Sction CONCEPT SIMILARITY ALGORITHMS Th smantic similaity of a pai of concpts in a taxonomy is computd considing th path lngths, dg wights, nod infomation contnts, and link typs. Th dg-basd appoachs a basd on th shotst path lngth of two concpts. Th nodbasd appoachs xplo th infomation contnt of nods to comput th concpt similaity. Th dgs in a taxonomy might hav abitay wights du to vaious factos such as thi local dnsitis, link typs, nod dpths, and link stngths. Ths two appoachs a bifly viwd in subsctions 2. and 2.2. A tchniqu by Li [5] that combins th two appoachs is dscibd in subsction Edg-Basd Appoachs Edg counting is an intuitiv and natual way to masu th smantic similaity of nods which cospond to concpts in a taxonomy. Th shot th path lngth btwn thm, th mo simila thy a. Fo a taxonomy fo biomdical domain, Rada t al. [2] poposd that th concpt distanc btwn nods is a mtic which satisfis th zo popty, symmty popty, and tiangl inquality. Th concpt distanc is calculatd by counting th minimum numb of dgs spaating two concpts. It is fomally dfind as follows: Distanc (A, B) = minimum numb of dgs spaating a and b () wh A and B a two concpts psntd by th nods a and b in an is-a smantic nt. Th similaity masu intoducd by Lacok and Chodoow [9] nomalizs th shotst path lngth of two concpts by th maximum dpth in th taxonomy. lngth sim( c, c2) log 2 D In quation (2), lngth psnts th shotst path lngth btwn two concpts and D stands fo th maximum dpth of th taxonomy. Not that in this algoithm pais of concpts hav th sam similaity valu as long as thi shotst path lngths a idntical. Wu and Palm [0] dtmin th concpt similaity by th stuctual lation of two concpts and thi last common subsum (LCS): 2 N3 sim( c, c2) N N2 2 N3 Figu illustats th symbols of quation (3) [0]. H c 3 is th LCS of c and c 2. N and N 2 psnt th numbs of nods on th path fom c to c 3 and c 2 to c 3, spctivly. N 3 is th numb of nods on th path fom c 3 to th taxonomy oot. Accoding to quation (3) and Figu, th similaity of c and c 2 bcoms small and small whn c and c 2 a dp and dp. This implis that fo a st of concpts that sha th sam LCS, th mo spcific (i.. d th two concpts in th taxonomy, th lss thi similaity is. N 3 R o o t c 3 N N 2 c c 2 Figu. Stuctual lation of concpts [0] (2) (3) Th abov mntiond th appoachs do not diffntiat th dg wights in a taxonomy. Th oth two appoachs givn in [4] [6], which a also basd on th shotst path, povid dgwight assignmnt statgis and sum up th wights on th shotst path to obtain th similaity/distanc. Two tchniqus fo wight assignmnt a discussd in Sction 3. Th dg-basd appoachs assum that th links in a taxonomy psnt unifom distancs [3] []. Howv, it is common that a link may hav much dns sub-taxonomis than oth pats of th
3 6 4 th Intnational Confnc Infomation & Communication Tchnology and Systm taxonomy. An impovmnt that taks into account this possibility is illustatd in th nxt subsction Nod-Basd Appoachs Th ida nod infomation contnt poposd by Rsnik [3] [2] foms th basis of many nod-basd concpt similaity algoithms. Rsnik [3] poposd that th concpt similaity is th xtnt to which concpts sha infomation in common. Th common infomation of two concpts is caid by thi supconcpts subsuming both of thm. Each concpt in a taxonomy is associatd with a pobability p(c) which fs to th pobability of ncounting an instanc of concpt c. Th pobability is quantifid by th ngativ logaithm, -log p(c). Obviously, th high a concpt in a taxonomy, th high its pobability valu is. Th quantifid infomation contnt dcass as th pobability incass. Thus, th mo abstact a concpt in a taxonomy, th lss its infomativnss is. Th similaity of two concpts is dfind in th following quation [3]: sim( c, c2) max [ logp( c)] c S( c, c ) 2 wh S(c, c 2 ) is th st of concpts that subsum both c and c 2. Accoding to quation (4), fo a pai of concpts that may hav multipl subsums, w slct th on having th highst infomation contnt as thi similaity. In this abov appoach, any pais of concpts hav an idntical similaity valu as long as thy hav th sam last common subsum. This appoach also ovlooks th stuctu infomation of taxonomis and thus sultd in coas similaity valus as suggstd by Maguitman t al. [3]. Lin has poposd a similaity masu simila to Rsnik s masu [4]. This appoach assums that two concpts a indpndnt and uss th sum of thi infomation contnt (IC) is usd to nomaliz th infomation contnt of thi last common subsum. Th following quation givs th fomal dfinition of similaity: 2 ( ), 2 ) IC LCS sim( c c IC( c ) IC( c2 ) (4) (5) wh IC is th infomation contnt of a concpt. Equation (5) has th sam implication as quation (3): fo a givn concpt c that is th LCS of concpts c and c 2, th bigg th valus of IC(c ) and IC(c 2 ), th dp thy a in a taxonomy, and thus th small thi similaity is. Th mthod psntd by Jian and Conath [4] uss a combination of th dg-basd and nodbasd appoachs considing local dnsity, nod dpth, infomation contnt and link typ. Th mthod can b simplifid as a nod-basd appoach whn oth factos a ovlookd xcpt th infomation contnt. Th simplifid similaity masu is dtmind as sim( c, c2 ) IC( c ) IC( c2 ) 2 IC( LCS) 2.3. Combination of Edg-Basd and Nod- Basd Appoachs Th concpt similaity algoithm that has a btt pfomanc is poposd by Li t al. [5]. Th ida of this algoithm is that concpts at upp lays of th taxonomy hav mo gnal smantics and lss similaity btwn thm, whil concpts at low lays hav mo conct smantics and high similaity. Thus, th dpth of th concpts is takn into account fo th concpt similaity computation. This ida contadicts with th idas of [0] and [4]. Li t al. [5] also agud that th pvious algoithms ith dictly us infomation soucs as a function of similaity o us a paticula infomation souc without considing th contibution of oths. Li t al. [5] poposd th non-lina (viz. xponntial) functions to tansfom th possibl infinit infomation soucs (.g. infinit dpth and path lngth) to a valu within [0, ]. Although this algoithm tnds to match wods containd in synsts in th WodNt, th following similaity masu can b usd fo concpt matching: sim ( c, c2 ) f ( f ( l), f2 ( h), f3 ( d )) wh f (l), f 2 (h) and f 3 (d) a th functions of th shotst path lngth l, th dpth of th last common subsum h, and th local dnsity d of c and c 2, spctivly. Ths th functions a dfind as f ( l) l wh α > 0. h h f2 ( h) h h (6) (7) (8) (9)
4 On Smantic Concpt Similaity Mthods - Vinda Bhavsa 7 wh β > 0 is a smoothing facto and whn β appoachs infinity, th dpth of th concpts is not considd. d d f3 ( d) d d wh d is th similaity of two concpts computd by th algoithm of [3] and λ > 0 and whn λ appoachs infinity, th infomation contnt of th concpts is not considd. Li t al. [5] xpimntd with vy combination of th abov th functions quations (8)-(0), and pvious dg-basd as wll as nodbasd appoachs and concludd that th following combination obtains th bst sults: h h f f l f h l ( ) 2 ( ) h h (0) () This confimd th assumption of Li t al. [5] that human similaity judgmnt is a typ of nonlina pocss ov infomation soucs. Mill and Chals [8] gav 30 pais of wods to 38 human subjcts to ank thi similaity valus anging fom 0 to 4. Oth sachs [5] compad th xpimntal sults of thi algoithms with Mill-Chals s human-basd xpimnt to valuat thi algoithm pfomanc. Th high th colation valu btwn thm, th btt th pfomanc is. In Tabl, w giv an nhancd summay of th pfomanc of th algoithms in litatu ov th on givn in [5]. Tabl. Expimntal sults of th concpt similaity algoithms Similaity Algoithm Colation Rsnik plication to Mill Chals [2] Combination of dg- and nodbasd and consids concpt dpth and non-lina tansfomation [5] Combination of dg- and nodbasd and consids dpth, local dnsity, tc. [4] Nod-basd appoach [4] built on [3] Nod-basd infomation contnt [3] Edg-basd shotst path lngth [2] 3. EDGE-WEIGHT ASSIGNMENT IN A TAXONOMY Addition of wights to th dgs in a taxonomy can impov th pfomanc of th concpt similaity masus. This is appoach poposd by [4] lads to high colation valus than th sults obtaind with [2] [3] [4] appoachs that do not us dg wights. Jiang and Conath [4] concludd that th factos that affct th dg-wight assignmnt a: th local ntwok dnsity, nod (concpt) dpth, link typs and link stngth. Thy considd all of th fou factos fo th dg-wight assignmnt. Sussna [6] considd th fist th factos. Richadson and Smaton [7] took into account th fist two and th last factos. Howv, thy did not fomally dfin a wight-assignmnt fomula. Jiang and Conath suggstd th following wight assignmnt fomula [4]: E d( wt( c, ( ) [ IC( c) IC( ] T( c, E( d( wh, (2) wt(c, : wight of th dg conncting concpt c and its pant nod p E(: numb of dgs in th child links (i.. local dnsity) E : avag dnsity in th whol taxonomy IC(c)- IC(: link stngth of th dg btwn c and p T(c, : th link typ facto. In th abov quation, paamts α (α 0) and β (0 β ) contol th dg of how much th nod dpth and dnsity factos contibut to th dg wighting computation. Th distanc of two concpts is calculatd by summing up th wights on th shotst path btwn thm. Sussna [6] has concns that ach link in a taxonomy has two invs lations. Fo xampl, a link conncting vhicl and ca psnts both th is-a and has-a lations. Diffnt link typs hav thi own wight angs psntd by max and min. Th local dnsity which is psntd as th typ-spcific fanout facto is th numb of dgs laving a nod with th sam typ. Th sum of th two invs wights a avagd and thn
5 8 4 th Intnational Confnc Infomation & Communication Tchnology and Systm dividd by th high dpth of th two concpts as statd blow: w( c w( c, c ) givn 2 w( x wh c ) w( c 2 2d 2 ' max min y) max n ( x) c ) w(c, c 2 ): wight of th dg conncting concpts c and c 2 : a lation of typ ' : an invs lation of d: dpth of th dp concpt max : maximum wight fo th lation with typ min : minimum wight fo th lation with typ n (x): numb of lations with typ laving nod x. (3) (4) sha th sam LCS d. Thfo, th dpth of d maks th sam contibution to th similaity computation of (a, b) and (a, c). Howv, it is obvious that b which has th sam dpth as a is high than c and thus has mo gnal infomation. W agu that, in th contxt of th subt ootd at d (LCS), a and b hav high similaity valu than that of a and c fom th point of viw of dpth bcaus a and b hav th sam ganulaity. W impov th lativ-dpth scaling by not only considing th contxt of th sub (s bold lins in Figu 3) ootd at th last common subsum of two concpts, but also by using th upwad and downwad path lngth of ach concpt. (Th following discussion dos not consid th cas of two idntical concpts bcaus thy obviously hav similaity.0.) LC a b Th abov mthod also sums up th wights on th shotst path btwn two concpts to obtain thi latdnss. d c 4. IMPROVED CONCEPT DEPTH SCALING Pvious coas-gaind dpth-scaling mthods sult in concpt similaity that dos not flct diffnc in th ganulaity of concpts. Fo xampl, in quation (2) givn by [9] simply uss th maximum dpth of a taxonomy to nomaliz th shotst path lngth btwn concpts and in quation (3) givn in [6] psnts th lativdpth scaling by dividing th dpth of a dp concpt. a d Figu 2. Concpts that hav diffnt ganulaitis Th xponntial function was mployd in [5] to non-linaly tansfom th dpth of th last common subsum of two concpts. Howv, it dos not diffntiat th vaious cass that pais of concpts sha th sam LCS. Fo xampl, in Figu 2, th two pais of concpts (a, b) and (a, c) b c Figu 3. A taxonomy t Fo any pai of concpts c and c 2, w consid thi ganulaity diffnc in thi most spcific contxt, i.. th subt ootd at thi last common subsum LCS. In Figu 3, although concpts a and b a on th sam lvl blow LCS, a has a dp subt than b. This indicats that a is mo gnal than b in thi most spcific contxt. Thfo, w masu th ganulaity of ach concpt basd on its upwad and downwad path lngths. A concpt s upwad path lngth is th numb of dgs on th path fom th concpt to LCS. Its downwad path lngth is th numb of dgs on th path fom th concpt to th dpst laf nod blow. Fo xampl, th upwad and downwad path lngths fo concpt a a and 3, spctivly. Fomally, w dfin th lativ dpth of a concpt as follows: RlativDpth(c) = UpLngth( c) DownLngth ( c) UpLngth( c) DownLngth ( c) wh, f (5)
6 On Smantic Concpt Similaity Mthods - Vinda Bhavsa 9 RlativDpth(c): lativ dpth of concpt c UpLngth(c): numb of dgs fom c to LCS DownLngth(c): numb of dgs fom c to th dpst laf nod blow c Accoding to quation (5), th lativ dpth of a concpt can b a ngativ valu. Fo th spcial cass that a concpt is th sam as LCS, th dpst laf nod, and in th middl of th path, spctivly, w cospondingly gt lativ dpth valus -,, and 0. Thfo, a concpt s lativ dpth angs btwn - and. W linaly map th lativ dpth of a concpt to its ganulaity (within [0, ]) dscibd in quation (6). Ganulaity(c) = (/2)(RlativDpth(c) + ) (6) Fom th plot (s Figu 4) of quation (6), th Ganulaity monotonically incass with th Concpt Pais Eq (7) Objct- 8 Distibutd P Ointd P RlativDpth. Th high th ganulaity valu of a concpt, th dp it is in th t and th mo spcific infomation it cais. Th absolut diffnc Ganulaity(c ) - Ganulaity(c 2 ) of two concpts c and c 2 is usd to contibut to th similaity computation of thm. Figu 4. Plot of quation (6) Eq (7) No Wight P Tchniqus Automatic P P Tchniqus Concunt P P Tchniqus Distibutd P Automatic P 5 Concunt P Objct- Ointd P Objct- Ointd P Concunt P Distibutd P Distibutd P Paalll P (-,) Ganulaity (0, ) (0, /2) (0, 0) (, ) (,) RlativDpth Ns Sim( c, c2) ( )* Av* N Gnal 0.5 Applicativ Pogamming t Pogamming Tchniqus Automatic Squntial Pogamming Pogamming Distibutd Pogamming Ganulait y( c ) Ganulait y( c2 ) Concunt Objct-Ointd Pogamming Pogamming Paalll Pogamming Figu 5. Taxonomy t of Pogamming Tchniqus (7) In quation (7), N s is th numb of dgs on th shotst path btwn c and c 2. N t stands fo th total numb of dgs in th taxonomy. Av stands fo th avagd dg wights on th shotst path. W boow th non-lina tansfomation, i.. th xponntial fundtion, of [5] to comput th ganulaity similaity of c and c 2. Tabl 2 shows th similaity valus of vaious pais of concpts in th taxonomy of Figu 5 using quation (7) with and without wights. Tabl 2. Computational sults fo vaious pais of nods in th taxonomy t of Figu 5 In od to sav spac in th abov tabl, w us P to psnt Pogamming. W show 8 pais of psntativ concpts in Figu 5 and thi similaity valus. Th column Eq (7) givs th similaity valus using quation (7) taking into account th dg wights. Th last column contains th sults using quation (7) without considing th dg wights (i.. ach dg has wight.0). In this way, w can claly show th impact of concpt ganulaitis. H, w analyz th xpimntal sults basd on th last column, Equation (7) No Wight. Th fist th pais of concpts xpimnt on th similaity valus of th oot concpt, Pogamming Tchniqus, vsus oth concpts on diffnt lvls. Although th concpts Automatic Pogamming and Concunt Pogamming a
7 0 4 th Intnational Confnc Infomation & Communication Tchnology and Systm on th sam lvl, w obtain sim (Pogamming Tchniqus, Automatic Pogamming) = 0.32 which is small than sim (Pogamming Tchniqus, Concunt Pogamming) = Th ason is that Concunt Pogamming still has subts which indicat that it is mo gnal than th laf-nod concpt Automatic Pogamming in th contxt of thi LCS Pogamming Tchniqus. Th similaity of Pogamming Tchniqus and Distibutd Pogamming is small than both of thm bcaus thy hav long path lngth. Concpts of pai no. hav th sam similaity valu as pai no.6 bcaus, in ach of ths two pais, on concpt is th pant of th oth on which is a laf nod. Concpts of pai no.4 hav high similaity valu than that of pai no.5 although all th concpts in thm a on th sam lvl. Th ason is that concpts of pai no.4 hav idntical ganulaity valu and no.5 concpts hav diffnt on. No.4 concpts also hav idntical similaity valu as no.7 bcaus ach pai contains two sibling laf nods that sha thi pant nod as th last common subsum. 5. CONCLUSION Smantic matching tchniqus, such as taxonomic concpt matching masus and schma matching algoithms can mov th ambiguitis sulting fom using th syntactic matching algoithms to som xtnt. Rlatd concpts can b locatd in a taxonomy which indicats th hiachical lationships of thm. Using a taxonomy (.g., WodNt) as a knowldg bas, taxonomic concpt similaity/distanc masus hav bn poposd. Edg-basd and nod-basd appoachs povid th foundation of vaious algoithms in litatu. Th combinations of ths appoachs hav povidd btt matching sults. Futhmo, th human judgmnt of infomation soucs was dmonstatd to b a non-lina pocss towad thi similaity. Among th sval stuctual chaactistics (i.. shotst path, local dnsity, link typ, link stngth, and nod dpth) having impact on th concpt similaity, th combination of th non-lina tansfomations of th shotst path lngth and concpt dpth obtains th bst colation valu against human ankings on wod similaity. Howv, pvious dpth scaling algoithms only took into account th absolut dpth of two concpts and thi last common subsum. W hav poposd a nw lativ-dpth scaling mthod to compa th diffnc of concpt ganulaitis in th most spcific contxt (which is th subt ootd at thi last common subsum). W hav obtaind mo asonabl computational sults fo th an illustativ taxonomy. Rfncs [] Institut of Elctical and Elctonics Engins. IEEE Standad Comput Dictionay: A Compilation of IEEE Standad Comput Glossais. Nw Yok, NY, 990. [2] R. Rada, H. Mili, E. Bicknll, and M. Blttn. Dvlopmnt and Application of a Mtic on Smantic Nts. IEEE Tansactions on Syst., Man, and Cybntics, 989, 9():7-30. [3] P. Rsnik. Using Infomation Contnt to Evaluat Smantic Similaity in a Taxonomy. Pocdings of th 4th Intnational Joint Confnc on Atificial Intllignc, Montal, August 995, : [4] J. J. Jiang and D. W. Conath. Smantic Similaity Basd on Copus Statistics and Lxical Taxonomy. Pocdings of Intnational Confnc Rsach on Computational Linguistics (ROCLING X), Taiwan, 997. [5] Y. Li, Z. A. Banda, and D. McLan. An Appoach fo Masuing Smantic Similaity btwn Wods Using Multipl Infomation Soucs. IEEE Tansactions on Knowldg and Data Engining, 2003, 5(4): [6] M. Sussna. Wod Sns Disambiguation fo F-txt Indxing Using a Massiv Smantic Ntwok. Pocdings of th Scond Intnational confnc on Infomation and Knowldg Managmnt, Alington, VA, 993. [7] R. Richadson, and A. F. Smaton. Using WodNt in a Knowldg-Basd Appoach to Infomation Rtival. Woking Pap, CA-0395, School of Comput Applications, Dublin City Univsity, Iland, 995. [8] G. Mill. Nouns in WodNt: A Lxical Inhitanc Systm. Intnational Jounal of Lxicogaphy, 990, 3(4): [9] C. Lacock and M. Chodoow. Combining Local contxt and WodNt Sns Similaity fo
8 On Smantic Concpt Similaity Mthods - Vinda Bhavsa Wod Sns Disambiguation. In WodNt, An Elctonic Lxical Databas. Th MIT Pss, 998. [0] Z. Wu and M. Palm. Vb Smantics and Lxical Slction. Pocdings of th 32nd Annual Mting of th Associations fo Computational Linguistics, Las Cucs, NM, 994, [] C. Coly and R. Mihalca. Masuing th Smantic Similaity of Txts. Pocdings of th ACL Wokshop on Empiical Modling of Smantic Equivalnc and Entailmnt, Ann Abo, Jun 2005, 3-8. [2] P.Rsnik. Smantic Similaity in a Taxonomy: An Infomation-Basd Masu and its Application to Poblms of Ambiguity in Natual Languag. Jounal of Atificial Intllignc Rsach, 999, : [3] A. G. Maguitman, F. Mncz, H. Roinstad and A. Vspingnan. Algoithmic Dtction of Smantic Similaity. Pocdings of WWW 2005, Chiba, Japan, May 0-4, [4] D. Lin. An Infomation-Thotical Dfinition of Similaity. Pocdings of th Fifth Intnational Confnc on Machin Laning, Mogan Kaufmann Publishs Inc., 998,
Study on the Classification and Stability of Industry-University- Research Symbiosis Phenomenon: Based on the Logistic Model
Jounal of Emging Tnds in Economics and Managmnt Scincs (JETEMS 3 (1: 116-1 Scholalink sach Institut Jounals, 1 (ISS: 141-74 Jounal jtms.scholalinksach.og of Emging Tnds Economics and Managmnt Scincs (JETEMS
More informationExtinction Ratio and Power Penalty
Application Not: HFAN-.. Rv.; 4/8 Extinction Ratio and ow nalty AVALABLE Backgound Extinction atio is an impotant paamt includd in th spcifications of most fib-optic tanscivs. h pupos of this application
More informationE F. and H v. or A r and F r are dual of each other.
A Duality Thom: Consid th following quations as an xampl = A = F μ ε H A E A = jωa j ωμε A + β A = μ J μ A x y, z = J, y, z 4π E F ( A = jω F j ( F j β H F ωμε F + β F = ε M jβ ε F x, y, z = M, y, z 4π
More informationOverview. 1 Recall: continuous-time Markov chains. 2 Transient distribution. 3 Uniformization. 4 Strong and weak bisimulation
Rcall: continuous-tim Makov chains Modling and Vification of Pobabilistic Systms Joost-Pit Katon Lhstuhl fü Infomatik 2 Softwa Modling and Vification Goup http://movs.wth-aachn.d/taching/ws-89/movp8/ Dcmb
More informationCOMPSCI 230 Discrete Math Trees March 21, / 22
COMPSCI 230 Dict Math Mach 21, 2017 COMPSCI 230 Dict Math Mach 21, 2017 1 / 22 Ovviw 1 A Simpl Splling Chck Nomnclatu 2 aval Od Dpth-it aval Od Badth-it aval Od COMPSCI 230 Dict Math Mach 21, 2017 2 /
More informationCombining Subword and State-level Dissimilarity Measures for Improved Spoken Term Detection in NTCIR-11 SpokenQuery&Doc Task
Combining Subwod and Stat-lvl Dissimilaity Masus fo Impovd Spokn Tm Dtction in NTCIR-11 SpoknQuy&Doc Task ABSTRACT Mitsuaki Makino Shizuoka Univsity 3-5-1 Johoku, Hamamatsu-shi, Shizuoka 432-8561, Japan
More informationHydrogen atom. Energy levels and wave functions Orbital momentum, electron spin and nuclear spin Fine and hyperfine interaction Hydrogen orbitals
Hydogn atom Engy lvls and wav functions Obital momntum, lcton spin and nucla spin Fin and hypfin intaction Hydogn obitals Hydogn atom A finmnt of th Rydbg constant: R ~ 109 737.3156841 cm -1 A hydogn mas
More information8 - GRAVITATION Page 1
8 GAVITATION Pag 1 Intoduction Ptolmy, in scond cntuy, gav gocntic thoy of plantay motion in which th Eath is considd stationay at th cnt of th univs and all th stas and th plants including th Sun volving
More informationGAUSS PLANETARY EQUATIONS IN A NON-SINGULAR GRAVITATIONAL POTENTIAL
GAUSS PLANETARY EQUATIONS IN A NON-SINGULAR GRAVITATIONAL POTENTIAL Ioannis Iaklis Haanas * and Michal Hany# * Dpatmnt of Physics and Astonomy, Yok Univsity 34 A Pti Scinc Building Noth Yok, Ontaio, M3J-P3,
More informationA STUDY OF PROPERTIES OF SOFT SET AND ITS APPLICATIONS
Intnational sach Jounal of Engining and Tchnology IJET -ISSN: 2395-0056 Volum: 05 Issu: 01 Jan-2018 wwwijtnt p-issn: 2395-0072 STDY O POPETIES O SOT SET ND ITS PPLITIONS Shamshad usain 1 Km Shivani 2 1MPhil
More informationGRAVITATION. (d) If a spring balance having frequency f is taken on moon (having g = g / 6) it will have a frequency of (a) 6f (b) f / 6
GVITTION 1. Two satllits and o ound a plant P in cicula obits havin adii 4 and spctivly. If th spd of th satllit is V, th spd of th satllit will b 1 V 6 V 4V V. Th scap vlocity on th sufac of th ath is
More informationSUPPLEMENTARY INFORMATION
SUPPLMNTARY INFORMATION. Dtmin th gat inducd bgap cai concntation. Th fild inducd bgap cai concntation in bilay gaphn a indpndntly vaid by contolling th both th top bottom displacmnt lctical filds D t
More informationThe angle between L and the z-axis is found from
Poblm 6 This is not a ifficult poblm but it is a al pain to tansf it fom pap into Mathca I won't giv it to you on th quiz, but know how to o it fo th xam Poblm 6 S Figu 6 Th magnitu of L is L an th z-componnt
More informationPhysics 111. Lecture 38 (Walker: ) Phase Change Latent Heat. May 6, The Three Basic Phases of Matter. Solid Liquid Gas
Physics 111 Lctu 38 (Walk: 17.4-5) Phas Chang May 6, 2009 Lctu 38 1/26 Th Th Basic Phass of Matt Solid Liquid Gas Squnc of incasing molcul motion (and ngy) Lctu 38 2/26 If a liquid is put into a sald contain
More informationFREQUENCY DETECTION METHOD BASED ON RECURSIVE DFT ALGORITHM
FREQUECY DETECTIO METHOD BAED O RECURIE ALGORITHM Katsuyasu akano*, Yutaka Ota*, Hioyuki Ukai*, Koichi akamua*, and Hidki Fujita** *Dpt. of ystms Managmnt and Engining, agoya Institut of Tchnology, Gokiso-cho,
More information(, ) which is a positively sloping curve showing (Y,r) for which the money market is in equilibrium. The P = (1.4)
ots lctu Th IS/LM modl fo an opn conomy is basd on a fixd pic lvl (vy sticky pics) and consists of a goods makt and a mony makt. Th goods makt is Y C+ I + G+ X εq (.) E SEK wh ε = is th al xchang at, E
More informationThe theory of electromagnetic field motion. 6. Electron
Th thoy of lctomagntic fild motion. 6. Elcton L.N. Voytshovich Th aticl shows that in a otating fam of fnc th magntic dipol has an lctic chag with th valu dpnding on th dipol magntic momnt and otational
More informationarxiv: v1 [cond-mat.stat-mech] 27 Aug 2015
Random matix nsmbls with column/ow constaints. II uchtana adhukhan and Pagya hukla Dpatmnt of Physics, Indian Institut of Tchnology, Khaagpu, India axiv:58.6695v [cond-mat.stat-mch] 7 Aug 5 (Datd: Octob,
More informationCBSE-XII-2013 EXAMINATION (MATHEMATICS) The value of determinant of skew symmetric matrix of odd order is always equal to zero.
CBSE-XII- EXAMINATION (MATHEMATICS) Cod : 6/ Gnal Instuctions : (i) All qustions a compulso. (ii) Th qustion pap consists of 9 qustions dividd into th sctions A, B and C. Sction A compiss of qustions of
More informationAn Elementary Approach to a Model Problem of Lagerstrom
An Elmntay Appoach to a Modl Poblm of Lagstom S. P. Hastings and J. B. McLod Mach 7, 8 Abstact Th quation studid is u + n u + u u = ; with bounday conditions u () = ; u () =. This modl quation has bn studid
More informationSTATISTICAL MECHANICS OF DIATOMIC GASES
Pof. D. I. ass Phys54 7 -Ma-8 Diatomic_Gas (Ashly H. Cat chapt 5) SAISICAL MECHAICS OF DIAOMIC GASES - Fo monatomic gas whos molculs hav th dgs of fdom of tanslatoy motion th intnal u 3 ngy and th spcific
More informationTheoretical Extension and Experimental Verification of a Frequency-Domain Recursive Approach to Ultrasonic Waves in Multilayered Media
ECNDT 006 - Post 99 Thotical Extnsion and Expimntal Vification of a Fquncy-Domain Rcusiv Appoach to Ultasonic Wavs in Multilayd Mdia Natalya MANN Quality Assuanc and Rliability Tchnion- Isal Institut of
More informationInternational Journal of Industrial Engineering Computations
Intnational Jounal of Industial Engining Computations 5 (4 65 74 Contnts lists availabl at GowingScinc Intnational Jounal of Industial Engining Computations hompag: www.gowingscinc.com/ijic A nw modl fo
More informationGRAVITATION 4) R. max. 2 ..(1) ...(2)
GAVITATION PVIOUS AMCT QUSTIONS NGINING. A body is pojctd vtically upwads fom th sufac of th ath with a vlocity qual to half th scap vlocity. If is th adius of th ath, maximum hight attaind by th body
More informationSolid state physics. Lecture 3: chemical bonding. Prof. Dr. U. Pietsch
Solid stat physics Lctu 3: chmical bonding Pof. D. U. Pitsch Elcton chag dnsity distibution fom -ay diffaction data F kp ik dk h k l i Fi H p H; H hkl V a h k l Elctonic chag dnsity of silicon Valnc chag
More informationFinite Element Analysis of Adhesive Steel Bar in Concrete under Tensile Load
4th Intnational Confnc on Sstainabl Engy and Envionmntal Engining (ICSEEE 2015) Finit Elmnt Analysis of Adhsiv Stl Ba in Conct nd Tnsil Load Jianong Zhang1,a, Ribin Sh2,b and Zixiang Zhao3,c 1,2,3 Tongji
More informationLoss factor for a clamped edge circular plate subjected to an eccentric loading
ndian ounal of Engining & Matials Scincs Vol., Apil 4, pp. 79-84 Loss facto fo a clapd dg cicula plat subjctd to an ccntic loading M K Gupta a & S P Niga b a Mchanical Engining Dpatnt, National nstitut
More informationLecture 3.2: Cosets. Matthew Macauley. Department of Mathematical Sciences Clemson University
Lctu 3.2: Costs Matthw Macauly Dpatmnt o Mathmatical Scincs Clmson Univsity http://www.math.clmson.du/~macaul/ Math 4120, Modn Algba M. Macauly (Clmson) Lctu 3.2: Costs Math 4120, Modn Algba 1 / 11 Ovviw
More informationADDITIVE INTEGRAL FUNCTIONS IN VALUED FIELDS. Ghiocel Groza*, S. M. Ali Khan** 1. Introduction
ADDITIVE INTEGRAL FUNCTIONS IN VALUED FIELDS Ghiocl Goza*, S. M. Ali Khan** Abstact Th additiv intgal functions with th cofficints in a comlt non-achimdan algbaically closd fild of chaactistic 0 a studid.
More informationAakash. For Class XII Studying / Passed Students. Physics, Chemistry & Mathematics
Aakash A UNIQUE PPRTUNITY T HELP YU FULFIL YUR DREAMS Fo Class XII Studying / Passd Studnts Physics, Chmisty & Mathmatics Rgistd ffic: Aakash Tow, 8, Pusa Road, Nw Dlhi-0005. Ph.: (0) 4763456 Fax: (0)
More informationKnowledge Creation with Parallel Teams: Design of Incentives and the Role of Collaboration
Association fo nfomation Systms AS Elctonic Libay (ASL) AMCS 2009 Pocdings Amicas Confnc on nfomation Systms (AMCS) 2009 Knowldg Cation with Paalll Tams: Dsign of ncntivs and th Rol of Collaboation Shanka
More informationInvestigation Effect of Outage Line on the Transmission Line for Karbalaa-132Kv Zone in Iraqi Network
Intnational Rsach Jounal of Engining and Tchnology (IRJET) -ISSN: - Volum: Issu: Jun - www.ijt.nt p-issn: - Invstigation Effct of Outag on th Tansmission fo Kabalaa-Kv Zon in Iaqi Ntwok Rashid H. AL-Rubayi
More informationChapter 4: Algebra and group presentations
Chapt 4: Algba and goup psntations Matthw Macauly Dpatmnt of Mathmatical Scincs Clmson Univsity http://www.math.clmson.du/~macaul/ Math 4120, Sping 2014 M. Macauly (Clmson) Chapt 4: Algba and goup psntations
More information5.61 Fall 2007 Lecture #2 page 1. The DEMISE of CLASSICAL PHYSICS
5.61 Fall 2007 Lctu #2 pag 1 Th DEMISE of CLASSICAL PHYSICS (a) Discovy of th Elcton In 1897 J.J. Thomson discovs th lcton and masus ( m ) (and inadvtntly invnts th cathod ay (TV) tub) Faaday (1860 s 1870
More informationEstimation of a Random Variable
Estimation of a andom Vaiabl Obsv and stimat. ˆ is an stimat of. ζ : outcom Estimation ul ˆ Sampl Spac Eampl: : Pson s Hight, : Wight. : Ailin Company s Stock Pic, : Cud Oil Pic. Cost of Estimation Eo
More informationExtensive Form Games with Incomplete Information. Microeconomics II Signaling. Signaling Examples. Signaling Games
Extnsiv Fom Gams ith Incomplt Inomation Micoconomics II Signaling vnt Koçksn Koç Univsity o impotant classs o xtnsiv o gams ith incomplt inomation Signaling Scning oth a to play gams ith to stags On play
More information217Plus TM Integrated Circuit Failure Rate Models
T h I AC 27Plu s T M i n t g at d c i c u i t a n d i n d u c to Fa i lu at M o d l s David Nicholls, IAC (Quantion Solutions Incoatd) In a pvious issu o th IAC Jounal [nc ], w povidd a highlvl intoduction
More informationElectron spin resonance
Elcton sonanc 00 Rlatd topics Zman ffct, ngy quantum, quantum numb, sonanc, g-facto, Landé facto. Pincipl With lcton sonanc (ESR) spctoscopy compounds having unpaid lctons can b studid. Th physical backgound
More informationNear Space Hypersonic Unmanned Aerial Vehicle Dynamic Surface Backstepping Control Design
Snsos & ansducs Vol. 74 Issu 7 uly 4 pp. 9-97 Snsos & ansducs 4 by IFSA Publishing S. L. http://www.snsospotal.com Na Spac Hypsonic Unmannd Aial Vhicl Dynamic Sufac Backstpping Contol Dsign inyong YU i
More informationFourier transforms (Chapter 15) Fourier integrals are generalizations of Fourier series. The series representation
Pof. D. I. Nass Phys57 (T-3) Sptmb 8, 03 Foui_Tansf_phys57_T3 Foui tansfoms (Chapt 5) Foui intgals a gnalizations of Foui sis. Th sis psntation a0 nπx nπx f ( x) = + [ an cos + bn sin ] n = of a function
More informationMechanism Analysis of Dynamic Compaction based on Large Deformation
Th Opn Civil Engining Jounal,,, - Opn Accss Mchanism Analysis of Dynamic Compaction basd on Lag Dfomation Xi Nnggang *, Chn Yun, Y Y and Wang Lu Anhui Univsity of Tchnology, Maanshan, Anhui Povinc, China,
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More informationUsing the Hubble Telescope to Determine the Split of a Cosmological Object s Redshift into its Gravitational and Distance Parts
Apion, Vol. 8, No. 2, Apil 2001 84 Using th Hubbl Tlscop to Dtmin th Split of a Cosmological Objct s dshift into its Gavitational and Distanc Pats Phais E. Williams Engtic Matials sach and Tsting Cnt 801
More informationCoverage and Rate in Cellular Networks with Multi-User Spatial Multiplexing
Covag and Rat in Cllula Ntwoks with Multi-Us Spatial Multiplxing Sjith T. Vtil, Kian Kuchi Dpatmnt of Elctical Engining Indian Institut of Tchnology, Hydabad Hydabad, India 55 {p, kkuchi}@iith.ac.in Anilsh
More informationKeywords: Auxiliary variable, Bias, Exponential estimator, Mean Squared Error, Precision.
IN: 39-5967 IO 9:8 Ctifid Intnational Jounal of Engining cinc and Innovativ Tchnolog (IJEIT) Volum 4, Issu 3, Ma 5 Imovd Exonntial Ratio Poduct T Estimato fo finit Poulation Man Ran Vija Kuma ingh and
More informationMathematical Model for Expediting the Execution of Projects under Uncertainty
Intnational Jounal of Computational Engining & Managmnt, Vol. 4, Octob 20 ISSN (Onlin): 2230-7893 www..og 35 Mathmatical Modl fo Expditing th Excution of Pojcts und Unctainty Ashok Mohanty, Biswajit Satpathy
More informationChapter 5. Control of a Unified Voltage Controller. 5.1 Introduction
Chapt 5 Contol of a Unifid Voltag Contoll 5.1 Intoduction In Chapt 4, th Unifid Voltag Contoll, composd of two voltag-soucd convts, was mathmatically dscibd by dynamic quations. Th spac vcto tansfomation
More informationGeometrical Analysis of the Worm-Spiral Wheel Frontal Gear
Gomtical Analysis of th Wom-Spial Whl Fontal Ga SOFIA TOTOLICI, ICOLAE OACEA, VIRGIL TEODOR, GABRIEL FRUMUSAU Manufactuing Scinc and Engining Dpatmnt, Dunaa d Jos Univsity of Galati, Domnasca st., 8000,
More informationMid Year Examination F.4 Mathematics Module 1 (Calculus & Statistics) Suggested Solutions
Mid Ya Eamination 3 F. Matmatics Modul (Calculus & Statistics) Suggstd Solutions Ma pp-: 3 maks - Ma pp- fo ac qustion: mak. - Sam typ of pp- would not b countd twic fom wol pap. - In any cas, no pp maks
More informationGreen Dyadic for the Proca Fields. Paul Dragulin and P. T. Leung ( 梁培德 )*
Gn Dyadic fo th Poca Filds Paul Dagulin and P. T. Lung ( 梁培德 )* Dpatmnt of Physics, Potland Stat Univsity, P. O. Box 751, Potland, OR 9707-0751 Abstact Th dyadic Gn functions fo th Poca filds in f spac
More informationQ Q N, V, e, Quantum Statistics for Ideal Gas. The Canonical Ensemble 10/12/2009. Physics 4362, Lecture #19. Dr. Peter Kroll
Quantum Statistics fo Idal Gas Physics 436 Lctu #9 D. Pt Koll Assistant Pofsso Dpatmnt of Chmisty & Biochmisty Univsity of Txas Alington Will psnt a lctu ntitld: Squzing Matt and Pdicting w Compounds:
More informationCentralized Multi-Node Repair in Distributed Storage
Cntalizd ulti-nod Rpai in Distibutd Stoag awn Zogui, and Zhiying Wang Cnt fo Pvasiv Communications and Computing (CPCC) Univsity of Califonia, Ivin, USA {mzogui,zhiying}@uci.du Abstact In distibutd stoag
More informationQ Q N, V, e, Quantum Statistics for Ideal Gas and Black Body Radiation. The Canonical Ensemble
Quantum Statistics fo Idal Gas and Black Body Radiation Physics 436 Lctu #0 Th Canonical Ensmbl Ei Q Q N V p i 1 Q E i i Bos-Einstin Statistics Paticls with intg valu of spin... qi... q j...... q j...
More informationCDS 101/110: Lecture 7.1 Loop Analysis of Feedback Systems
CDS 11/11: Lctu 7.1 Loop Analysis of Fdback Systms Novmb 7 216 Goals: Intoduc concpt of loop analysis Show how to comput closd loop stability fom opn loop poptis Dscib th Nyquist stability cition fo stability
More informationSources. My Friends, the above placed Intro was given at ANTENTOP to Antennas Lectures.
ANTENTOP- 01-008, # 010 Radiation fom Infinitsimal (Elmntay) Soucs Fl Youslf a Studnt! Da finds, I would lik to giv to you an intsting and liabl antnna thoy. Hous saching in th wb gav m lots thotical infomation
More informationLecture 2: Frequency domain analysis, Phasors. Announcements
EECS 5 SPRING 24, ctu ctu 2: Fquncy domain analyi, Phao EECS 5 Fall 24, ctu 2 Announcmnt Th cou wb it i http://int.c.bkly.du/~5 Today dicuion ction will mt Th Wdnday dicuion ction will mo to Tuday, 5:-6:,
More informationA Study of Generalized Thermoelastic Interaction in an Infinite Fibre-Reinforced Anisotropic Plate Containing a Circular Hole
Vol. 9 0 ACTA PHYSICA POLONICA A No. 6 A Study of Gnalizd Thmolastic Intaction in an Infinit Fib-Rinfocd Anisotopic Plat Containing a Cicula Hol Ibahim A. Abbas a,b, and Abo-l-nou N. Abd-alla a,b a Dpatmnt
More informationarxiv: v1 [gr-qc] 26 Jul 2015
+1-dimnsional womhol fom a doublt of scala filds S. Habib Mazhaimousavi M. Halilsoy Dpatmnt of Physics, Eastn Mditanan Univsity, Gazima gusa, Tuky. Datd: Novmb 8, 018 W psnt a class of xact solutions in
More informationHow!do!humans!combine!sounds!into!an! infinite!number!of!utterances? How!do!they!use!these!utterances!!to! communicate!and!express!meaning?
Linguistics How!o!humans!combin!s!into!an! H h bi i infinit!numb!of!uttancs? Supcomputing an Linguistics Kis Hyln Univsity of Luvn RU Quantitativ Lxicology an Vaiational Linguistics Linguistics Linguistics
More informationSwarm Intelligence Based Controller for Electric Machines and Hybrid Electric Vehicles Applications
Swam Intllignc Basd Contoll fo Elctic Machins and Hybid Elctic Vhicls Applications Oma Hgazy 1, Am Amin, and Joi Van Milo 1 1 Faculty of Engining Scincs Dpatmnt of ETEC- Vij Univsitit Bussl, Pow and Elctical
More informationII.3. DETERMINATION OF THE ELECTRON SPECIFIC CHARGE BY MEANS OF THE MAGNETRON METHOD
II.3. DETEMINTION OF THE ELETON SPEIFI HGE Y MENS OF THE MGNETON METHOD. Wok pupos Th wok pupos is to dtin th atio btwn th absolut alu of th lcton chag and its ass, /, using a dic calld agnton. In this
More informationSYSTEMS ENGINEERING ANALYSIS OF A TRMM-LIKE RETRIEVAL ALGORITHM: IMPLICATION FOR GPM DESIGN
P5R. SYSTEMS ENGINEERING ANALYSIS OF A TRMM-LIKE RETRIEVAL ALGORITHM: IMPLICATION FOR GPM DESIGN C. R. Ros* and V. Chandasa Coloado Stat Univsity Fot Collins, CO 8523. INTRODUCTION Satllit systs such as
More informationPhysics 202, Lecture 5. Today s Topics. Announcements: Homework #3 on WebAssign by tonight Due (with Homework #2) on 9/24, 10 PM
Physics 0, Lctu 5 Today s Topics nnouncmnts: Homwok #3 on Wbssign by tonight Du (with Homwok #) on 9/4, 10 PM Rviw: (Ch. 5Pat I) Elctic Potntial Engy, Elctic Potntial Elctic Potntial (Ch. 5Pat II) Elctic
More informationXFlow: Internet-Scale Extensible Stream Processing
XFlow: Intnt-Scal Extnsibl Stam Pocssing Olga Papammanouil, Uğu Çtintml, John Jannotti Dpatmnt of Comput Scinc, Bown Univsity {olga, ugu, jj}@cs.bown.du Jun 30, 2008 Abstact Existing stam pocssing systms
More informationCHAPTER 5 CIRCULAR MOTION
CHAPTER 5 CIRCULAR MOTION and GRAVITATION 5.1 CENTRIPETAL FORCE It is known that if a paticl mos with constant spd in a cicula path of adius, it acquis a cntiptal acclation du to th chang in th diction
More informationPhysics 240: Worksheet 15 Name
Physics 40: Woksht 15 Nam Each of ths poblms inol physics in an acclatd fam of fnc Althouh you mind wants to ty to foc you to wok ths poblms insid th acclatd fnc fam (i.. th so-calld "won way" by som popl),
More informationPH672 WINTER Problem Set #1. Hint: The tight-binding band function for an fcc crystal is [ ] (a) The tight-binding Hamiltonian (8.
PH67 WINTER 5 Poblm St # Mad, hapt, poblm # 6 Hint: Th tight-binding band function fo an fcc cstal is ( U t cos( a / cos( a / cos( a / cos( a / cos( a / cos( a / ε [ ] (a Th tight-binding Hamiltonian (85
More informationA New Vision for Design of Steel Transmission Line Structures by Reliability Method
IOS Jounal of Mchanical and Civil Engining IOS-JMCE) -ISSN: 78-68,p-ISSN: 30-33X, Volum, Issu V. II Jul- Aug. 0), PP 07-5 A Nw Vision fo sign of Stl Tansmission in Stuctus by liability Mthod Khalid A.
More informationBodo Pareigis. Abstract. category. Because of their noncommutativity quantum groups do not have this
Quantum Goups { Th Functoial Sid Bodo aigis Sptmb 21, 2000 Abstact Quantum goups can b intoducd in vaious ways. W us thi functoial constuction as automophism goups of noncommutativ spacs. This constuction
More informationTheoretical Study of Electromagnetic Wave Propagation: Gaussian Bean Method
Applid Mathmatics, 3, 4, 466-47 http://d.doi.og/.436/am.3.498 Publishd Onlin Octob 3 (http://www.scip.og/jounal/am) Thotical Study of Elctomagntic Wav Popagation: Gaussian Ban Mthod E. I. Ugwu, J. E. Ekp,
More informationWhat Makes Production System Design Hard?
What Maks Poduction Systm Dsign Had? 1. Things not always wh you want thm whn you want thm wh tanspot and location logistics whn invntoy schduling and poduction planning 2. Rsoucs a lumpy minimum ffctiv
More information1. Radiation from an infinitesimal dipole (current element).
LECTURE 3: Radiation fom Infinitsimal (Elmntay) Soucs (Radiation fom an infinitsimal dipol. Duality in Maxwll s quations. Radiation fom an infinitsimal loop. Radiation zons.). Radiation fom an infinitsimal
More informationA Heuristic Approach to Detect Feature Interactions in Requirements
A Huistic Appoach to Dtct Fatu Intactions in Rquimnts Maitta Hisl Janin Souquiès Fakultät fü Infomatik LORIA Univsité Nancy2 Univsität Magdbug B.P. 239 Bâtimnt LORIA D-39016 Magdbug, Gmany F-54506 Vandœuv-ls-Nancy,
More informationEXST Regression Techniques Page 1
EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy
More informationNEWTON S THEORY OF GRAVITY
NEWTON S THEOY OF GAVITY 3 Concptual Qustions 3.. Nwton s thid law tlls us that th focs a qual. Thy a also claly qual whn Nwton s law of gavity is xamind: F / = Gm m has th sam valu whth m = Eath and m
More informationSundials and Linear Algebra
Sundials and Linar Algbra M. Scot Swan July 2, 25 Most txts on crating sundials ar dirctd towards thos who ar solly intrstd in making and using sundials and usually assums minimal mathmatical background.
More informationBrushless Doubly-Fed Induction Machines: Torque Ripple
Bushlss Doubly-Fd Induction Machins: Toqu Rippl Tim. D. Stous, Xuzhou Wang, Hn Polind, Snio Mmb, IEEE, and J. A. (Bam Fia, Fllow, IEEE Abstact-- Th Bushlss DFIM without its bush-ga and slip-ings loos pomising
More informationInertia identification based on adaptive interconnected Observer. of Permanent Magnet Synchronous Motor
Intnational Jounal of Rsach in Engining and Scinc (IJRES) ISSN (Onlin): 232-9364, ISSN (Pint): 232-9356 www.ijs.og Volum 3 Issu 9 ǁ Sptmb. 25 ǁ PP.35-4 Intia idntification basd on adaptiv intconnctd Obsv
More informationMidterm Exam. CS/ECE 181B Intro to Computer Vision. February 13, :30-4:45pm
Nam: Midtm am CS/C 8B Into to Comput Vision Fbua, 7 :-4:45pm las spa ouslvs to th dg possibl so that studnts a vnl distibutd thoughout th oom. his is a losd-boo tst. h a also a fw pags of quations, t.
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationLogical Topology Design for WDM Networks Using Survivable Routing
Logical Toology Dsign fo WDM Ntwoks Using Suvivabl Routing A. Jakl, S. Bandyoadhyay and Y. Ana Univsity of Windso Windso, Canada N9B 3P4 {aunita, subi, ana@uwindso.ca Abstact Suvivabl outing of a logical
More informationA Self-Tuning Proportional-Integral-Derivative Controller for an Autonomous Underwater Vehicle, Based On Taguchi Method
Jounal of Comput Scinc 6 (8): 862-871, 2010 ISSN 1549-3636 2010 Scinc Publications A Slf-Tuning Popotional-Intgal-Divativ Contoll fo an Autonomous Undwat Vhicl, Basd On Taguchi Mthod M. Santhakuma and
More informationGalaxy Photometry. Recalling the relationship between flux and luminosity, Flux = brightness becomes
Galaxy Photomty Fo galaxis, w masu a sufac flux, that is, th couts i ach pixl. Though calibatio, this is covtd to flux dsity i Jaskys ( Jy -6 W/m/Hz). Fo a galaxy at som distac, d, a pixl of sid D subtds
More information2 MARTIN GAVALE, GÜNTER ROTE R Ψ 2 3 I 4 6 R Ψ 5 Figu I ff R Ψ lcm(3; 4; 6) = 12. Th componnts a non-compaabl, in th sns of th o
REAHABILITY OF FUZZY MATRIX PERIOD MARTIN GAVALE, GÜNTER ROTE Abstact. Th computational complxity of th matix piod achability (MPR) poblm in a fuzzy algba B is studid. Givn an n n matix A with lmnts in
More informationBohr model and dimensional scaling analysis of atoms and molecules
Boh modl and dimnsional scaling analysis of atoms and molculs Atomic and molcula physics goup Faculty: Postdocs: : Studnts: Malan Scully udly Hschbach Siu Chin Godon Chn Anatoly Svidzinsky obt Muawski
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationAdvanced School on Synchrotron and Free Electron Laser Sources and their Multidisciplinary Applications
96- Advancd School on Synchoton and F Elcton Las Soucs and thi Multidisciplinay Applications 7-5 Apil 8 Small angl x-ay scatting (Basic Aspcts) Aldo Caivich Univsity d Sao Paulo Bazil Small-Angl X ay Scatting
More informationPricing decision problem in dual-channel supply chain based on experts belief degrees
Soft Comput (218) 22:5683 5698 https://doi.og/1.17/s5-17-26- FOCUS Picing dcision poblm in dual-channl supply chain basd on xpts blif dgs Hua K 1 Hu Huang 1 Xianyi Gao 1 Publishd onlin: 12 Apil 217 Sping-Vlag
More informationWhile flying from hot to cold, or high to low, watch out below!
STANDARD ATMOSHERE Wil flying fom ot to cold, o ig to low, watc out blow! indicatd altitud actual altitud STANDARD ATMOSHERE indicatd altitud actual altitud STANDARD ATMOSHERE Wil flying fom ot to cold,
More informationChapter 7 Dynamic stability analysis I Equations of motion and estimation of stability derivatives - 4 Lecture 25 Topics
Chapt 7 Dynamic stability analysis I Equations of motion an stimation of stability ivativs - 4 ctu 5 opics 7.8 Expssions fo changs in aoynamic an populsiv focs an momnts 7.8.1 Simplifi xpssions fo changs
More informationEfficient Pruning of Large Knowledge Graphs
Efficint Puning of Lag Knowldg Gaphs Stfano Faalli 1, In Finocchi, Simon Paolo Ponztto and Paola Vladi 1 Univsity of Rom Unitlma Sapinza Univsity of Rom Sapinza Univsity of Mannhim stfano.faalli@unitlma.it,
More information12 The Open Economy Revisited
CHPTER 12 Th Opn Economy Rvisitd Qustions fo Rviw 1. In th Mundll Flming modl, an incas in taxs shifts th IS cuv to th lft. If th xchang at floats fly, thn th LM cuv is unaffctd. s shown in Figu 12 1,
More informationA Comparative Study and Analysis of an Optimized Control Strategy for the Toyota Hybrid System
Pag 563 Wol Elctic Vhicl Jounal Vol. 3 - ISSN 3-6653 - 9 AVERE EVS4 Stavang, Noway, May 13-16, 9 A Compaativ Stuy an Analysis of an Optimiz Contol Statgy fo th Toyota Hybi Systm Tho Hofman 1, Thijs Punot
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationCHAPTER 5 CIRCULAR MOTION AND GRAVITATION
84 CHAPTER 5 CIRCULAR MOTION AND GRAVITATION CHAPTER 5 CIRCULAR MOTION AND GRAVITATION 85 In th pious chapt w discussd Nwton's laws of motion and its application in simpl dynamics poblms. In this chapt
More informationEE243 Advanced Electromagnetic Theory Lec # 22 Scattering and Diffraction. Reading: Jackson Chapter 10.1, 10.3, lite on both 10.2 and 10.
Appid M Fa 6, Nuuth Lctu # V //6 43 Advancd ctomagntic Thoy Lc # Scatting and Diffaction Scatting Fom Sma Obcts Scatting by Sma Dictic and Mtaic Sphs Coction of Scatts Sphica Wav xpansions Scaa Vcto Rading:
More informationFrictional effects, vortex spin-down
Chapt 4 Fictional ffcts, votx spin-down To undstand spin-up of a topical cyclon it is instuctiv to consid fist th spin-down poblm, which quis a considation of fictional ffcts. W xamin fist th ssntial dynamics
More informationStudy on the Static Load Capacity and Synthetic Vector Direct Torque Control of Brushless Doubly Fed Machines
ngis Aticl Study on Static Load Capacity Syntic cto Dict Toqu Contol Bushlss Doubly Fd Machins Chaoying Xia * Xiaoxin Hou School Elctical Engining Automation, Tianjin Univsity, No. 9 Wijin Road, Tianjin,
More informationCollective Focusing of a Neutralized Intense Ion Beam Propagating Along a Weak Solenodial Magnetic Field
Havy Ion Fusion Scinc Vitual National Laoatoy Collctiv Focusing of a Nutalizd Intns Ion Bam Popagating Along a Wak Solnodial Magntic Fild M. Dof (LLNL) In collaoation with I. Kaganovich, E. Statsv, and
More information