Soft Set Theoretic Approach for Dimensionality Reduction 1
|
|
- Stephen Jackson
- 6 years ago
- Views:
Transcription
1 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 Soft Set Theoretc pproch for Dmensonlty Reducton Tutut Herwn Rozd Ghzl Mustf Mt Ders Deprtment of Mthemtcs Educton nversts hmd Dhln Yogykrt Indones Fculty of Informton Technology nd Multmed nverst Tun Hussen Onn Mlys Johor Mlys bstrct reduct s subset of ttrbutes tht re ontly suffcent nd ndvdully necessry for preservng prtculr property of gven nformton system The exstng reduct pproches under soft set theory re stll bsed on Boolen-vlued nformton system However n the rel pplctons the dt usully contn non-boolen vlues In ths pper n lterntve pproch for ttrbute reducton n mult-vlued nformton system under soft set theory s presented Bsed on the noton of mult-soft sets nd ND operton ttrbute reducton cn be defned It s shown tht the reducts obtned re equvlent wth Pwlk s rough reducton Keywords: Informton system; Reduct; Soft set theory Introducton In lots of dt nlyss pplctons nformton nd knowledge re stored nd represented n n nformton tble where set of obects s descrbed by set of ttrbutes To ths one prctcl problem s fced: for prtculr property whether ll the ttrbutes n the ttrbute set re lwys necessry to preserve ths property [] sng the entre ttrbute set for descrbng the property s tme-consumng nd the constructed rules my be dffcult to understnd pply or verfy In order to del wth ths problem ttrbute reducton s requred The obectve of reducton s to reduce the number of ttrbutes nd t the sme tme preserve the property of nformton The theory of soft set [] proposed by Molodtsov 999 s new method for hndlng uncertn dt Soft sets re clled (bnry bsc elementry neghborhood systems [] The soft set s mppng from prmeter to the crsp subset of unverse From such cse we my see the structure of soft set cn clssfy the obects nto two clsses (yes/ or no/0 Ths mens tht the stndrd soft set dels wth Boolen-vlued nformton system The theory of soft set hs been ppled to dt nlyss nd decson support systems fundmentl noton supportng such pplctons s the concept of reducts The de of dmensonlty reductons under soft set theory hve been proposed nd compred ncludng the works of [4 8] The restrcton of those technques s tht they re pplcble only for Boolen-vlued nformton systems n erly verson of ths pper ppered n the Proceedng of Interntonl Conference DT 009 held s Prt of the Future Generton Informton Technology Conference FGIT 009 Jeu Islnd Kore December CCIS 64 Sprnger-Verlg pp
2 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 However n the theoretcl nd prctcl reserches of soft sets the stutons re usully very complex nd hence t my not suffce to represent dt n the form of Boolen-vlued nformton systems In the rel pplcton dependng on the set of prmeters gven prmeter my hve dfferent vlues (contn multple grdes For exmple the mthemtcs degree of student cn be clssfed nto three vlues; hgh medum nd low In ths stuton every prmeter determnes prtton of the unverse whch s contns more thn two dsont subsets nlke n Boolen-vlued nformton systems n multvlued nformton systems one cnnot drectly defne the stndrd soft set To ths we proposed the de of mult-soft sets to del mult-vlued nformton systems In ths pper we propose the de of dmensonlty reducton for mult-vlued nformton systems under soft set theory Three mn contrbutons of ths work re s follows: Frstly we present the de of mult-soft sets constructon from mult-vlued nformton system nd ND nd OR opertons on mult-soft sets Secondly we present the pplcblty of the soft set theory for dt reducton under mult-vlued nformton system usng multsets nd ND operton Lstly we show tht reducts obtned usng soft set theory re equvlent to tht rough set theory lthough some results re presented mor prt of ths pper s devoted to revelng nterconnecton between reducton n mult-vlued nformton systems under rough nd soft set theores The rest of ths pper s orgnzed s follows Secton descrbes relted works of dmensonlty reducton under soft set theory Secton descrbes Informton systems nd set pproxmtons Secton 4 descrbes fundmentl soft set theory Secton descrbes reduct n nformton systems usng soft set theory Fnlly we conclude our works n secton 6 Relted Works The de of reduct nd decson mkng usng soft set theory ws frstly proposed by M et l [4] In [4] the pplcton of soft set theory to decson mkng problem wth the help of Pwlk s rough mthemtcs ws presented The reducton pproch presented s usng Pwlk s rough reducton nd decson cn be selected bsed on the mxml weghted vlue mong obects relted to the prmeters Chen et l [-6] presented the prmeterzton reducton of soft sets nd ts pplctons They ponted out tht the results of reducton proposed by M s ncorrect nd observed tht the lgorthms used to compute the soft set reducton nd then to compute the choce vlue to select the optml obects for the decson problem proposed by M re unresonble They lso ponted out tht the de of reduct under rough set theory generlly cnnot be ppled drectly n reduct under soft set theory The de of Chen et l for soft set reducton s only bsed on the optml choce relted to ech obect However the de proposed by Chen s not error free snce the problems of the sub-optml choce s not ddressed To ths Kong et l [7] nlyzed the problem of suboptml choce nd dded prmeter set of soft set Then they ntroduced the defnton of norml prmeter reducton n soft set theory to overcome the problems n Chen s model nd descrbed two new defntons e prmeter mportnt degree nd soft decson prtton nd use them to nlyze the lgorthm of norml prmeter reducton Wth ths pproch the optml nd sub-optml choces re stll preserved Zou [8] proposed new technque for decson mkng of soft set theory under ncomplete nformton systems The de s bsed on the clculton of weghted-verge of ll possble choce vlues of obect nd the weght of ech possble choce vlue s decded by the dstrbuton of other obects For fuzzy soft sets ncomplete dt wll be predcted bsed on the method of verge probblty ll those technques re stll bsed on Boolen nformton systems s to ths dte no reserches hve been done on dmensonlty reducton n mult-vlued nformton systems under soft set theory Snce every rough set [9] cn be consdered s soft set s presented n [0] thus n lterntve 48
3 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 pproch wth potentl for fndng reduct n mult-vlued nformton systems s usng soft set theory Stll t provdes the sme results for rough reducton [ ] Informton Systems nd Set pproxmtons n nformton system s 4-tuple (qudruple S ( where { u u u L s non-empty fnte set of obects { L u s non-empty fnte set of ttrbutes V V V s the domn (vlue set of ttrbute f : V s n nformton functon such tht f( u V clled nformton (knowledge functon for every ( u n nformton system s lso clled knowledge representton systems or n ttrbutevlued system n nformton system cn be ntutvely expressed n terms of n nformton tble (see Tble Tble n nformton system k u f ( u f ( u f u k u f ( u f ( u f u k u f f f ( u u u f ( u f ( u k f ( u M M M O M O M u f( u f( u f ( u f ( u k The complexty for computng n nformton system S ( there re L s snce vlues of f ( u to be computed where L nd Note tht t nduces set of mps t f( u : V tuple t ( f( u f( u f( u L f( u Ech mp s where where L Note tht the tuple t s not necessrly ssocted wth entty unquely (see Exmple 6 In n nformton tble two dstnct enttes could hve the sme tuple representton (duplcted/redundnt tuple whch s not permssble n reltonl dtbses Thus the concept of nformton systems s generlzton of the concept of reltonl dtbses In mny pplctons there s n outcome of clssfcton tht s known Ths posteror knowledge s expressed by one (or more dstngushed ttrbute clled decson ttrbute; the process s known s supervsed lernng n nformton system of ths knd s clled decson system decson system [] s n nformton system of the form D ( { d where d s the decson ttrbute The elements of re clled condton ttrbutes The strtng pont of rough set pproxmtons s the ndscernblty relton whch s generted by nformton bout obects of nterest Two obects n n nformton system re clled ndscernble (ndstngushble or smlr f they hve the sme feture 49
4 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 Defnton (See [] Let S ( be n nformton system nd let B be ny subset of Two elements x y re sd to be B-ndscernble (ndscernble by the set of ttrbute B n S f nd only f f ( x f( y for every B Obvously every subset of nduces unque ndscernblty relton Notce tht n ndscernblty relton nduced by the set of ttrbute B denoted by IND ( B s n equvlence relton It s well known tht n equvlence relton nduces unque prtton B S V f denoted by / B nd the The prtton of nduced by IND n equvlence clss n the prtton / B contnng x denoted by [ x ] B lower nd upper pproxmtons of set cn be defned s follows The notons of Defnton (See [] Let S ( be n nformton system let B be ny subset of nd let X be ny subset of The B-lower pproxmton of X denoted by B ( X nd B-upper pproxmtons of X denoted by B ( X re defned by B( X x [ x] X nd B( X x [ x] I X φ respectvely B { B { The notons of rough pproxmtng of set cn be defned s follows: Defnton Let S ( be n nformton system nd let B be ny subset of rough pproxmton of subset X wth respect to B s defned s pr of lower nd upper pproxmtons of X e Defnton 4 Let S ( ( X B( X B be n nformton system nd let B be ny subsets of n nformton system S ttrbute b B s clled dspensble f / B b / Defnton Let S ( ( { B be n nformton system nd let B be ny subset of n nformton system S The subset B* B s clled reduct of B f B * stsfes the followng condtons: The core of B s defned s b / B* / B / where RED ( B s the set of ll reducts of B ( B* { b / B b B * ( B RED( B I CORE It s known tht the problem of fndng mnml reducts n nformton systems s NP-hrd Exmple 6 For smple exmple of rough reducton we consder smll dtset derved from [] Tble n nformton system from [] 4 low bd loss smll 0
5 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 low good loss lrge hgh good loss medum 4 hgh good loss medum low good proft lrge Let { 4 then we hve / {{{ { 4{ B { nd C { t cuses 4 The core s ( B C { {{{ { 4{ / B / C / CORE I The reducts of re The noton of soft sets nd ts fundmentl opertons re gven n the followng secton Much of the defnton nd exmples re quoted drectly from [4] 4 Soft Set Theory Throughout ths secton refers to n ntl unverse E s set of prmeters ( power set of nd E Defnton 7 (See [] pr gven by P s the F s clled soft set over where F s mppng F : P In other words soft set over s prmeterzed fmly of subsets of the unverse For ε F ( ε my be consdered s the set of ε -elements of the soft set ( F or s the set of ε -pproxmte elements of the soft set Clerly soft set s not (crsp set To llustrte ths de let we consder the followng exmple Exmple 8 Let we consder soft set ( E F whch descrbes the ttrctveness of houses tht Mr X s consderng to purchse Suppose tht there re sx houses n the unverse under consderton nd { h h h h h h E 4 { e e e e e 4 s set of decson prmeters where e stnds for the prmeters expensve e stnds for the prmeters beutful e stnds for the prmeters wooden e 4 stnds for the prmeters chep e stnds for the prmeters n the green surroundng Consder the mppng F : E P 6
6 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 gven by houses( where ( s to be flled n by one of prmeters Suppose tht e E F ( e { h F ( e { h F ( e { h h h F ( e { h h h { h 4 h 4 4 F e h Therefore F ( e mens houses (expensve whose functonl vlue s the set { h 4 Thus we cn vew the soft set ( F E s collecton of pproxmtons s below ( F E { h h4 { h h { h h4 h { h h h expensve houses beutful houses wooden houses chep houses { n the green surroundng houses h h Ech pproxmton hs two prts predcte p nd n pproxmte vlue set v For exmple for the pproxmton expensve houses { h h 4 we hve the predcte nme of expensve houses nd the pproxmte vlue set or vlue set f { h h 4 Thus soft set ( E F cn be vewed s collecton of pproxmtons below: ( F E { p v p v p v L p n v n Tble 4 Tbulr representton of soft set n the bove exmple e e e e 4 e h 0 0 h h 0 0 h h h Defnton 9 (See [4] The clss of ll vlue sets of soft set ( F E s clled vlue-clss of the soft set nd s denoted by C ( F E Clerly C P( F E Proposton 0 If ( F E s soft set over the unverse then ( E nformton system S ( Proof Let ( F E be soft set over the unverse we defne mppng F { f f Where L f : V nd x F( e f x 0 x F( e f n F s Boolen-vlued
7 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 Thus f E V e f f : V nd x F( e f x 0 x F( e : nd f ( x 0 V Ve M x F x F ( e ( e where V { 0 then soft set ( E e F cn be consdered s Boolen-vlued nformton system S V{ 0 f From Proposton 0 t s esly to understnd tht bnry-vlued nformton system cn be represented s soft set Thus we cn mke one-to-one correspondence between ( F E over nd S ( V{ 0 f Proposton Every rough set cn be consdered s soft set Let ( X B( X B B be the rough pproxmtng subset X We defne mppng B : P( P( s n Defnton Thus every rough set ( X B( X consdered pr of two soft sets ( F ( B P( B P( B cn be From the fct tht every rough set cn be consdered s soft set n the followng secton we propose n lterntve pproch for dmensonlty reducton n mult-vlued nformton systems under soft set theory Reduct n Informton Systems usng Soft Set Theory In ths secton we present the pplcblty of soft set theory for fndng reducts We show tht the reducts obtned re equvlent to the rough reducts s n [ ] s for frst step we need trnsformton from mult-vlued nformton system nto mult-soft sets In the mult-soft sets we present the noton of ND nd OR opertons For ttrbute reducton we employ n ND operton nd hve mnged to show tht the reducts obtned re equvlent to rough reducts Mult-soft sets constructon from mult-nformton systems In ths sub-secton we dscuss decomposton of mult-vlued nformton system S V f nto number of bnry-vlued nformton systems The decomposton of S ( nto the dsont- s bsed on decomposton of { L sngleton ttrbute { { { L t ths stge only complete nformton system s gven the consderton Let S ( V f( be n nformton system such tht for every s fnte non-empty set nd for every under th -ttrbute consderton v u f f ( u v such tht nd u f ( u For every v we defne the mp : { 0 V otherwse ( u 0 v v The next result we defne bnry- vlued nformton system s qudruple S V{ 0 f The nformton systems
8 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 S ( f L s referred to s decomposton of mult-vlued V{ 0 nformton system S ( depcted n Fgure Every nformton system S ( nto bnry-vlued nformton systems s determnstc nformton system snce for every L s nd for every u f ( u such tht the structure of mult-vlued nformton system nd number of bnryvlued nformton systems gve the sme vlue of ttrbute relted to obects k u f ( u f ( u f u k u f ( u f ( u f u k u f f f ( u u u f ( u f ( u k f ( u M M M O M O M u f( u f( u f ( u f ( k u Bnry-vlued nformton system- V V V k V n u u u M M M O M O M u M Bnry-vlued nformton system- V V V V k n u u u M M M O M O M u Fgure decomposton of mult-vlued nformton system Bsed on the noton of decomposton of mult-vlued nformton system n the prevous sub-secton n ths sub-secton we present the noton of mult-soft set S V f be mult-vlued representng mult-vlued nformton systems Let nformton system nd S ( L nformton systems From Proposton 0 we hve be the bnry-vlued 4
9 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 S ( S S ( V{ 0 f ( V { 0 S ( V{ f 0 ( F ( F L ( F We defne ( F E ( F ( F L ( F M M ( F ( F M ( F s mult-soft set over unverse representng mult-vlued nformton system S ( Exmple The mult Boolen nformton systems representng Tble 4 s gven below low hgh bd good loss proft smll lrge medum Fgure decomposton of mult-vlued nformton system From Fgure we hve the followng correspondng soft sets
10 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 ( F { low { hgh 4 ( F { bd { good 4 ( F { loss 4{ proft ( 4 { smll { lrge { medum 4 F Thus the mult-soft set representng Tble s ( F (( F ( F ( F ( F 4 { low { hgh 4 { bd { good 4 { loss 4{ proft { smll { lrge { medum 4 ND nd OR opertons n mult-soft sets The notons of ND nd OR opertons n mult-soft sets re gven below Defnton Let( F E ( F : L be mult-soft set over representng mult-vlued nformton system S ( The ND operton between ( F nd ( F s defned s where G ( F ND( F ( F ( V V F V I F V ( V V Exmple From Exmple let two soft-sets nd Then we hve for ( F { low { hgh 4 ( { bd { good 4 F ( F ND( F ( F (( low bd {( low good { ( hgh bd ( hgh good { 4 φ Defnton 4 Let( F E ( F : L mult-vlued nformton system S ( The OR operton between ( ( F s defned s where G be mult-soft set over representng ( F OR( F ( F ( V V F V F V ( V V Exmple From Exmple let two soft-sets for ( { bd { good 4 F F nd 6
11 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 nd ( { loss 4{ proft F Then we hve ( F OR( F ( F ( bd loss { 4( bd proft { ( good loss { 4( good proft { 4 ttrbute reducton In ths secton we propose the de of ttrbutes reducton under soft set theory The proposed pproch s bsed on ND operton n mult-soft sets s descrbed n the prevous secton Defnton 6 Let( F ( F : L mult-vlued nformton system S ( reduct for f C F( b L b C F( L be mult-soft set over representng B Exmple 7 From Exmple let two mult soft-sets set of ttrbutes B s clled ( F { nd ( F { For ( F { where ( F { low { hgh 4 ( F { bd { good 4 nd ( { loss 4{ proft Then we hve 4 F ( F ND( F ND( F ( F ( low bd loss {( low bd proft { ( low good loss { ( low good proft { ( hgh bd loss φ ( hgh bd proft φ ( hgh good loss { 4( hgh good proft { Notce tht F ( {{{ { 4{ C ( b For ( F { 4 where ( { loss 4 { proft ( F 4 { smll { lrge { medum 4 Then we hve F nd ( F ND( F 4 ( F 4 ( losssmll {( loss lrge { ( loss medum { 4 { proft smll φ proft lrge proft medum φ 7
12 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 Notce tht F ( {{{ { 4{ C ( 4 From ( nd ( we hve { nd { 4 re reducts of 6 Concluson The exstng reduct pproches under soft set theory re stll bsed on Boolen-vlued nformton system For the rel pplctons the dt usully contn non-boolen vlued In ths pper n lterntve pproch for ttrbute reductons n mult-vlued nformton systems under soft set theory hs been presented In the proposed pproch the noton of mult-soft set s used to represent mult-vlued nformton systems The ND operton s used n mult-soft sets to present the noton of ttrbute reducton It s founded tht the obtned reducts re equvlent to the rough reducts cknowledgement Ths work ws supported by the grnt of nverst Tun Hussen Onn Mlys References [] Zho Y Luo F Wong SKM nd Yo YY generl defnton of n ttrbute reduct Proceedng of Second Interntonl Conference on Rough Sets nd Knowledge Technology RSKT 007 LNI [] Molodtsov D Soft set theory-frst results Computers nd Mthemtcs wth pplctons [] Yo YY Reltonl nterprettons of neghbourhood opertors nd rough set pproxmton opertors Informton Scences [4] M PK Roy R nd Bsws R n pplcton of soft sets n decson mkng problem Compututer nd Mthemtcs wth pplcton [] Chen D Tsng ECC Yeung DS nd Wng X Some notes on the prmeterzton reducton of soft sets Proceedng of Interntonl Conference on Mchne Lernng nd Cybernetcs 00 IEEE Press [6] Chen D Tsng ECC Yeung DS nd Wng X The Prmeterzton Reducton of Soft Sets nd ts pplctons Computers nd Mthemtcs wth pplctons [7] Kong Z Go L Wng L nd L S The norml prmeter reducton of soft sets nd ts lgorthm Computers nd Mthemtcs wth pplctons [8] Zou Y nd Xo Z Dt nlyss pproches of soft sets under ncomplete nformton Knowledge Bsed Systems [9] Pwlk Z Rough sets Interntonl Journl of Computer nd Informton Scence
13 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 [0] Herwn T nd Mustf MD drect proof of every rough set s soft set Proceedng of Interntonl Conference MS 009 IEEE Press 9-4 [] Pwlk Z Rough sets: theoretcl spect of resonng bout dt Kluwer cdemc Publsher 99 [] Pwlk Z nd Skowron Rudments of rough sets Informton Scences [] Pwlk Z Rough clssfcton Interntonl ournl of humn computer studes [4] M PK Bsws R nd Roy R Soft set theory Computers nd Mthemtcs wth pplctons Tutut Herwn He s PhD cnddte n Dt Mnng t nverst Tun Hussen Onn Mlys (THM Hs reserch re ncludes Dt Mnng KDD nd Rel nlyss Rozd Ghzl She receved her BSc (Hons degree n Computer Scence from nverst Sns Mlys nd MSc degree n Computer Scence from nverst Teknolog Mlys She obtned her PhD degree n Hgher Order Neurl Networks t Lverpool John Moores nversty K She s currently techng stff t Fculty of Informton technology nd Multmed nverst Tun Hussen Onn Mlys (THM Her reserch re ncludes neurl networks fuzzy logc fnncl tme seres predcton nd physcl tme seres forecstng Mustf Mt Ders He receved the BSc from nversty Putr Mlys MSc from nversty of Brdford Englnd nd PhD from nversty Putr Mlys He s professor of computer scence n the Fculty of Informton Technology nd Multmed THM Mlys Hs reserch nterests nclude dstrbuted dtbses dt grd dtbse performnce ssues nd dt mnng He hs publshed more thn 80 ppers n ournls nd conference proceedngs He ws pponted s one of edtorl bord members for Interntonl Journl of Informton Technology World Enformtk Socety revewer of specl ssue on Interntonl Journl of Prllel nd Dstrbuted Dtbses Elsever 004 specl ssue on Interntonl Journl of Cluster Computng Kluwer 004 IEEE conference on Cluster nd Grd Computng held n Chcgo prl 004 nd Mlysn Journl of Computer Scence He hs served s progrm commttee member for numerous nterntonl conferences/workshops ncludng Grd nd Peer-to-Peer Computng (GPP utonomc Dstrbuted Dt nd Storge Systems Mngement (DSM WSES Interntonl ssocton of Scence nd Technology ISTED on Dtbse etc 9
14 Interntonl Journl of Dtbse Theory nd pplcton Vol No June 00 60
Vol. 5, No. 5 May 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
Vol. 5, No. 5 y 04 ISSN 079-8407 Jornl of Emergng Trends n Comptng nd Informton Scences 009-04 CIS Jornl. ll rghts reserved. http://www.csornl.org Notes on lt Soft trces D.Sngh, Onyeozl, I.., 3 lkl..j.,
More informationSequences of Intuitionistic Fuzzy Soft G-Modules
Interntonl Mthemtcl Forum, Vol 13, 2018, no 12, 537-546 HIKARI Ltd, wwwm-hkrcom https://doorg/1012988/mf201881058 Sequences of Intutonstc Fuzzy Soft G-Modules Velyev Kemle nd Huseynov Afq Bku Stte Unversty,
More informationInternational Journal of Pure and Applied Sciences and Technology
Int. J. Pure Appl. Sc. Technol., () (), pp. 44-49 Interntonl Journl of Pure nd Appled Scences nd Technolog ISSN 9-67 Avlle onlne t www.jopst.n Reserch Pper Numercl Soluton for Non-Lner Fredholm Integrl
More informationApplied Statistics Qualifier Examination
Appled Sttstcs Qulfer Exmnton Qul_june_8 Fll 8 Instructons: () The exmnton contns 4 Questons. You re to nswer 3 out of 4 of them. () You my use ny books nd clss notes tht you mght fnd helpful n solvng
More informationA Family of Multivariate Abel Series Distributions. of Order k
Appled Mthemtcl Scences, Vol. 2, 2008, no. 45, 2239-2246 A Fmly of Multvrte Abel Seres Dstrbutons of Order k Rupk Gupt & Kshore K. Ds 2 Fculty of Scence & Technology, The Icf Unversty, Agrtl, Trpur, Ind
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vrtonl nd Approxmte Methods n Appled Mthemtcs - A Perce UBC Lecture 4: Pecewse Cubc Interpolton Compled 6 August 7 In ths lecture we consder pecewse cubc nterpolton n whch cubc polynoml
More informationThe Number of Rows which Equal Certain Row
Interntonl Journl of Algebr, Vol 5, 011, no 30, 1481-1488 he Number of Rows whch Equl Certn Row Ahmd Hbl Deprtment of mthemtcs Fcult of Scences Dmscus unverst Dmscus, Sr hblhmd1@gmlcom Abstrct Let be X
More informationPrinciple Component Analysis
Prncple Component Anlyss Jng Go SUNY Bufflo Why Dmensonlty Reducton? We hve too mny dmensons o reson bout or obtn nsghts from o vsulze oo much nose n the dt Need to reduce them to smller set of fctors
More information4. Eccentric axial loading, cross-section core
. Eccentrc xl lodng, cross-secton core Introducton We re strtng to consder more generl cse when the xl force nd bxl bendng ct smultneousl n the cross-secton of the br. B vrtue of Snt-Vennt s prncple we
More informationA Tri-Valued Belief Network Model for Information Retrieval
December 200 A Tr-Vlued Belef Networ Model for Informton Retrevl Fernndo Ds-Neves Computer Scence Dept. Vrgn Polytechnc Insttute nd Stte Unversty Blcsburg, VA 24060. IR models t Combnng Evdence Grphcl
More informationRemember: Project Proposals are due April 11.
Bonformtcs ecture Notes Announcements Remember: Project Proposls re due Aprl. Clss 22 Aprl 4, 2002 A. Hdden Mrov Models. Defntons Emple - Consder the emple we tled bout n clss lst tme wth the cons. However,
More informationMath 497C Sep 17, Curves and Surfaces Fall 2004, PSU
Mth 497C Sep 17, 004 1 Curves nd Surfces Fll 004, PSU Lecture Notes 3 1.8 The generl defnton of curvture; Fox-Mlnor s Theorem Let α: [, b] R n be curve nd P = {t 0,...,t n } be prtton of [, b], then the
More informationUNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II
Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )
More informationRank One Update And the Google Matrix by Al Bernstein Signal Science, LLC
Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson
More informationKatholieke Universiteit Leuven Department of Computer Science
Updte Rules for Weghted Non-negtve FH*G Fctorzton Peter Peers Phlp Dutré Report CW 440, Aprl 006 Ktholeke Unverstet Leuven Deprtment of Computer Scence Celestjnenln 00A B-3001 Heverlee (Belgum) Updte Rules
More informationThe Schur-Cohn Algorithm
Modelng, Estmton nd Otml Flterng n Sgnl Processng Mohmed Njm Coyrght 8, ISTE Ltd. Aendx F The Schur-Cohn Algorthm In ths endx, our m s to resent the Schur-Cohn lgorthm [] whch s often used s crteron for
More informationLOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER
Yn, S.-P.: Locl Frctonl Lplce Seres Expnson Method for Dffuson THERMAL SCIENCE, Yer 25, Vol. 9, Suppl., pp. S3-S35 S3 LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN
More informationDecomposition of Boolean Function Sets for Boolean Neural Networks
Decomposton of Boolen Functon Sets for Boolen Neurl Netorks Romn Kohut,, Bernd Stenbch Freberg Unverst of Mnng nd Technolog Insttute of Computer Scence Freberg (Schs), Germn Outlne Introducton Boolen Neuron
More informationAttribute reduction theory and approach to concept lattice
Scence n Chn Ser F Informton Scences 2005 Vol48 No6 713 726 713 Attrbute reducton theory nd pproch to concept lttce ZHANG Wenxu 1, WEI Lng 1,2 & QI Jnun 3 1 Insttute for Informton nd System Scences, Fculty
More informationTwo Coefficients of the Dyson Product
Two Coeffcents of the Dyson Product rxv:07.460v mth.co 7 Nov 007 Lun Lv, Guoce Xn, nd Yue Zhou 3,,3 Center for Combntorcs, LPMC TJKLC Nnk Unversty, Tnjn 30007, P.R. Chn lvlun@cfc.nnk.edu.cn gn@nnk.edu.cn
More informationA MODEL OF GRANULAR COMPUTING ON BINARY RELATIONS BASED ON GENERALIZED ROUGH SET AND ITS GRANULATION IN INFORMATION SYSTEM
Journl of Theoretcl nd Aled Informton Technology 28 th Februry 2013 Vol 48 No3 2005-2013 JATIT & LLS All rghts reserved ISSN: 1992-8645 wwwjttorg -ISSN: 1817-3195 A MODL OF GRANULAR COMPUTING ON BINARY
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationStudy of Trapezoidal Fuzzy Linear System of Equations S. M. Bargir 1, *, M. S. Bapat 2, J. D. Yadav 3 1
mercn Interntonl Journl of Reserch n cence Technology Engneerng & Mthemtcs vlble onlne t http://wwwsrnet IN (Prnt: 38-349 IN (Onlne: 38-3580 IN (CD-ROM: 38-369 IJRTEM s refereed ndexed peer-revewed multdscplnry
More informationJens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers
Jens Sebel (Unversty of Appled Scences Kserslutern) An Interctve Introducton to Complex Numbers 1. Introducton We know tht some polynoml equtons do not hve ny solutons on R/. Exmple 1.1: Solve x + 1= for
More informationTHE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR
REVUE D ANALYSE NUMÉRIQUE ET DE THÉORIE DE L APPROXIMATION Tome 32, N o 1, 2003, pp 11 20 THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR TEODORA CĂTINAŞ Abstrct We extend the Sheprd opertor by
More informationResearch Article On the Upper Bounds of Eigenvalues for a Class of Systems of Ordinary Differential Equations with Higher Order
Hndw Publshng Corporton Interntonl Journl of Dfferentl Equtons Volume 0, Artcle ID 7703, pges do:055/0/7703 Reserch Artcle On the Upper Bounds of Egenvlues for Clss of Systems of Ordnry Dfferentl Equtons
More informationReview of linear algebra. Nuno Vasconcelos UCSD
Revew of lner lgebr Nuno Vsconcelos UCSD Vector spces Defnton: vector spce s set H where ddton nd sclr multplcton re defned nd stsf: ) +( + ) (+ )+ 5) λ H 2) + + H 6) 3) H, + 7) λ(λ ) (λλ ) 4) H, - + 8)
More informationDennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1
Denns Brcker, 2001 Dept of Industrl Engneerng The Unversty of Iow MDP: Tx pge 1 A tx serves three djcent towns: A, B, nd C. Ech tme the tx dschrges pssenger, the drver must choose from three possble ctons:
More informationON SIMPSON S INEQUALITY AND APPLICATIONS. 1. Introduction The following inequality is well known in the literature as Simpson s inequality : 2 1 f (4)
ON SIMPSON S INEQUALITY AND APPLICATIONS SS DRAGOMIR, RP AGARWAL, AND P CERONE Abstrct New neultes of Smpson type nd ther pplcton to udrture formule n Numercl Anlyss re gven Introducton The followng neulty
More informationINTRODUCTION TO COMPLEX NUMBERS
INTRODUCTION TO COMPLEX NUMBERS The numers -4, -3, -, -1, 0, 1,, 3, 4 represent the negtve nd postve rel numers termed ntegers. As one frst lerns n mddle school they cn e thought of s unt dstnce spced
More informationJean Fernand Nguema LAMETA UFR Sciences Economiques Montpellier. Abstract
Stochstc domnnce on optml portfolo wth one rsk less nd two rsky ssets Jen Fernnd Nguem LAMETA UFR Scences Economques Montpeller Abstrct The pper provdes restrctons on the nvestor's utlty functon whch re
More informationFINITE NEUTROSOPHIC COMPLEX NUMBERS. W. B. Vasantha Kandasamy Florentin Smarandache
INITE NEUTROSOPHIC COMPLEX NUMBERS W. B. Vsnth Kndsmy lorentn Smrndche ZIP PUBLISHING Oho 11 Ths book cn be ordered from: Zp Publshng 1313 Chespeke Ave. Columbus, Oho 31, USA Toll ree: (61) 85-71 E-ml:
More informationStatistics and Probability Letters
Sttstcs nd Probblty Letters 79 (2009) 105 111 Contents lsts vlble t ScenceDrect Sttstcs nd Probblty Letters journl homepge: www.elsever.com/locte/stpro Lmtng behvour of movng verge processes under ϕ-mxng
More informationPartially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism
CS294-40 Lernng for Rootcs nd Control Lecture 10-9/30/2008 Lecturer: Peter Aeel Prtlly Oservle Systems Scre: Dvd Nchum Lecture outlne POMDP formlsm Pont-sed vlue terton Glol methods: polytree, enumerton,
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationMany-Body Calculations of the Isotope Shift
Mny-Body Clcultons of the Isotope Shft W. R. Johnson Mrch 11, 1 1 Introducton Atomc energy levels re commonly evluted ssumng tht the nucler mss s nfnte. In ths report, we consder correctons to tomc levels
More informationDCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)
DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng
More information523 P a g e. is measured through p. should be slower for lesser values of p and faster for greater values of p. If we set p*
R. Smpth Kumr, R. Kruthk, R. Rdhkrshnn / Interntonl Journl of Engneerng Reserch nd Applctons (IJERA) ISSN: 48-96 www.jer.com Vol., Issue 4, July-August 0, pp.5-58 Constructon Of Mxed Smplng Plns Indexed
More informationComputing a complete histogram of an image in Log(n) steps and minimum expected memory requirements using hypercubes
Computng complete hstogrm of n mge n Log(n) steps nd mnmum expected memory requrements usng hypercubes TAREK M. SOBH School of Engneerng, Unversty of Brdgeport, Connectcut, USA. Abstrct Ths work frst revews
More informationCHI-SQUARE DIVERGENCE AND MINIMIZATION PROBLEM
CHI-SQUARE DIVERGENCE AND MINIMIZATION PROBLEM PRANESH KUMAR AND INDER JEET TANEJA Abstrct The mnmum dcrmnton nformton prncple for the Kullbck-Lebler cross-entropy well known n the lterture In th pper
More information7.2 Volume. A cross section is the shape we get when cutting straight through an object.
7. Volume Let s revew the volume of smple sold, cylnder frst. Cylnder s volume=se re heght. As llustrted n Fgure (). Fgure ( nd (c) re specl cylnders. Fgure () s rght crculr cylnder. Fgure (c) s ox. A
More informationCIS587 - Artificial Intelligence. Uncertainty CIS587 - AI. KB for medical diagnosis. Example.
CIS587 - rtfcl Intellgence Uncertnty K for medcl dgnoss. Exmple. We wnt to uld K system for the dgnoss of pneumon. rolem descrpton: Dsese: pneumon tent symptoms fndngs, l tests: Fever, Cough, leness, WC
More informationLAPLACE TRANSFORM SOLUTION OF THE PROBLEM OF TIME-FRACTIONAL HEAT CONDUCTION IN A TWO-LAYERED SLAB
Journl of Appled Mthemtcs nd Computtonl Mechncs 5, 4(4), 5-3 www.mcm.pcz.pl p-issn 99-9965 DOI:.75/jmcm.5.4. e-issn 353-588 LAPLACE TRANSFORM SOLUTION OF THE PROBLEM OF TIME-FRACTIONAL HEAT CONDUCTION
More informationGroup-based active query selection. for rapid diagnosis in time-critical situations
Group-bsed ctve query selecton for rpd dgnoss n tme-crtcl stutons *Gowthm Belll, Student Member, IEEE, Suresh K. Bhvnn, nd Clyton Scott, Member, IEEE Abstrct In pplctons such s ctve lernng or dsese/fult
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More information90 S.S. Drgomr nd (t b)du(t) =u()(b ) u(t)dt: If we dd the bove two equltes, we get (.) u()(b ) u(t)dt = p(; t)du(t) where p(; t) := for ll ; t [; b]:
RGMIA Reserch Report Collecton, Vol., No. 1, 1999 http://sc.vu.edu.u/οrgm ON THE OSTROWSKI INTEGRAL INEQUALITY FOR LIPSCHITZIAN MAPPINGS AND APPLICATIONS S.S. Drgomr Abstrct. A generlzton of Ostrowsk's
More informationLECTURE 5: LOGICS OF COOPERATION (II) 1.1 Examples of ATL Formulae. 1.2 Extended Example: Train Controller. 1 Alternating-time Temporal Logic
ctr out-of -gte reuest % " F F wll be true untl wll lwys be true 2 gwb nd tb hve jont strtegy for ensurng tht eventully there s pece gwb tb pece mp hs no strtegy for ensurng tht the udence s lwys excted
More informationDynamic Power Management in a Mobile Multimedia System with Guaranteed Quality-of-Service
Dynmc Power Mngement n Moble Multmed System wth Gurnteed Qulty-of-Servce Qnru Qu, Qng Wu, nd Mssoud Pedrm Dept. of Electrcl Engneerng-Systems Unversty of Southern Clforn Los Angeles CA 90089 Outlne! Introducton
More informationA Collaborative Decision Approch for Internet Public Opinion Emergency with Intuitionistic Fuzzy Value
Interntonl Journl of Mngement nd Fuzzy Systems 208; 4(4): 73-80 http://wwwscencepublshnggroupcom/j/jmfs do: 0648/jjmfs20804042 ISSN: 2575-4939 (Prnt); ISSN: 2575-4947 (Onlne) A Collbortve Decson Approch
More informationAnnouncements. Image Formation: Outline. The course. Image Formation and Cameras (cont.)
nnouncements Imge Formton nd Cmers (cont.) ssgnment : Cmer & Lenses, gd Trnsformtons, nd Homogrph wll be posted lter tod. CSE 5 Lecture 5 CS5, Fll CS5, Fll CS5, Fll The course rt : The phscs of mgng rt
More informationDefinition of Tracking
Trckng Defnton of Trckng Trckng: Generte some conclusons bout the moton of the scene, objects, or the cmer, gven sequence of mges. Knowng ths moton, predct where thngs re gong to project n the net mge,
More informationESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus
ESI 34 tmospherc Dnmcs I Lesson 1 Vectors nd Vector lculus Reference: Schum s Outlne Seres: Mthemtcl Hndbook of Formuls nd Tbles Suggested Redng: Mrtn Secton 1 OORDINTE SYSTEMS n orthonorml coordnte sstem
More informationLinear and Nonlinear Optimization
Lner nd Nonlner Optmzton Ynyu Ye Deprtment of Mngement Scence nd Engneerng Stnford Unversty Stnford, CA 9430, U.S.A. http://www.stnford.edu/~yyye http://www.stnford.edu/clss/msnde/ Ynyu Ye, Stnford, MS&E
More informationLecture 22: Logic Synthesis (1)
Lecture 22: Logc Synthess (1) Sldes courtesy o Demng Chen Some sldes Courtesy o Pro. J. Cong o UCLA Outlne Redng Synthess nd optmzton o dgtl crcuts, G. De Mchel, 1994, Secton 2.5-2.5.1 Overvew Boolen lgebr
More informationStatistics 423 Midterm Examination Winter 2009
Sttstcs 43 Mdterm Exmnton Wnter 009 Nme: e-ml: 1. Plese prnt your nme nd e-ml ddress n the bove spces.. Do not turn ths pge untl nstructed to do so. 3. Ths s closed book exmnton. You my hve your hnd clcultor
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson
More informationA New Grey-rough Set Model Based on Interval-Valued Grey Sets
Proceedings of the 009 IEEE Interntionl Conference on Systems Mn nd Cybernetics Sn ntonio TX US - October 009 New Grey-rough Set Model sed on Intervl-Vlued Grey Sets Wu Shunxing Deprtment of utomtion Ximen
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationNumerical Solution of Linear Fredholm Fuzzy Integral Equations by Modified Homotopy Perturbation Method
Austrln Journl of Bsc nd Appled Scences, 4(): 646-643, ISS 99-878 umercl Soluton of Lner Fredholm Fuzzy Integrl Equtons y Modfed Homotopy Perturton Method S.M. Khorsn Ksr, M. Khezerloo, 3 M.H. Dogn Aghcheghloo
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationIntroduction to Numerical Integration Part II
Introducton to umercl Integrton Prt II CS 75/Mth 75 Brn T. Smth, UM, CS Dept. Sprng, 998 4/9/998 qud_ Intro to Gussn Qudrture s eore, the generl tretment chnges the ntegrton prolem to ndng the ntegrl w
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationOnline Appendix to. Mandating Behavioral Conformity in Social Groups with Conformist Members
Onlne Appendx to Mndtng Behvorl Conformty n Socl Groups wth Conformst Members Peter Grzl Andrze Bnk (Correspondng uthor) Deprtment of Economcs, The Wllms School, Wshngton nd Lee Unversty, Lexngton, 4450
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationIdentification of Robot Arm s Joints Time-Varying Stiffness Under Loads
TELKOMNIKA, Vol.10, No.8, December 2012, pp. 2081~2087 e-issn: 2087-278X ccredted by DGHE (DIKTI), Decree No: 51/Dkt/Kep/2010 2081 Identfcton of Robot Arm s Jonts Tme-Vryng Stffness Under Lods Ru Xu 1,
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationGAUSS ELIMINATION. Consider the following system of algebraic linear equations
Numercl Anlyss for Engneers Germn Jordnn Unversty GAUSS ELIMINATION Consder the followng system of lgebrc lner equtons To solve the bove system usng clsscl methods, equton () s subtrcted from equton ()
More informationMultiple view geometry
EECS 442 Computer vson Multple vew geometry Perspectve Structure from Moton - Perspectve structure from moton prolem - mgutes - lgerc methods - Fctorzton methods - Bundle djustment - Self-clrton Redng:
More informationIn this Chapter. Chap. 3 Markov chains and hidden Markov models. Probabilistic Models. Example: CpG Islands
In ths Chpter Chp. 3 Mrov chns nd hdden Mrov models Bontellgence bortory School of Computer Sc. & Eng. Seoul Ntonl Unversty Seoul 5-74, Kore The probblstc model for sequence nlyss HMM (hdden Mrov model)
More informationChapter 2 Introduction to Algebra. Dr. Chih-Peng Li ( 李 )
Chpter Introducton to Algebr Dr. Chh-Peng L 李 Outlne Groups Felds Bnry Feld Arthetc Constructon of Glos Feld Bsc Propertes of Glos Feld Coputtons Usng Glos Feld Arthetc Vector Spces Groups 3 Let G be set
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationMixed Type Duality for Multiobjective Variational Problems
Ž. ournl of Mthemtcl Anlyss nd Applctons 252, 571 586 2000 do:10.1006 m.2000.7000, vlle onlne t http: www.delrry.com on Mxed Type Dulty for Multoectve Vrtonl Prolems R. N. Mukheree nd Ch. Purnchndr Ro
More informationCRITICAL PATH ANALYSIS IN A PROJECT NETWORK USING RANKING METHOD IN INTUITIONISTIC FUZZY ENVIRONMENT R. Sophia Porchelvi 1, G.
Interntonl Journl of dvnce eserch IJO.or ISSN 0-94 4 Interntonl Journl of dvnce eserch IJO.or Volume Issue Mrch 05 Onlne: ISSN 0-94 CITICL PTH NLYSIS IN POJECT NETWOK USING NKING METHOD IN INTUITIONISTIC
More informationCHOVER-TYPE LAWS OF THE ITERATED LOGARITHM FOR WEIGHTED SUMS OF ρ -MIXING SEQUENCES
CHOVER-TYPE LAWS OF THE ITERATED LOGARITHM FOR WEIGHTED SUMS OF ρ -MIXING SEQUENCES GUANG-HUI CAI Receved 24 September 2004; Revsed 3 My 2005; Accepted 3 My 2005 To derve Bum-Ktz-type result, we estblsh
More informationNon-Linear Data for Neural Networks Training and Testing
Proceedngs of the 4th WSEAS Int Conf on Informton Securty, Communctons nd Computers, Tenerfe, Spn, December 6-8, 005 (pp466-47) Non-Lner Dt for Neurl Networks Trnng nd Testng ABDEL LATIF ABU-DALHOUM MOHAMMED
More informationSmart Motorways HADECS 3 and what it means for your drivers
Vehcle Rentl Smrt Motorwys HADECS 3 nd wht t mens for your drvers Vehcle Rentl Smrt Motorwys HADECS 3 nd wht t mens for your drvers You my hve seen some news rtcles bout the ntroducton of Hghwys Englnd
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationANALOG CIRCUIT SIMULATION BY STATE VARIABLE METHOD
U.P.B. Sc. Bull., Seres C, Vol. 77, Iss., 25 ISSN 226-5 ANAOG CIRCUIT SIMUATION BY STATE VARIABE METHOD Rodc VOICUESCU, Mh IORDACHE 22 An nlog crcut smulton method, bsed on the stte euton pproch, s presented.
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationVariable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia
Vrble tme mpltude mplfcton nd quntum lgorthms for lner lgebr Andrs Ambns Unversty of Ltv Tlk outlne. ew verson of mpltude mplfcton;. Quntum lgorthm for testng f A s sngulr; 3. Quntum lgorthm for solvng
More informationVyacheslav Telnin. Search for New Numbers.
Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which
More informationMobility Determination of Displacement Set Fully Parallel Platforms.
12th IFToMM World Congress, Besnçon, June 18-21, 2007 Moblty Determnton of Dsplcement Set Fully Prllel Pltforms. José M. Rco Λ, J. Jesús Cervntes y, Jun Roch z Gerrdo I. Pérez x Alendro Tdeo. FIMEE, Unversdd
More informationChapter 5 Supplemental Text Material R S T. ij i j ij ijk
Chpter 5 Supplementl Text Mterl 5-. Expected Men Squres n the Two-fctor Fctorl Consder the two-fctor fxed effects model y = µ + τ + β + ( τβ) + ε k R S T =,,, =,,, k =,,, n gven s Equton (5-) n the textook.
More informationINTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek
ELM Numercl Anlss Dr Muhrrem Mercmek INTEPOLATION ELM Numercl Anlss Some of the contents re dopted from Lurene V. Fusett, Appled Numercl Anlss usng MATLAB. Prentce Hll Inc., 999 ELM Numercl Anlss Dr Muhrrem
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationOnline Stochastic Matching: New Algorithms with Better Bounds
Onlne Stochstc Mtchng: New Algorthms wth Better Bounds Ptrck Jllet Xn Lu My 202; revsed Jnury 203, June 203 Abstrct We consder vrnts of the onlne stochstc bprtte mtchng problem motvted by Internet dvertsng
More informationZbus 1.0 Introduction The Zbus is the inverse of the Ybus, i.e., (1) Since we know that
us. Introducton he us s the nverse of the us,.e., () Snce we now tht nd therefore then I V () V I () V I (4) So us reltes the nodl current njectons to the nodl voltges, s seen n (4). In developng the power
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationM/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ
M/G//GD/ / System! Pollcze-Khnchn (PK) Equton L q 2 2 λ σ s 2( + ρ ρ! Stedy-stte probbltes! π 0 ρ! Fndng L, q, ) 2 2 M/M/R/GD/K/K System! Drw the trnston dgrm! Derve the stedy-stte probbltes:! Fnd L,L
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationQuiz: Experimental Physics Lab-I
Mxmum Mrks: 18 Totl tme llowed: 35 mn Quz: Expermentl Physcs Lb-I Nme: Roll no: Attempt ll questons. 1. In n experment, bll of mss 100 g s dropped from heght of 65 cm nto the snd contner, the mpct s clled
More informationLecture 36. Finite Element Methods
CE 60: Numercl Methods Lecture 36 Fnte Element Methods Course Coordntor: Dr. Suresh A. Krth, Assocte Professor, Deprtment of Cvl Engneerng, IIT Guwht. In the lst clss, we dscussed on the ppromte methods
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationPoint-based methods for estimating the length of a parametric curve
Journl of Computtonl nd Appled Mthemtcs 196 (006) 51 5 www.elsever.com/locte/cm Pont-bsed methods for estmtng the length of prmetrc curve Mchel S. Floter, Atgerr F. Rsmussen CMA, Unversty of Oslo, P.O.
More informationDemand. Demand and Comparative Statics. Graphically. Marshallian Demand. ECON 370: Microeconomic Theory Summer 2004 Rice University Stanley Gilbert
Demnd Demnd nd Comrtve Sttcs ECON 370: Mcroeconomc Theory Summer 004 Rce Unversty Stnley Glbert Usng the tools we hve develoed u to ths ont, we cn now determne demnd for n ndvdul consumer We seek demnd
More informationImproving Anytime Point-Based Value Iteration Using Principled Point Selections
In In Proceedngs of the Twenteth Interntonl Jont Conference on Artfcl Intellgence (IJCAI-7) Improvng Anytme Pont-Bsed Vlue Iterton Usng Prncpled Pont Selectons Mchel R. Jmes, Mchel E. Smples, nd Dmtr A.
More information