Knowledge Unit Relation Recognition Based on Markov Logic Networks
|
|
- Ruby Kennedy
- 5 years ago
- Views:
Transcription
1 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER Knowledge Unt Relton Recognton Bsed on Mrkov Logc Networks We Wng 1, 2, We We 2, Je Hu 2, Juntng Ye 1, nd Qnghu Zheng 1 1. School of Electronc nd Informton Engneerng, X n Jotong Unversty, X n, Chn 2. School of Computer Scence nd Engneerng, X n Unversty of Technology, X n, Chn Eml: wellwng@126.com Astrct Knowledge unt (KU) s the smllest ntegrl knowledge oject n gven domn. Knowledge unt relton recognton s to dscover mplct reltons mong KUs, whch s crucl prolem n nformton extrcton. Ths pper proposes knowledge unt relton recognton frmework sed on Mrkov Logc Networks, whch comnes prolstc grphcl models nd frst-order logc y ttchng weght to ech frst-order formul. The frmework s composed prncplly of structure lernng, rtfcl dd or delete formuls, weght lernng nd nferrng. Accordng to the semntc nlyss of KUs nd ther reltons, ground predcte set s frst extrcted. Next, the ground predcte set s nputted nto structure lernng module to cheve weght formul set. Then, n order to overcome lmttons of structure lernng, the weght rule set s dded or deleted y humn. The new weght formul set s turned nto weght lernng module to cqure the lst weght formul set. Fnlly, knowledge unt reltons re recognzed y nferrng module wth the lst weght formul set. Experments on the four dt sets relted to computer domn show the utlty of ths pproch. The tme complexty of structure lernng s lso nlyzed. Index Terms Knowledge Unt; Relton Recognton; Mrkov Logc Networks; Knowledge Nvgton I. INTRODUCTION Knowledge unt (KU) s the smllest ntegrl knowledge oject n gven domn, such s defnton, theorem, rule, or lgorthm [1-5]. It s often emedded n vrety of sem-structured or unstructured texts such s TXT, DOC nd HTML n lner wy. Such orgnzton of knowledge sme s trdtonl pper med, s dffcult to ndcte reltons mong KUs. Knowledge unt relton s n mplct dependence relton etween two KUs. In computer network, preorder s eng n the KU Defnton of computer network nd the KU Clssfcton of computer network, whch denotes the ltter s successor to the former n content; nlogy les n the KU Defnton of TCP nd the KU Defnton of UDP, whch denotes oth hve correspondng reltonshp n functon or content. Knowledge unt relton recognton (KURR) s to mne these hdden reltons from KU set, whch cn e very useful for pplctons such s knowledge orgnzton nd knowledge nvgton. In knowledge orgnzton, knowledge cn e orgnzed nto multlyer nd mult-prtcle. From top to ottom, the frst lyer s concepts nd concept reltons; the second lyer s KUs nd KU reltons; the ottom lyer s knowledge documents nd metdt. In knowledge nvgton, when one hs lerned the KU Defnton of TCP, we cn gude her/hm to the KU Defnton of UDP sed on KU relton network. Thus one wll understnd these two KUs deeply [3]. To the est of our knowledge, reserch nto KURR ws stll n prelmnry stge. Wng et l. select nformton of term, type, dstnce, KU relton level nd document level s fetures to represent cnddte relton nstnces. They use Support Vector Mchnes (SVM) s clssfer to recognze KU reltons from four dt set of computer domn. The expermentl results show tht term, type nd dstnce fetures re more effectve [3]. However, the recll of nlogy recognton s lower. Wng et l. employ relton Gussn processes (RGP) nd ntegrted nformton of terms, semntc type, poston of knowledge elements nd relton grph structure to predct KU nlogy relton. The expermentl results show tht the recll nd F1-mesures ovously mprove [4]. Chen et l. tret the KURR tsk s sequence lelng prolem. Vrous fetures ncludng terms, semntc type, dstnce nd context nformton re ncorported to represent cnddte relton nstnces. Expermentl evluton shows tht the method cheves etter performnce. It lso ndctes tht Condtonl Rndom Felds (CRFs) outperform other prolstc models.e. Hdden Mrkov Model (HMM) nd Mxmum Entropy (ME) [5]. Lu et l. fnd two fetures of KU, whch re the dstrutonl symmetry of the domn terms nd the locl nture of the lernng-dependency. Ther method conssts of three stges, (1) Buld document ssocton reltonshp y clcultng the dstrutonl symmetry of the domn terms. (2) Generte the cnddte relton nstnces y mesurng the loclty of the dependences. (3) Use clssfcton lgorthm to dentfy the lernng-dependency of cnddte relton nstnces. The lernng-dependency s the preorder relton. The method extrcts the lernng-dependency effcently [1-2]. Ths pper proposes KURR frmework sed on Mrkov Logc Networks (MLN), whch comnes prolstc grphcl models nd frst-order logc y ttchng weght to ech frst-order formul. The frmework s composed prncplly of structure lernng, do: /jnw
2 2418 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 2014 rtfcl dd or delete formuls, weght lernng nd nferrng. Accordng to the semntc nlyss nd sttstcs of KUs nd ther reltons, seventeen predctes re defned, ncludng thrteen evdence predctes nd four query predctes. The method of formul extrcton s lso dscussed to remedy the defects of structure lernng. The rest of the pper s orgnzed s follows. Secton II gves defnton of KU, KU relton nd MLN. Secton III descres the frmework of KURR. Expermentl results re dscussed n Secton IV. Secton V presents the conclusons. II. BASIC NOTIONS In ths secton, severl notons relted to KURR re gven. A. KU KU re utomtclly extrcted from textul knowledge documents, whch s our pror reserch work [6]. A forml defnton of KU s s follows [3]: Defnton 1. A KU s quntuple, ke : d, T, CT,st,tc (1) where ) d s the sequence numer of the KU. Its vlue s ssgned y the order of extrcton. In ths pper, d s used to dentfy the KU. ) T s the term set of the KU. c) CT s the core term set, CT T. So-clled core term s the term tht cn ndcte semntc suject or descrptve oject of the KU. d) st s the semntc type of the KU. st { defnton, descrpton, ttrute, clssfcton, method, structure, dstncton, exmple, evoluton}. e) tc s the text content of the KU. Once KUs hve een extrcted from text document, vlues of d, T, CT,st nd tc re cqured. Defnton 2. Let KURT { preorder, nlogy, llustrton, undefnedr } e the type set of KU relton. Let ( ku, ku, kurt) denote relton nstnce, where ku, ku KU KU,, KU s the set of KU nd kurt KURT. When ) kurt = preorder, t ndctes tht ku s successor to ku n content; ) kurt = nlogy, t ndctes tht ku s prllel or correspondng to ku on certn spect; c) kurt = llustrton, t ndctes tht ku s n explnton or exmple for ku ; d) kurt = undefnedr, t ndctes tht preorder, nlogy nd llustrton do not exst etween ku nd ku. For nstnce, ( 513,515, preorder), ( 202,203, llustrton), ( 202, 208, nlogy) nd ( 515,202, undefnedr) cn e derved from KUs n tle I. B. MLN Mrkov Logc s sttstcl reltonl lernng lnguge sed on frst-order logc nd Mrkov Networks. Mrkov Logc cn extend frst-order logc to llow formul to e weghted rther thn e strctly true or flse; tht s, frst-order logc formul cn e volted wth penlty. A MLN, then, s set of these weghted frst-order logc formul [7]. Defnton 3 [8]. A Mrkov logc network L s set of prs ( F, ), where F s formul n frst-order logc nd s rel numer. Together wth fnte set of constnts C { c1, c2,, c C }, t defnes Mrkov network M LC, s follows: ) M LC, contns one nry node for ech possle groundng of ech predcte pperng n L. The vlue of the node s 1 f the ground tom s true, nd 0 otherwse. ) LC, M contns one feture for ech possle groundng of ech formul F n L. The vlue of ths feture s 1 f the ground formul s true, nd 0 otherwse. The weght of the feture s the ssocted wth F n L. The prolty dstruton over possle worlds x specfed y the ground network s clculted y (2), where n ( x ) s the numer of true groundngs for F n x nd Z s the prtton functon tht s used to mke the summton of ll possle groundngs dds up to one [9-10]. 1 P( X x) exp( n( x)) (2) Z III. METHOD In ths secton, KURR frmework sed on MLN s presented. As shown n fgure 1, the frmework cn e decomposed nto fve mjor modules: optonl formul set, structure lernng, rtfcl dd or delete formuls, weght lernng nd nferrng. Frst, ccordng to sttstcl nlyss of KU nd KU reltons, some ovous rules re proposed y hnd. These rules re further trnsform to frst-order logc formuls, whch form formul set. Next, ground predctes nd formuls re nput nto structure lernng module nd the weght formul set s generted [11-12]. The structure lernng s mportnt to MLN [13-15]. The effcency of structure lernng s currently need to e mproved [16]. The weght formul set cn e used for nferrng drectly. In our frmework, rtfcl dd or delete formuls module nd weght lernng module re set. The rtfcl dd or delete formuls revses the formul y hnd nd pror knowledge. Weght lernng estmtes the weght ssocted wth ech formul of gven structure. These two modules ll produce new weght formul set. Fnlly, KU reltons re cqured y nferrng.
3 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER TABLE I. EXAMPLES OF KU d T CT st tc computer network, telecommuncton system, communctng, shrng resources computer networks, Locl Are Network, LAN, Metropoltn Are Network, MAN, Wde Are Network, WAN User Dtgrm Protocol, UDP, protocols, Internet protocol sute, connectonless, trnsport lyer protocol, exchnges pckets, error recovery, gurnteed delvery, cknowledgment UDP, voce over IP, VoIP, retrnsmt, pckets Trnsmsson Control Protocol, TCP, connecton-orented protocol, Internet Protocol, IP, TCP/IP, relle communcton, full-duplex, process-to-process connectons computer network computer networks User Dtgrm Protocol, UDP UDP Trnsmsson Control Protocol, TCP defnton clssfcton defnton exmple defnton A computer network s multple computers connected together usng telecommuncton system for the purpose of communctng nd shrng resources. Bsed on ther scle, computer networks cn e clssfed s Locl Are Network (LAN), Metropoltn Are Network (MAN), nd Wde Are Network (WAN). User Dtgrm Protocol (UDP), one of the core protocols of the Internet protocol sute, s connectonless, trnsport lyer protocol tht exchnges pckets wth mnml error recovery servces nd wthout gurnteed delvery or cknowledgment. UDP s wdely used for stremng udo nd vdeo, voce over IP (VoIP) nd vdeoconferencng, ecuse there s no tme to retrnsmt erroneous or dropped pckets. Trnsmsson Control Protocol (TCP) s the connecton-orented protocol ult on top of Internet Protocol (IP) nd s nerly lwys seen n the comnton TCP/IP (TCP over IP). It dds relle communcton nd provdes full-duplex, process-to-process connectons. Fgure 1. MLN-sed knowledge unt relton recognton frmework In fct, mny MLN sed pproches do not nclude structure lernng ecuse of the effcency [9] [17-19]. A. Predcte nd Ground Predcte Extrcton Predcte symols represent reltons mong ojects n the domn (e.g., Preorder) or ttrutes of ojects (e.g. Defnton). A ground predcte s n tomc formul ll of whose rguments re ground terms (e.g. Preorder (513, 515)). Accordng to the defnton of KU nd KU relton type, ntegrtng wth our nlyses, seventeen predctes re defned, ncludng thrteen evdence predctes nd four query predctes. 1) Evdence Predctes Defnton (ID): The type of ID KU s defnton. Descrpton (ID): The type of ID KU s descrpton. Attrute (ID): The type of ID KU s ttrute. Clssfcton (ID): The type of ID KU s clssfcton. Method (ID): The type of ID KU s method. Structure (ID): The type of ID KU s structure. Dstncton (ID): The type of ID KU s dstncton. Exmple (ID): The type of ID KU s exmple. Evoluton (ID): The type of ID KU s evoluton. CSuStrng (ID1, ID2): The core term of ID1 KU s the sustrng of the core term of ID2 KU. KUSmeType (ID1, ID2): The type of ID1 KU nd ID2 KU s sme. CSme (ID1, ID2): The core terms of ID1 KU nd ID2 KU re sme. CBelong (ID1, ID2): The core term of the ID1 KU ppers the term set of ID2 KU nd do not pper the core term set of ID2 KU. 2) Query Predctes Preorder (ID1, ID2): The relton type of ID1 nd ID2 KU s preorder. Anlogy (ID1, ID2): The relton type of ID1 nd ID2 KU s nlogy. Illustrton (ID1, ID2): The relton type of ID1 nd ID2 KU s llustrton. UndefnedR (ID1, ID2): The relton type of ID1 nd ID2 KU s undefnedr. The vlues of evdence predctes s 1 or 0. The vlues of query predctes s 1 or 0 n trnng phse nd prolty n test phse. 3) Ground Predcte Extrcton The KUs re stored n KU dtse wth (1). The evdence predctes cn trnsform nto ground predcte y scnnng KU dtse. For evdence predctes of one rgument (e.g. Defnton (ID)), ground predctes cn e cqured y one loop. But for evdence predctes of two rguments (e. g. CSuStrng (ID1, ID2)), every two KUs re potentl ID1 nd UD2 nd the clcultons re huge. Lu et l. fnd the locl nture of the lernngdependency [1-2]; tht s, the two KUs tht hve relton re locl. Thus, we cluster the text documents [20-21]. The ID1 nd ID2 prs re generted mong those documents n the sme cluster. For query predctes, cnddte relton nstnces re lso generted mong those documents n the sme cluster. Then, we mnully nnotted the type of KU reltons mong cnddte relton nstnce set. The nnottng work ws conducted s follows: We hred 24 undergrdute students n ther junor yer or senor yer from the computer scence deprtment. They were sked to log on to We-sed nnottng system, where they were gven the nnotton ssgnments. They were sked
4 2420 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 2014 to nnotte the type of relton y usng ther own knowledge ckground nd ddtonl textook resources. The work lsted 6 months. We creted the dt set tht covers the four courses fter we doule checked the students work [1]. B. Rule Extrcton Formul set s optonl. In order to the performnce of KURR, some rules re extrcted y hnd. These rules re esy to trnsfer nto formuls. A exmple of rule s s follows. f the core terms of ID1 nd ID2 KU re sme, nd the type of ID2 KU s exmple nd the type of ID1 KU s defnton, the relton type of ID1 nd ID2 KU s llustrton. The frst-order logc s: x y, CSme ( xy, ) Exmple ( y) Defnton ( x) Illustrton ( xy, ) The 202 nd 203 KU n tle I meet ths rule. We nlyze the dt set nd hope to cqure vlule rules. Algorthm 1 s the sttstcl nlyss lgorthm. The percentge of KU relton whch meets certn evdence predcte nd the type of ID1 nd ID2 KU cn e cheve y Algorthm 1. Algorthm 1. Sttstcl nlyss lgorthm Input: Dt set of KUs nd KU reltons Output: Percentge of KU relton whch meets certn evdence predcte; The type of ID1 nd ID2 KU Defnton: KU: Knowledge unt KUR: Knowledge unt relton ReltonDt: knowledge unt reltonl dt sets EP: Evdence predcte EPS: Evdence predcte set Clque,j : represents one of four type reltons, j represents the th type relton n the j set Relton (ID1, ID2): represents one of four type reltons, ncludng preorder, nlogy, llustrton, undefnedr Steps For Relton (ID 1j, ID 2k ) ReltonDt For Relton one of four reltons Whle(ID 1j s fxed vlue) ID 2k nd ID 1j KU sve nto Clque,j Lookng for new ID 1j For EP EPS By trversng Clque,j (j chngng vlues), chves percentge of ll the knowledge unt EP tht re unoccuped n the totl knowledge unt of Clque,j For KUR Relton (ID1,ID2) Get the type nformton of ID1 nd ID2 The end of the lgorthm Seven rules re gned y the results of Algorthm 1. C. Structure Lernng Usng serch strtegy, Structure lernng costs huge tme nd memory, whch s n mportnt fctor restrctng the development of MLN. Thus, structure lernng ecome key reserch drecton n MLN [22]. Structure lernng method currently hs een further mproved, ut the core de s modelng v ground predctes of the known world to fnd possle frst-order formuls (usully n the form of norml form). The formuls re ssumed to e held nd the current world mxmum pseudo-lkelhood prolty (.e., the exstence posslty of the world) s clculted under the KB (Knowledge Bse, collecton of frst-order formuls). The current world mxmum pseudo- lkelhood vlue of the lrgest KB (correspondng to the structure of MLN) s gned y loop [23-25]. Structure lernng strt from ll sngle predctes s useful [14]. A. Dt Set IV. EXPERIMENT We downloded 1205 documents relted to four courses of computer domn from the Internet. Then, 4,052 KUs re extrcted nd 6,252 KU relton nstnces re nnotted. Tle II s the dstruton of KU relton nstnces. TABLE II. THE DISTRIBUTION OF KU RELATION INSTANCES Course preorder nlogy llustrton undefnedr Computer network Computer orgnzton Prncple of dtse Computer rchtecture The MLN system Alchemy s employed to lern nd nfer [26]. Precson (P), Recll (R), nd F1 Mcro-verged (F1) mesure re dopted to evlute the performnces of KURR. B. Experment Process 1) Structure Lernng Input: The ground predcte set nd the formul set. Output: The weght frst-order logc formul set. For nstnce, Illustrton(1,2) v Defnton(2) v!defnton(1) Descrpton: the vlues of s weght of the formul, followed y the formul of the structure lernng. nstructon:./lernstruct - trn.mln -o struct.mln -t nput.d -ne Preorder, Anlogy, Illustrton, UndefnedR -mnwt cchesze tghtmxiter 100 -emsze 3 -mxnumpredctes 3 -loosemxiter 2 -numclusesreevl 4 Structure lernng uses serch strtegy nd tkes gret del of tme nd memory. 2) Weght Lernng Input: The formul set of structure lernng nd rtfclty. Output: The weght frst-order logc formul set. nstructon:./ Lernwts-cw CSuStrng KUSmeType CSme CBelong, Defnton, Descrpton, Attrute, Clssfcton, Method, Structure, Dstncton, Exmple, Evoluton - C_wtLernng.mln -t the nput.d -m -perodc -d -o rules wtlerned.mln the the -ne Preorder, Anlogy, Illustrton, UndefnedR noadduntcluses -dmxhour 24
5 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER ) Inference Input: The weght frst-order logc formul set nd ground predcte set of the test dt set. Output: The prolty of query predctes. nstructon:./nfer -cw CSuStrng KUSmeType CSme CBelong, Defnton, Descrpton, Attrute, Clssfcton, Method, Structure, Dstncton, Exmple, Evoluton - B_wtLernng.mln -e nput.d -r pro.txt -q Preorder, Anlogy, Illustrton, UndefnedR. C. Structure Lernng to Weght Lernng In structure lernng, there re two crucl prolems. Frst, the runnng tme s too long. When the KU sze s 500, structure lernng process tkes 3-6 dys. Second, the result s not stsfyng. The formul of structure lernng s mnly sngle predcte (greter thn 90%). Ths result s not prtculrly menngful. Therefore, we dopt mnly weght lernng nd nferrng to ccomplsh KURR tsk. Structure lernng s employed to gn frst-order logc formul set n smll sze KU dt set. These formul set s thrown nto weght lernng together wth formul set of rtfclty. D. Results nd Dsscusson We conducted threefold cross vldton. Thus, ll the results reported here re those verged over three trls. The performnce of KURR s shown n tle III. The F1 of preorder, llustrton nd undefnedr re thn 88.20% on four courses whle the mxml F1 of nlogy s 57.62%. Our method s effectve for preorder, llustrton nd undefnedr relton recognton. Tle III lso ndctes tht the R of preorder, llustrton nd undefnedr relton s hgher thn the P, especlly preorder nd llustrton, whose verge of R-P s 9.13% nd 6.05% respectvely. They show tht our predctes re not perfectly ccurte for recognzng these three types of reltons. By contrres, the P of nlogy relton s hgher thn the R. Ther mnml P-R s 48.54%. They show tht our predctes re too strct for recognzng nlogy relton nd mss mny nlogy relton nstnces. How to fnd new predctes nd mprove the recll of nlogy relton s our urgent work. E. The Runnng Tme of Structure Lernng Here, the runnng tme of structure lernng s refly dscussed. The vrles s only the numer of KU. Consderng runnng tme nd dstruton, the followng runnng tme of ten dt szes re smpled, 2, 5, 10, 20, 50, 100, 200, 300, 400, 500. The lgorthm s sed smplng, so the results s certn rndomness. To vod the nfluence of rndomness, the verge runnng tme s dopted y three smples. The results of three smples s showed n tle IV. The computer s Intel E5410, Dul Core, 2.33GHz nd 2G RAM. Through the verge runnng tme of structure lernng n the tle IV, the tme curve shown n Fgure 2. Cftool of Mtl s employed to get the ftted curve nd fttng formul wth 95% confdence ounds s s follows. T( n) 8626*exp( n) (3) TABLE III. THE PERFORMANCE OF KURR (%) Course preorder nlogy llustrton undefnedr P R F1 P R F1 P R F1 P R F1 Computer network Computer orgnzton Prncple of dtse Computer rchtecture TABLE IV. THE RUNNING TIME OF STRUCTURE LEARNING (TIME UNIT: SECOND) Dt sze Averge Fgure 2. The tme curve of structure lernng
6 2422 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER 2014 Goodness of ft: SSE: 1.682e+09 R-squre: Adjusted R-squre: RMSE: 1.45e+04 From the (3), when n s 1000,.e. the numer of the KU s 1000, the runnng tme of structure lernng s e+06 seconds, whch s out 103 dys. V. CONCLUSION KURR s to dscover ntrnsc nd hdden reltons from KU set. In ths pper, we present frmework sed on MLN to recognze KU relton. The frmework s composed prncplly of structure lernng, rtfcl dd or delete formuls, weght lernng nd nferrng. Seventeen predctes re defned nd seven rules re extrcted. We conducted experments to evlute the performnce of the frmework, predctes nd rules for KURR on four dt sets relted to computer domn. The results show tht the frmework cn cheve compettve performnce of preorder, llustrton nd undefner relton recognton. We wll extend our study n the followng drectons: ) We suggest usng structure lernng to cqure frst-order logc formuls. But the tme complexty s hgh nd the frst-order logc formuls of structure lernng s not prtculrly menngful. We should study the lgorthm of structure lernng nd mprove the effcency of lernng. ) The performnce of nlogy relton recognton s not stsfyng. Anlogy relton s symmetrc. Two KUs n n nlogy relton nstnce re usully smlr n structure. We wll ncorporte ths nformton nto predctes. ACKNOWLEDGMENTS We would lke to thnk the nonymous revewers for ther vlule comments. Ths progrm s supported y Scentfc Reserch Progrm Funded y Shnx Provncl Educton Deprtment (Progrm No. 2010JK723),Nturl Scence Bsc Reserch Pln n Shnx Provnce of Chn (Progrm No. 2012JM8047), the Speclzed Reserch Fund for the Doctorl Progrm of Hgher Educton of Chn (Progrm No ),Ntonl Nturl Scence Foundton of Chn (Progrm No , ), Ntonl Hgh-Tech Reserch nd Development Pln of Chn (Progrm No. 2008AA01Z131) nd Scence nd Technology Project of X'n (Progrm No. CX12629). Ths work s lso supported y the Chn Postdoctorl Scence Foundton (Progrm No. 2013M542370). REFERENCES [1] J. Lu, L. Jng, Z. Wu, Q. H. Zheng, nd Y. N. Qn, Mnng lernng-dependency etween knowledge unts from text, The VLDB Journl, vol. 20, No. 3, pp , [2] J. Lu, L. Jng, Z.H. Wu, Q. H. Zheng, nd Y. N. Qn, Mnng preorder relton etween knowledge unts from text, Proceedngs of the 2010 ACM Symposum on Appled Computng, pp , [3] W. Wng, Q.H. Zheng, J. Lu, Y. Y. Chen, nd P. F. Tng, Explotng vrous nformton for knowledge element relton recognton, Proceedngs of the IEEE Interntonl Conference on Grnulr Computng, pp , [4] W. Wng, Q. H. Zheng, nd Y. Y. Chen, Knowledge element nlogy relton recognton usng text nd grph structure, Proceedngs of the Interntonl Conference on Nturl Lnguge Processng nd Knowledge Engneerng, pp , [5] Y. Y. Chen, Q. H. Zheng, W. Wng, nd Y. Chen, Knowledge element relton extrcton usng condtonl rndom felds, Proceedngs of the 14th Interntonl Conference on Computer Supported Coopertve Work n Desgn, pp , [6] X. Chng nd Q. H. Zheng, Knowledge element extrcton for knowledge-sed lernng resources orgnzton, Proceedngs of the 6th nterntonl conference on Advnces n we sed lernng, pp , [7] C. Kennngton nd D. Schlngen, Stuted ncrementl nturl lnguge understndng usng Mrkov Logc Networks, Computer Speech nd Lnguge, vol. 28, no. 1, pp , [8] M. Rchrdson nd P. Domngos, Mrkov logc networks, Mchne Lernng, vol. 62, no. 1-2, pp , [9] D. Fernández, S. Mrn, J. Lldós, nd A. Fornés, Contextul word spottng n hstorcl mnuscrpts usng Mrkov logc networks, Proceedngs of the 2nd Interntonl Workshop on Hstorcl Document Imgng nd Processng, pp , [10] H. Ppdopoulos nd G. Tznetks, Explotng structurl reltonshps n udo musc sgnls usng Mrkov Logc Networks, Proceedngs of the IEEE Interntonl Conference on Acoustcs, Speech nd Sgnl Processng, pp. 1-5, [11] Q. T. Dnh, M. Exryt, nd C. Vrn, Genertve structure lernng for Mrkov logc networks sed on grph of predctes, Proceedngs of the Twenty-Second nterntonl jont conference on Artfcl Intellgence, vol. 2, pp , [12] R. A. Ross, L. K. McDowell, D. W. Ah, nd J. Nevlle, Trnsformng grph dt for sttstcl reltonl lernng, Journl of Artfcl Intellgence Reserch, vol. 45, no.1, pp , [13] S. Kok nd P. Domngos, Lernng Mrkov logc network structure v hypergrph lftng, Proceedngs of the 26th Annul Interntonl Conference on Mchne Lernng, pp , [14] S. Kok nd P. Domngos, Lernng the structure of Mrkov logc networks, Proceedngs of the 22nd nterntonl conference on Mchne lernng, pp , [15] L. Mhlkov nd R. J. Mooney, Bottom-up lernng of Mrkov logc network structure, Proceedngs of the 24th nterntonl conference on Mchne lernng, pp , [16] S. Kok nd P. Domngos, Lernng Mrkov Logc Networks Usng Structurl Motfs, Proceedngs of the 27th nterntonl conference on Mchne lernng, pp , [17] P. Sngl nd P. Domngos, Entty Resoluton wth Mrkov Logc, Proceedngs of the 6th IEEE Interntonl Conference on Dt Mnng, pp , [18] S. Sorower, T. G. Detterch, J. Ro Dopp, W. Orr, P. Tdepll, nd X. Fern, Invertng Grce s Mxms to
7 JOURNAL OF NETWORKS, VOL. 9, NO. 9, SEPTEMBER Lern Rules from Nturl Lnguge Extrctons, Proceedngs of Neurl Informton Processng Systems, pp , [19] E. Y. H, J. P. Rowe, B. W. Mott, nd J. C. Lester, Gol recognton wth mrkov logc networks for plyer-dptve gmes, Proceedngs of the Seventh AAAI Conference on Artfcl Intellgence nd Interctve Dgtl Entertnment, pp , [20] T. Toht, W. Musjn, nd A. Hmdull, Effcent Term Extrcton nd Indexng Approch n Smll-Scle We Serch of Uyghur Lnguge, Journl of Multmed, vol. 8, No. 5, pp , [21] H. J. J, S. F. Dng, H. Zhu, F. L. Wu, nd L. N. Bo, A Feture Weghted Spectrl Clusterng Algorthm Bsed on Knowledge Entropy, Journl of Softwre, vol. 8, No. 5, pp , [22] T. Khot, S. Ntrjn, K. Kerstng, nd J. Shvlk, Lernng Mrkov Logc Networks v Functonl Grdent Boostng, Proceedngs of the IEEE 11th Interntonl Conference on Dt Mnng, pp , [23] P. Sngl nd P. Domngos, Dscrmntve trnng of Mrkov logc networks, Proceedngs of the 20th ntonl conference on Artfcl ntellgence, pp , [24] P. Domngos, S. Kok, H. Poon, M. Rchrdson, nd P. Sngl, Unfyng logcl nd sttstcl AI, Proceedngs of the 21st ntonl conference on Artfcl ntellgence, vol. 1, pp. 2-7, [25] Y. Xe, B. Luo, R. B. Xu, nd S. B. Chen, Smooth Hrmonc Trnsductve Lernng, Journl of Computers, vol. 8, No. 12, pp , [26] S. Kok, M. Sumner, M. Rchrdson, P. Sngl, H. Poon, et l., The Alchemy system for sttstcl reltonl AI, Techncl report, Deprtment of Computer Scence nd Engneerng, Unversty of Wshngton, Settle, WA, We Wng ws orn n He receved hs B.Sc., nd M.Sc. from North Unversty of Chn n 1997 nd X'n Jotong Unversty of Chn n 2003, respectvely. Hs reserch nterests re text mnng nd mchne lernng.
Data Attribute Reduction using Binary Conversion
Fengmng M. Chng Dt Attrute Reducton usng Bnry Converson FENGMING M. CHANG Deprtment of Informton Scence nd Applctons As Unversty Wufeng, Tchung 4354 Twn pperss@gml.com Astrct: - Whle lernng wth dt hvng
More informationSinusoidal Steady State Analysis
CHAPTER 8 Snusodl Stedy Stte Anlyss 8.1. Generl Approch In the prevous chpter, we hve lerned tht the stedy-stte response of crcut to snusodl nputs cn e otned y usng phsors. In ths chpter, we present mny
More informationSimplified Algorithm and Hardware Implementation for the (24, 12, 8) Extended Golay Soft Decoder Up to 4 Errors
The Interntonl Arb Journl of Informton Technology, Vol., No., Mrch 04 Smplfed Algorthm nd Hrdwre Implementton for the (4,, 8 Extended Goly Soft Decoder Up to 4 Errors Dongfu Xe College of Mechncl nd Electrcl
More informationWeb-based Remote Human Pulse Monitoring System with Intelligent Data Analysis for Home Healthcare
We-sed Remote Humn Pulse Montorng System wth Intellgent Dt Anlyss for Home Helthcre Chh-Mng Chen Grdute Insttute of Lrry, Informton nd Archvl Studes, Ntonl Chengch Unversty, Tpe 6, Twn, R.O.C. chencm@nccu.edu.tw
More informationContent Based Color Image Retrieval via Wavelet Transforms
8 IJCSNS Interntonl Journl of Computer Scence nd Network Securty, VOL.7 No., December 7 Content Bsed Color Imge Retrevl v Wvelet Trnsforms Mrs.Y. M. Lth Dr.B.C.Jng V.S.K.Reddy, GNITS,JNTU,Ind Rector,JNTU,Ind
More informationEnergy Efficient Session Key Establishment in Wireless Sensor Networks
Energy Effcent Sesson ey Estlshment n Wreless Sensor Networks Y Cheng nd Dhrm P. Agrwl OBR Center for Dstruted nd Mole Computng, Deprtment of ECECS Unversty of Cncnnt, Cncnnt, OH 45 {chengyg, dp}@ececs.uc.edu
More informationPre-distortion Linearization for 64-QAM Modulation in Ka-Band Satellite Link
IJCSNS Interntonl Journl of Computer Scence nd Network Securty, VOL.8 No.8, August 008 47 Pre-dstorton Lnerzton for 64-QAM Modulton n K-Bnd Stellte Lnk P. Sojood Srdrood,, G.R. solt nd P. Prvnd Summry
More informationChapter 7. Analysis of Variance
Deprtment of Appled Mthemtcs Chpter 7. Anlss of Vrnce Defnton The vrle mesured n the experment s clled the response vrle. (In ths chpter, ll response vrles re quntttve vrles.) The response wll e denoted
More informationBnB-ADOPT + with Several Soft Arc Consistency Levels
BnB-ADOPT + wth Severl Soft Arc Consstency Levels Ptrc Guterrez nd Pedro Meseguer Astrct. Dstruted constrnt optmzton prolems cn e solved y BnB-ADOPT +, dstruted synchronous serch lgorthm. In the centrlzed
More informationRough Set Approach for Categorical Data Clustering 1
Interntonl Journl of Dtbse Theory nd Applcton Vol., No., Mrch, Rough Set Approch for Ctegorcl Dt Clusterng Tutut Herwn*, Rozd Ghzl, Iwn Tr Ryd Ynto, nd Mustf Mt Ders Deprtment of Mthemtcs Educton nversts
More informationMAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES
MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion
More informationA Comparison of South East Asian Face Emotion Classification Based on Optimized Ellipse Data Using Clustering Technique
A Comprson of South Est Asn Fce Emoton Clssfcton Bsed on Optmzed Ellpse Dt Usng Clusterng Technque K. Muthukruppn, S. Thrugnnm, R. Ngrjn, M. Rzon, S. Ycob, M. Muthukumrn3, nd T. Rmchndrn3 School of Scence
More informationSemi-quantum private comparison protocol under an. almost-dishonest third party
Sem-quntum prvte comprson protocol under n lmost-dshonest thrd prty Wen-Hn Chou Tzonelh Hwng nd Jun Gu Deprtment of Computer Scence nd nformton Engneerng Ntonl Cheng Kung Unversty No. Unversty Rd. Tnn
More informationSoftware Pipelining for the Pegasus IR
Softwre Ppelnng for the Pegsus IR Cod Hrtwg chrtwg@cs.cmu.edu Ele Krevt ekrevt@cs.cmu.edu Abstrct Modern processors, especll VLIW processors, often hve the blt to eecute multple nstructons smultneousl.
More informationStudent Book SERIES. Fractions. Name
D Student Book Nme Series D Contents Topic Introducing frctions (pp. ) modelling frctions frctions of collection compring nd ordering frctions frction ingo pply Dte completed / / / / / / / / Topic Types
More informationAn Optimal Method for Using Multiple Gateways in Cellular IP Networks
Bond Unversty epublctons@bond Informton Technology ppers Bond Busness School Aprl 2004 An Optml Method for Usng Multple Gtewys n ellulr IP Networks Zheng d Wu Bond Unversty, Zheng_D_Wu@bond.edu.u Follow
More informationMath Circles Finite Automata Question Sheet 3 (Solutions)
Mth Circles Finite Automt Question Sheet 3 (Solutions) Nickols Rollick nrollick@uwterloo.c Novemer 2, 28 Note: These solutions my give you the nswers to ll the prolems, ut they usully won t tell you how
More informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationPerformance Evaluation of Survivable Multifiber WDM Networks
erformnce Evluton of Survvble ultfber WD Networks Yunqu Luo nd Nrwn Ansr Advnced Networkng Lbortory Deprtment of Electrcl nd Computer Engneerng New Jersey Intute of Technology Unvery Heghts, Newrk, NJ
More informationStudent Book SERIES. Patterns and Algebra. Name
E Student Book 3 + 7 5 + 5 Nme Contents Series E Topic Ptterns nd functions (pp. ) identifying nd creting ptterns skip counting completing nd descriing ptterns predicting repeting ptterns predicting growing
More informationReinforcement Learning for Fuzzy Control with Linguistic States
54545454543 Journl of Uncertn Systems ol., No., pp.54-66, 8 Onlne t: www.jus.org.uk Renforcement Lernng for Fuzzy Control wth Lngustc Sttes Mohmmd Hossen Fzel Zrnd,*, Jvd Jouzdn, Mrym Fzel Zrnd Deprtment
More informationMEASURE THE CHARACTERISTIC CURVES RELEVANT TO AN NPN TRANSISTOR
Electricity Electronics Bipolr Trnsistors MEASURE THE HARATERISTI URVES RELEVANT TO AN NPN TRANSISTOR Mesure the input chrcteristic, i.e. the bse current IB s function of the bse emitter voltge UBE. Mesure
More informationCOVERAGE HOLES RECOVERY ALGORITHM BASED ON NODES BALANCE DISTANCE OF UNDERWATER WIRELESS SENSOR NETWORK
INTENATIONAL JOUNAL ON SMAT SENSING AND INTELLIGENT SYSTEMS VOL. 7, NO. 4, DECEMBE 2014 COVEAGE HOLES ECOVEY ALGOITHM BASED ON NODES BALANCE DISTANCE OF UNDEWATE WIELESS SENSO NETWOK Hengchng Jng College
More informationA Novel Control Method for Input Output Harmonic Elimination of the PWM Boost Type Rectifier Under Unbalanced Operating Conditions
A Novel Control Method for nput Output Hrmonc Elmnton of the PWM Boost Type Rectfer Under Unblnced Opertng Condtons A. V. Stnkovc T. A. Lpo Electrcl nd Computer Engneerng Clevelnd Stte Unversty Deprtment
More information10.4 AREAS AND LENGTHS IN POLAR COORDINATES
65 CHAPTER PARAMETRIC EQUATINS AND PLAR CRDINATES.4 AREAS AND LENGTHS IN PLAR CRDINATES In this section we develop the formul for the re of region whose oundry is given y polr eqution. We need to use the
More informationHigh Speed, Low Power And Area Efficient Carry-Select Adder
Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs
More informationUE Centric Coordinated Beamforming in Multi-cell MU-MIMO Systems
UE Centrc Coordnted Bemformng n Mult-cell MU-MIMO Systems Jlng L Yngxue L InterDgtl Communctons LLC Melvlle NY 11747 USA e-ml: jlng.l@nterdgtl.com yngxue.l@nterdgtl.com Astrct User Equpment (UE) centrc
More informationPRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht
68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly
More informationLearning Ensembles of Convolutional Neural Networks
Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)
More informationA Substractive Clustering Based Fuzzy Hybrid Reference Control Design for Transient Response Improvement of PID Controller
IB J. Eng. Sc. Vol. 4, No., 009, 67-86 67 A Substrctve lusterng Bsed Fuzzy Hybrd Reference ontrol Desgn for rnsent Response Improvement of PID ontroller Endr Joelnto & Prlndungn H. Stnggng Instrumentton
More informationInternational Journal of Advanced Research in Engineering and Technology (IJARET), ISSN 0976 INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN 48(Prnt), ISSN 97 499(Onlne) Volume 4, Issue 5, July August (2), IAEME ENGINEERING AND TECHNOLOGY (IJARET) ISSN 97-48 (Prnt) ISSN 97-499 (Onlne) Volume 4,
More informationExercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION
Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You
More informationSuperposition, Thevenin and Norton. Superposition
Superposton, Thevenn nd Norton OUTINE Superposton Thevenn Equvlent Crcut Norton Equvlent Crcut Mxmum Power Theorem ecture 6, 9/1/05 Redng Chpter.6-.8 ecture 6, Slde 1 Superposton A lner crcut s one constructed
More information2-7 Calibration of SAR Probe
Reserch nd Development of Clrton Technology -7 Clrton of SAR Proe Lr HAMADA nd Soch WATANABE The clrton of spefc sorpton rte proe s nmely clrton of the electrc feld mesurement sensor n the phntom lqud
More informationi S1 V IN i C1 i N i C2 i S2
ENGINEERING FOR RURAL DEVELOPMENT Jelgv, 0.-.05.05. VOLTAGE BALANCE CONTROL OF TWO-LEVEL DC-DC CONVERTER Ksprs Krocs, Ugs Srmels, Vesturs Brzs Insttute of Physcl Energetcs; Rg Techncl Unversty kselt@nbox.lv
More informationRobot Deception: Recognizing when a Robot Should Deceive
Robot ecepton: Recognzng when Robot Should eceve ln R. Wgner, Student ember IEEE nd Ronld C. rkn, Fellow IEEE bstrct Ths rtcle explores the possblty of developng robot control softwre cpble of dscernng
More informationCS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005
CS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2005 EXPERIMENT 1 FUNDAMENTALS 1. GOALS : Lern how to develop cr lrm digitl circuit during which the following re introduced : CS2204 l fundmentls, nd
More informationFixation-Image Charts
Fxton-Imge Chrts Kuno Kurzhls, Mrcel Hlwtsch, Mchel Burch, Dnel Weskopf Unversty of Stuttgrt P rc p nt1 2 1 P rc p nt2 3 P rc p nt3 P rc p nt4 c F x ons equenc e Col orl eg end c 1 2 3 4 4 c Fgure 1: Fxton-mge
More informationDesign of Neuro-Fuzzy System Controller for DC Servomotor- Based Satellite Tracking System
IOSR Journl of Electrcl nd Electroncs Engneerng (IOSR-JEEE) e-issn: 78-676,p-ISSN: 3-333, Volume, Issue 4 Ver. III (Jul. Aug. 6), PP 89- www.osrjournls.org Desgn of Neuro-Fuzzy System Controller for DC
More informationGeometric quantities for polar curves
Roerto s Notes on Integrl Clculus Chpter 5: Bsic pplictions of integrtion Section 10 Geometric quntities for polr curves Wht you need to know lredy: How to use integrls to compute res nd lengths of regions
More informationExample. Check that the Jacobian of the transformation to spherical coordinates is
lss, given on Feb 3, 2, for Mth 3, Winter 2 Recll tht the fctor which ppers in chnge of vrible formul when integrting is the Jcobin, which is the determinnt of mtrix of first order prtil derivtives. Exmple.
More informationKirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):
SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween
More informationMulti-beam antennas in a broadband wireless access system
Multi-em ntenns in rodnd wireless ccess system Ulrik Engström, Mrtin Johnsson, nders Derneryd nd jörn Johnnisson ntenn Reserch Center Ericsson Reserch Ericsson SE-4 84 Mölndl Sweden E-mil: ulrik.engstrom@ericsson.com,
More informationCONSTRUCTING MINIMAL ADJACENT DOMINATING SETS IN SEMIGRAPHS FOR CLUSTERING IN WIRELESS NETWORKS
CONSTRUCTING MINIMAL ADJACENT DOMINATING SETS IN SEMIGRAPHS FOR CLUSTERING IN WIRELESS NETWORKS S. Srvnn 1, R. Poovzhk 2 nd N. R. Shnker 3 1 Deprtment of Mthemtcs, R.M.D. Engneerng College, Kvrpett, Tml
More informationPerformance Evaluation of an Optical Packet Scheduling Switch
Performnce Evluton of n Optcl Pcket Schedulng Swtch Kyrkos Vlchos, memer IEEE, Kyrk Seklou nd Emmnuel Vrvrgos Reserch Acdemc Computer echnology Insttute, RA-CI, Unversty of Ptrs, GR-26500, RIO, Ptrs, Greece,
More informationAdaptive modified backpropagation algorithm based on differential errors
Interntonl Journl of Computer Scence, Engneerng nd Applcton (IJCSEA) Vol., No.5, October 20 Adptve modfed bckpropgton lgorthm bed on dfferentl error S.Jeyeel Subvth nd T.Kthrvlvkumr b Deprtment of Informton
More informationTo: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel
To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,
More informationMake Your Math Super Powered
Mke Your Mth Super Powered: Use Gmes, Chllenges, nd Puzzles Where s the fun? Lern Mth Workshop model by prticipting in one nd explore fun nocost/low-cost gmes nd puzzles tht you cn esily bring into your
More informationOn The Study of Establishing a Responsive Infrastructure for a Massively Multiplayer On-Line Game
Assocton for Informton Systems AIS Electronc Lbrry (AISeL) AMCIS 2009 Proceedngs Amercs Conference on Informton Systems (AMCIS) 2009 On The Study of Estblshng Responsve Infrstructure for Mssvely Multplyer
More informationSection 16.3 Double Integrals over General Regions
Section 6.3 Double Integrls over Generl egions Not ever region is rectngle In the lst two sections we considered the problem of integrting function of two vribles over rectngle. This sitution however is
More informationLATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS
LATEST CALIBRATION OF GLONASS P-CODE TIME RECEIVERS A. Fos 1, J. Nwroci 2, nd W. Lewndowsi 3 1 Spce Reserch Centre of Polish Acdemy of Sciences, ul. Brtyc 18A, 00-716 Wrsw, Polnd; E-mil: fos@c.ww.pl; Tel.:
More informationVI.C CIRCUIT BREAKERS
VI.C CIRCUIT BREAKERS DMS #84474 Pge of 28 Revsed : GUIDE FOR DETERMINATION OF CIRCUIT BREAKER LOAD CURRENT CAPABILITY RATINGS PENNSYLVANIA-NEW JERSEY-MARYLAND INTERCONNECTION PLANNING AND ENGINEERING
More informationSOLVING TRIANGLES USING THE SINE AND COSINE RULES
Mthemtics Revision Guides - Solving Generl Tringles - Sine nd Cosine Rules Pge 1 of 17 M.K. HOME TUITION Mthemtics Revision Guides Level: GCSE Higher Tier SOLVING TRIANGLES USING THE SINE AND COSINE RULES
More informationResearch of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b
2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng
More informationTh P5 13 Elastic Envelope Inversion SUMMARY. J.R. Luo* (Xi'an Jiaotong University), R.S. Wu (UC Santa Cruz) & J.H. Gao (Xi'an Jiaotong University)
-4 June 5 IFEMA Madrd h P5 3 Elastc Envelope Inverson J.R. Luo* (X'an Jaotong Unversty), R.S. Wu (UC Santa Cruz) & J.H. Gao (X'an Jaotong Unversty) SUMMARY We developed the elastc envelope nverson method.
More informationOpen Access A Novel Parallel Current-sharing Control Method of Switch Power Supply
Send Orders for Reprints to reprints@enthmscience.e 170 The Open Electricl & Electronic Engineering Journl, 2014, 8, 170-177 Open Access A Novel Prllel Current-shring Control Method of Switch Power Supply
More informationThe Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center
Resource Overview Quntile Mesure: Skill or Concept: 300Q Model the concept of ddition for sums to 10. (QT N 36) Model the concept of sutrction using numers less thn or equl to 10. (QT N 37) Write ddition
More informationWalsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter
Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957
More informationMixed CMOS PTL Adders
Anis do XXVI Congresso d SBC WCOMPA l I Workshop de Computção e Aplicções 14 20 de julho de 2006 Cmpo Grnde, MS Mixed CMOS PTL Adders Déor Mott, Reginldo d N. Tvres Engenhri em Sistems Digitis Universidde
More informationLecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.
Lecture 2 Intro to line integrls Dn Nichols nichols@mth.umss.edu MATH 233, Spring 218 University of Msschusetts April 12, 218 (2) onservtive vector fields We wnt to determine if F P (x, y), Q(x, y) is
More informationOn the Description of Communications Between Software Components with UML
On the Description of Communictions Between Softwre Components with UML Zhiwei An Dennis Peters Fculty of Engineering nd Applied Science Memoril University of Newfoundlnd St. John s NL A1B 3X5 zhiwei@engr.mun.c
More informationDesign and implementation of a high-speed bit-serial SFQ adder based on the binary decision diagram
INSTITUTE OFPHYSICS PUBLISHING Supercond. Sci. Technol. 16 (23) 1497 152 SUPERCONDUCTORSCIENCE AND TECHNOLOGY PII: S953-248(3)67111-3 Design nd implementtion of high-speed it-seril SFQ dder sed on the
More informationTest 2. ECON3161, Game Theory. Tuesday, November 6 th
Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)
More information& Y Connected resistors, Light emitting diode.
& Y Connected resistors, Light emitting diode. Experiment # 02 Ojectives: To get some hndson experience with the physicl instruments. To investigte the equivlent resistors, nd Y connected resistors, nd
More informationCS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates
Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the
More informationAlgorithms for Memory Hierarchies Lecture 14
Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in
More informationSynchronous Generator Line Synchronization
Synchronous Genertor Line Synchroniztion 1 Synchronous Genertor Line Synchroniztion Introduction One issue in power genertion is synchronous genertor strting. Typiclly, synchronous genertor is connected
More informationCHAPTER 2 LITERATURE STUDY
CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:
More informationCONTENTS. 2 Mastering Ukulele
ONENS bout the uthors... 4 INRODUION... 5 hpter he World hordng to Uke 6 Lesson : he Hrmonzed Mjor Scle...6 Lesson : our ypes of 7th hord Inversons...7 Lesson : Mjor nd Mnor 6th Inversons...8 Lesson 4:
More informationFirst Round Solutions Grades 4, 5, and 6
First Round Solutions Grdes 4, 5, nd 1) There re four bsic rectngles not mde up of smller ones There re three more rectngles mde up of two smller ones ech, two rectngles mde up of three smller ones ech,
More informationPRO LIGNO Vol. 11 N pp
THE INFLUENCE OF THE TOOL POINT ANGLE AND FEED RATE ON THE DELAMINATION AT DRILLING OF PRE-LAMINATED PARTICLEBOARD Mihi ISPAS Prof.dr.eng. Trnsilvni University of Brsov Fculty of Wood Engineering Address:
More informationLOW SENSITIVITY DESIGN OF MULTIPLIERLESS ELLIPTIC IIR DIGITAL FILTERS
LOW SENSITIVITY DESIGN OF MULTIPLIERLESS ELLIPTIC IIR DIGITAL FILTERS Vlentn Ilev Anzov Dertment of Telecommunctons, Techncl Unversty of Sof Techncl Unversty, Dertment of Telecommunctons, 1756 Sof, Bulgr,
More informationResearch on error compensation and measurement technology in robot flexible measurement
Reserch on error compenston n mesurement technology n robot flexble mesurement Yong-Je Ren, J-Gu Zhu, Xue-You Yng, Sheng-u Ye Stte Key Lbortory of Precson Mesurng Technology n Instruments Tnjn Unversty,
More informationThe Analysis and Simulation of Robot Kinematics and Dynamics Based on RoboAnalyzer
nterntonl Journl of Emergng echnolog nd Advnced Engneerng Webste: www.ete.com (SSN 5-459, SO 9:8 Certfed Journl, Volume 5, ssue 4, Arl 5 he Anlss nd Smulton of Robot nemtcs nd nmcs Bsed on RoboAnlzer Q
More informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationDEVELOPMENT OF AN EFFICIENT EPILEPSY CLASSIFICATION SYSTEM FROM EEG SIGNALS FOR TELEMEDICINE APPLICATION
Interntonl Journl of Cvl Engneerng nd Technology (IJCIET) Volume 8, Issue 1, December 017, pp. 38 5, Artcle ID: IJCIET_08_1_005 Avlble onlne t http://http://www.eme.com/jcet/ssues.sp?jtype=ijciet&vtype=8&itype=1
More informationPatterns and Algebra
Student Book Series D Mthletis Instnt Workooks Copyright Series D Contents Topi Ptterns nd funtions identifying nd reting ptterns skip ounting ompleting nd desriing ptterns numer ptterns in tles growing
More informationAn iterative approach to an integrated land use and transportation planning tool for small urban areas
Journl of Modern Trnsportton Volume 20, Number 3, September 2012, Pge 160-167 Journl homepge: mt.swtu.edu.cn DOI: 10.1007/BF03325794 1 An tertve pproch to n ntegrted lnd use nd trnsportton plnnng tool
More informationModified Venturini Modulation Method for Matrix Converter Under Unbalanced Input Voltage Conditions
Preprnts (www.preprnts.org) NOT PEER-REVIEWED Posted: 22 y 28 do:.2944/preprnts285.28.v 2 4 5 6 7 8 9 2 4 5 6 7 8 9 2 2 22 2 24 25 26 27 28 29 2 4 5 6 7 8 9 4 4 42 Artcle odfed Venturn odulton ethod for
More informationCross-layer Quality of Service Support for UWB Wireless Multimedia Sensor Networks
Ths full text pper ws peer revewed t the drecton of IEEE Communctons Socety subject mtter experts for publcton n the IEEE INFOCOM 28 proceedngs. Cross-lyer Qulty of Servce Support for UWB Wreless Multmed
More informationThe Dynamic Utilization of Substation Measurements to Maintain Power System Observability
1 The Dynamc Utlzaton of Substaton Measurements to Mantan Power System Observablty Y. Wu, Student Member, IEEE, M. Kezunovc, Fellow, IEEE and T. Kostc, Member, IEEE Abstract-- In a power system State Estmator
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
Hll Ticket No Question Pper Code: AEC009 INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigl, Hyderd - 500 043 MODEL QUESTION PAPER Four Yer B.Tech V Semester End Exmintions, Novemer - 2018 Regultions:
More informationControl of assessment for demersal fish stocks in ICES area: analysis for 36 stocks and investigation of some potential bias sources.
ICES CM 004/K:17 Control of ssessment for demersl fsh stocks n ICES re: nlyss for 36 stocks nd nvestgton of some potentl bs sources. Mre Lesueur, Dder Gscuel nd Trstn Rouyer Abstrct We nlyzed here the
More informationTopic 20: Huffman Coding
Topic 0: Huffmn Coding The uthor should gze t Noh, nd... lern, s they did in the Ark, to crowd gret del of mtter into very smll compss. Sydney Smith, dinburgh Review Agend ncoding Compression Huffmn Coding
More informationProbability and Statistics P(A) Mathletics Instant Workbooks. Copyright
Proility nd Sttistis Student Book - Series K- P(A) Mthletis Instnt Workooks Copyright Student Book - Series K Contents Topis Topi - Review of simple proility Topi - Tree digrms Topi - Proility trees Topi
More informationECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design
ECE 27 Digitl Logic Shifters, Comprtors, Counters, Multipliers Digitl Design..7 Digitl Design Chpter : Slides to ccompny the textbook Digitl Design, First Edition, by Frnk Vhid, John Wiley nd Sons Publishers,
More informationA Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks
Globecom 04 - Wireless Networking Symposium A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Rdio Networks Xingy Liu nd Jing Xie Deprtment of Electricl nd Computer Engineering
More informationEFFECTIVE CURRENT CONTROL DESIGN AND ANALYSIS OF SINGLE PHASE INVERTER FOR POWER QUALITY IMPROVEMENT
VOL., NO. 7, APRIL 5 IN 89-668 ARPN Journl of Engneerng nd Appled cences 6-5 Asn Reserch Publshng Network (ARPN). All rghts reserved. EFFECTIVE CURRENT CONTROL DEIGN AND ANALYI OF INGLE PHAE INVERTER FOR
More information5 October 2015 Stereo Cross-feed Network for Headphones 1 of 12 Copyright 2015 Peter H. Lehmann. All Rights Reserved.
5 Octoer 05 Stereo Cross-feed Network for Hedphones of Copyrght 05 Peter H. ehmnn. All ghts eserved. The Dlemm The vst mjorty of stereo recordngs re engneered for reproducton wth pr of left nd rght chnnel
More informationANNUAL OF NAVIGATION 11/2006
ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton
More informationA Preliminary Study on Targets Association Algorithm of Radar and AIS Using BP Neural Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 5 (2 44 445 A Prelmnary Study on Targets Assocaton Algorthm of Radar and AIS Usng BP Neural Networ Hu Xaoru a, Ln Changchuan a a Navgaton Insttute
More informationPolar Coordinates. July 30, 2014
Polr Coordintes July 3, 4 Sometimes it is more helpful to look t point in the xy-plne not in terms of how fr it is horizontlly nd verticlly (this would men looking t the Crtesin, or rectngulr, coordintes
More informationCONTAINER BERTH SCHEDULING POLICY WITH VARIABLE COST FUNCTION
Contner berth schedulng polcy wth vrble cost functon CONTAINER BERTH SCHEDULING POLICY WITH VARIABLE COST FUNCTION Gols M.M. (correspondng uthor) Assstnt Professor, Deprtment of Cvl Engneerng, Unversty
More informationCHARACTERISTICS OF THE GPS SIGNAL SCINTILLATIONS DURING IONOSPHERIC IRREGULARITIES AND THEIR EFFECTS OVER THE GPS SYSTEM
CHRCTERISTICS OF THE GPS SIGNL SCINTILLTIONS DURING IONOSPHERIC IRREGULRITIES ND THEIR EFFECTS OVER THE GPS SYSTEM Eurico R. de Paula, I.J.Kantor, L.F.C. de Rezende ERONOMY DIVISION NTIONL INSTITUTE FOR
More informationThe Existence, Uniqueness and Error Bounds of Approximation Splines Interpolation for Solving Second-Order Initial Value Problems
Journl of Mtemtcs ttstcs ():-9, 9 IN 9-9 cence Publctons Te Estence, Unqueness Error Bounds of Appromton plnes Interpolton for olvng econd-order Intl Vlue Problems Abbs Y Al Byt, Rostm K eed Frdun K Hm-l
More informationTriangles and parallelograms of equal area in an ellipse
1 Tringles nd prllelogrms of equl re in n ellipse Roert Buonpstore nd Thoms J Osler Mthemtics Deprtment RownUniversity Glssoro, NJ 0808 USA uonp0@studentsrownedu osler@rownedu Introduction In the pper
More informationUNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT
UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word
More information1 tray of toffee 1 bar of toffee. 10 In the decimal number, 0 7, the 7 refers to 7 tenths or
Chpter 3 Deciml Numers Do you know wht DECIMAL is? In chpter, we delt with units, s, 0 s nd 00 s. When you tke single unit nd divide it into (or 0 or 00) its, wht we then hve re deciml frctions of whole
More informationproblems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance
palette of problems Davd Rock and Mary K. Porter 1. If n represents an nteger, whch of the followng expressons yelds the greatest value? n,, n, n, n n. A 60-watt lghtbulb s used for 95 hours before t burns
More informationSynchronous Machine Parameter Measurement
Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions
More information