Time Synchronization in WSN: A survey Vikram Singh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamirpur, India
|
|
- Monica Grant
- 6 years ago
- Views:
Transcription
1 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: Tme Synhronzaton n WSN: A survey Vkram Sngh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamrpur, Inda Abstrat: Wreless sensor networks have emerged as an mportant and promsng researh area n the reent years. They are a speal type of ad-ho networks, where wreless deves ollaborate wth other deves to send data to the destnaton. The nodes ollet the sensed data, proess them, and transmt that data over the ommunaton hannel, whh s broadast by nature. Synhronzaton s an mportant ssue for wreless sensor networks beause temporal oordnaton s requred for many of the ollaboratve tasks they perform. E.g. For the task of Data Fuson, n objet trakng and veloty estmaton, n settng the sleep modes of the varous nodes so that the battery lfe s prolonged, et.. There are several synhronzaton shemes whh have been put forward tll date. In ths paper, the shemes exstng presently have been desrbed. I. INTRODUCTION The advanement n the tehnology has enabled the development of tny deves whh are apable of sensng, proessng, and ommunatng wth eah other. Wreless Sensor Networks are a speal type of ad-ho networks, where tny wreless deves ollaborate wth other deves to send data to the destnaton n a mult-hop ommunaton envronment. These deves or nodes have ther own haratersts suh as energy onstrants, nexpensve, small n sze, unrelable, et. These nodes ollet the sensed data, proess them, and transmt that data over the ommunaton hannel, whh s broadast by nature. Synhronzaton s an mportant ssue for wreless sensor networks beause temporal oordnaton s requred for many of the ollaboratve tasks they perform. E.g. For the task of Data Fuson, n objet trakng and veloty estmaton, n settng the sleep modes of the varous nodes so that the battery lfe s prolonged, et.. There are several requrements that determne what knd of synhronzaton tehnque to use. Some of them are: Energy effeny: The synhronzaton tehnque should take nto onsderaton the lmted energy resoures avalable. Energy s the most mportant fator beause the sensors work on batteres and the replaement of the batteres s dffult, or even mpossble n many stuatons. Salablty: Synhronzaton sheme should also sale well wth the network sze. As the sensor nodes nreases/dereases the synhronzaton sheme should be able to sustan the hange n topology. Preson: Some applatons mght need mroseond auray whle others may just requre the orderng of the events. So, aordng to the requrement, the approprate sheme an be used. Robustness: Synhronzaton sheme should be robust aganst the lnk and node falures. For ths purpose, several sensor nodes are deployed n a relatvely smaller area as ompared to other networks. Lfetme: Lfetme dedes whether the synhronzaton s needed for an nstant, or for the entre lfetme of the network. Synhronzaton for the longer perod of tme mght requre regular synhronzaton. Sope: The sope dedes whether the sheme provdes the network wde External Synhronzaton or only loal synhronzaton among the nodes whh are spatally lose. Cost: How muh ost s nurred whle deployng the sheme. The ost should not exeed too muh beause of the reason that the sensors may be deployed n harsh ondtons, and thus may be prone to falures. Sne the sensor networks are often deployed n remote areas, t s better not to rely on the sophstated hardware nfrastrutures lke GPS reevers. Rather, an nternal synhronzaton s enough f mplemented approprately. But, there are some hallenges to the wreless synhronzaton suh as nondetermnst delays. When a node sends a tmestamp value to another node, the paket may fae a varable amount of delay before t reahes the reever. Ths delay mght prevent the two nodes to be synhronzed aurately. Some of the soures of errors are: Send Tme: It onssts of the tme spent n onstrutng the message and transferrng to the network nterfae. Also nludes the kernel proessng, operatng system overheads lke ontext swth, et. Aess Tme: It s the tme taken to aess the transmt hannel. The reasons for the delay ould be watng for the hannel to be dle, watng for ts slot to transmt, et. Ths depends on the type of MAC sheme used. Transmsson/Reepton Tme: Tme taken to send/reeve the message bt-by-bt at the physal layer. Depends on Page 61
2 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: the paket sze and the baud rate of the transmsson. Propagaton Tme: Tme taken to propagate the message from the sender to the reever. Ths s small enough n most ases to be gnored from lateny estmatons. Reeve Tme: Tme taken to notfy the host about the reepton of the message by the network nterfae. II. SYNCHRONIZATION TYPES By tme synhronzaton, we mean that eah and every lok n the network shows the same tme. There are two approahes to aheve ths goal. One s the External Synhronzaton and the other s the Internal Synhronzaton. In the External Synhronzaton, the nodes get the tme from some external soure of the standard tme. Ths type of synhronzaton s also known as Global Synhronzaton. But ahevng suh knd of synhronzaton an be expensve beause t wll requre that some sophstated deves, lke GPS reevers, be attahed to the sensor nodes. And ths requrement an lead to a very expensve deployment of the network. So, another type of synhronzaton an be employed, whh s the Internal Synhronzaton. In ths, the nodes agree on a partular tme for a network, although they may not agree to the global tme. Ths method s muh eonomal and doesn t even requre ostly deves attahed to the nodes. III. CLOCK MODEL Tme Synhronzaton ams at provdng a ommon tme sale for the loks of the nodes n the network. But the loks are not perfet and so the keep on drftng away from eah other over the tme. Therefore the loks that have even been synhronzed one may show dfferent tme after some tme. In software, a lok C (t) s desrbed as: C t where, s the skew rate of the lok and determnes how muh tme the lok wll gan or lose over a gven perod and s the offset, whh determnes the varaton from the real tme. For a perfet lok, the skew rate s 1. In realty, skew rate s not stat over tme. Therefore a synhronzaton sheme should equalze the lok rates as well as offsets, and then should repeatedly orret the offsets to keep the loks synhronzed over a tme perod. A tolerane value n parts per mllon (PPM) s also spefed by the manufaturers, whh determnes the maxmum amount that the skew rate wll devate from Referene Broadast Synhronzaton IV. EXISTING SCHEMES Ths sheme was proposed by Elson, Grod and Estrn n the year In ths sheme, the nodes transmt referene beaons to ther neghbors va physal-layer broadast. Ths broadast doesn t ontan any tmestamp expltly. In fat the arrval tme of the beaon s onsdered as the pont of referene for omparng the loks. Dong so removes the Send Tme and the Aess Tme from the rtal path. In RBS, the rtal path length s the tme from the njeton of the paket nto the hannel to the last lok read. Thus, ths sheme removes the sender s nondetermnsm from the rtal path as shown n the fg 1. Any extant broadast an be used to get the tmng nformaton. No dedated tmesyn paket broadast s needed. Page 62
3 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: Estmaton of Phase Offset: The smplest form of RBS s the broadast of a sngle pulse to two reevers, allowng them to estmate ther relatve phase offsets. That s: 1. A transmtter broadasts a referene paket to two reevers ( and j). 2. Eah reever reords the tme that the referene was reeved, aordng to ts loal lok. 3. The reevers exhange ther observatons. Advantages: 1. The largest soures of nondetermnst lateny an be removed from the rtal path by usng the broadast hannel to synhronze reevers wth one another. Ths results n better preson. 2. Multple broadasts allow tghter synhronzaton. 3. RBS an work usng loal tmestamps. Absolute tme referene s not requred. Ths sheme has some lmtatons too. Ths sheme works n a network whh has a physal broadast hannel. But t annot be used n the networks whh employ pont-to-pont lnks. 2. Tmng-syn Protool for Sensor Networks Ths sheme was proposed by Ganerwal et.al. n the year Ths protool ams at provdng network-wde synhronzaton. The dfferene between RBS and Tmng-syn Protool for Sensor Networks (TPSN) s that TPSN uses the lassal approah of sender-reever synhronzaton whereas RBS uses the approah of reever-reever synhronzaton. In TPSN, ntally a herarhal topology s reated. A level s assgned to eah node n that herarhal struture. The node assgned the level 0 s known as root node. Ths establshng of the herarhal struture s alled level dsovery phase. The root node then ntates the seond stage of the sheme whh s known as synhronzaton phase. In ths phase, a level node wll synhronze to a level -1 node. Eventually all the nodes n the herarhal struture wll be synhronzed. The root node an be hosen usng some leader eleton algorthm. Level Dsovery Phase: Ths s the frst phase and starts when the network s deployed. The root node s assgned the level 0 and t then ntates ths phase by broadastng a level_dsovery paket. Ths paket ontans the dentty and the level of the sender. The mmedate neghbors reeve ths paket and assgn themselves one level greater than the sender s level. After assgnng themselves a level, they too broadast the level_dsovery paket ontanng ther own level. The proess ontnues and eah node s assgned a level. One assgned a level, suh pakets are negleted to hek the ongeston. Synhronzaton Phase: A two-way message exhange s used n ths phase. Here, T1, T4 represent the tme measured by loal lok of A. Smlarly T2, T3 represent the tme measured by loal lok of B. At tme T1, A sends a synhronzaton pulse paket ontanng ts level number and the value of T1 to B. Node B reeves the paket at tme T2 where T2 s equal to T1 + + d. Here and d represents the lok drft between the two nodes and propagaton delay respetvely. At tme T3, node B sends an aknowledgement paket ontanng the level of B and the values of T1, T2, and T3 to node A. Node A reeves the paket at tme T4. Now node A an alulate the lok drft and propagaton delay as follow: ( T 2 T1) ( T 4 T3) ( T 2 T1) ( T 4 T3) ; d 2 2 Calulatng the drft, node A an orret ts lok aordngly, and an get synhronzed to node B. Ths approah s alled sender-ntated approah beause the sender synhronzed tself to the reever. Page 63
4 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: The message exhange handshake begns after the root node ntates the phase by broadastng a synhronzaton paket. Nodes at level 1 on reevng the paket ntates the two-way message exhange. They may take some random tme before ntatng the two-way message exhange to avod the ontenton n medum aess. On reevng bak an aknowledgement, these nodes adjust ther loks to the root node. On reevng the message exhange, the level 2 nodes bak off for some random tme and then ntate the message exhange wth nodes n level 1. Ths proess ontnues and eventually all the nodes get synhronzed to the root node. If an eleted root node des, the level 1 nodes won t reeve any aknowledgement paket and hene tmeout wll our. A leader eleton s run and a new root s eleted. And then the level dsovery phase s restarted. 3. Lghtweght Tree-based Synhronzaton (LTS) Ths sheme was proposed by Greunen and Rabaey. The am s not to maxmze the auray, but to mnmze the omplexty of synhronzaton. The authors beleve that the auray needed n sensor networks s relatvely low. Two LTS algorthms have been proposed for multhop synhronzaton of the network. Both these algorthms requre the nodes to synhronze to some referene ponts suh as a snk node. Frst algorthm: It s a entralzed algorthm. A spannng tree s onstruted frst and then the nodes are synhronzed along the (n-1) edges of the spannng tree. The root of the spannng tree s the referene node and s responsble for ntatng the synhronzaton. The depth of the spannng tree affets the tme to synhronze the whole network. Therefore, the depth s ommunated bak to the root node so that s an use ths nformaton n ts resynhronzaton tme deson. Seond algorthm: The seond algorthm works n a dstrbuted manner. Eah node an dede the tme for ts own synhronzaton. Spannng tree struture s not used n ths algorthm. When a node A needs to be synhronzed, t sends a synhronzaton request to the losest referene node. All the nodes along the path from the node A to the referene node must be synhronzed before the node A s synhronzed. The advantage of ths sheme s that some nodes may not need frequent synhronzaton. And sne n ths sheme, the nodes dede of ther own synhronzaton, unneessary synhronzaton efforts are saved. Also t may boost the number of parwse synhronzatons, sne for eah request, all nodes along the path from referene node to the ntator of resynhronzaton need to be synhronzed. The synhronzaton requests an be aggregated also to redue the wastage of resoures. 4. Floodng Tme Synhronzaton Protool (FTSP) Ths sheme was proposed by Marot et.al n the year Ths sheme provdes mult-hop synhronzaton. The root node, whh s dynamally eleted node, mantans the global tme and all other nodes synhronze ther loks to that of the root. An ad-ho struture s formed by the node to transfer the global tme from the root to all the nodes. Spannng tree s not formed n ths sheme. Ths saves the ntal phase of establshng the tree and s more robust aganst node and lnk falures and dynam topology hanges. Mult-hop Synhronzaton: Every node n the network has a unque ID. A node broadasts a synhronzaton message n order to synhronze other nodes. Ths synhronzaton message ontans three felds: the tmestamp, the rootid, and the seqnum. The tmestamp ontans the global tme estmate of the transmtter when the message was broadasted. The rootid feld ontans the ID of the root, as known by the sender of the message. The seqnum s a sequene number set and nremented by the root when a new synhronzaton round s ntated. Eah node mantans a hghestseqnum for the purpose of adng message flterng. Eah node has one more varable, known as myrootid. Ths varable ontans the rootid as know by the node. The synhronzaton message whh s then reeved an be used to reate a referene pont only f the rootid feld of the message s less than or equal to myrootid, and the seqnum feld s greater than the hghestseqnum n ase the rootid=myrootid. 5. Global Clok Synhronzaton n Sensor Networks Ths sheme was proposed by Q. L et al. n the year Ths paper ams at the global synhronzaton n a sensor network. Four methods have been dsussed: 1. The all-node-based method 2. The luster-based method 3. The fully loalzed dffuson-based method 4. The fault-tolerant dffuson-based method. Page 64
5 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: The all-node-based method: Ths method s used on all the nodes n the system and t s most effetve when the sze of the sensor network s relatvely small. The key dea s to send a message along a loop and reord the ntal tme and the end tme of the message. Then, by usng the message travelng tme, the tme n dfferent segments of the loop an be averaged whh wll smooth over the error of the loks. In order to synhronze the entre network, paths need to be desgned so that they ontan all the nodes. The synhronzaton s dvded nto two phases. In the frst phase, a synhronzaton paket s sent along a rng. The ntatng node of the paket reords ts loal startng tme and the endng tme of the paket. Eah other node smply forwards the paket and reords how many hops the paket had traveled thus far. In the seond phase, a lok orreton paket s sent along the same rng. Ths paket nforms eah node of the paket startng and endng tme for the ntatng node and the total hops n the yle. Eah node then omputes ts lok adjustment. The luster-based synhronzaton: In ths, same method s used to synhronze all the luster heads by desgnng a message path that ontans all the luster heads. Then, n the seond step, the nodes n eah luster an be synhronzed wth ther head. The dffuson method: The man dea here s to average all the lok tme readngs and set eah lok to the average tme. A node wth hgh lok tme readng dffuses that tme value to ts neghbors and levels down ts lok tme. A node wth low tme readng absorbs some of the values from ts neghbors and nreases ts value. After a ertan number of rounds of the dffuson, the lok n the network wll have the same value. The fault-tolerant method: In ths some nodes are onsdered as tamper-proof (alled N nodes), and other normal nodes are alled M nodes. A tamper-proof node wll destroy tself one t s ompromsed. Ths guarantees that an N node an always be trusted. Four bas operatons are there: 1. Neghbor dsovery: Neghbor dsovery for an N node means fndng all the neghbors that are shared wth another N node. 2. Beaon broadast: In beaon broadast operaton, an N node A broadasts a synhronzaton message to all ts neghbors so that eah of ts neghbors wll reord the urrent lok readng. 3. The ollet operaton: The ollet operaton s a omposte proess n whh all the neghbors that reeve the broadast send A ther lok readngs. 4. Broadast of the average value: In the last step, A broadasts the average value to all the neghborng nodes and all good neghborng nodes wll have a new value after they authentate the message. 6. Fault-Tolerant FTSP Protool for Wreless Sensor Networks Ths protool, proposed by L. Gheorghe et al. n the year 2010 s a modfaton of the Floodng Tme Synhronzaton Protool so that t provdes the synhronzaton even n the presene of malous nodes. It nludes three steps: Fault deteton, askng for help, and reevng help and deson. Fault Deteton: In ths proess the node beomes aware that t has reeved an nonsstent lok value, whh mght be very dfferent than the other prevously reeved values. Ths value s represented by havng a onstant value alled the TIME_ERROR_LIMIT that s the maxmum dfferene between sequental reeved global tmes. Askng for help: Ths s the seond step of ths protool. When a sensor node reeves a referene pont that s not ompatble wth ts prevous tme estmates, t stores the loal tme and sends a broadast message that ontans a request for the latest global tme reeved from a synhronzed node. The neghbors reply wth the global tme from the last stored referene pont. Reevng help and deson: Ths step dedes whether the value was atually faulty or not. If the value was not faulty, the regresson table s erased and the new value s stored. Otherwse, a new omputed referene pont wll be nserted nto the regresson table. The synhronzaton message here nludes the followng felds: tmestamp, rootid, seqnum, type and fronterid. The type for normal synhronzaton message s 0. The synhronzaton root sends synhronzaton messages wth a fronterid of 1, meanng that t s transmttng to nodes n the frst fronter. The nodes n the frst fronter send synhronzaton messages wth a fronterid of 2, and so on. The nodes on a ertan fronter store the fronterid reeved n a varable alled my FronterID and they send synhronzaton messages wth the value of (myfronterid+1). Page 65
6 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: 7. Consensus Clok Synhronzaton for Wreless Sensor Networks Ths paper was proposed by M. K. Maggs et al. n the year Instead of tryng to synhronze to an external referene lke absolute tme t or UTC, the CCS protool ams to aheve an nternal onsensus wthn the network on what tme s, and how fast t travels. Wth eah synhronzaton round the CCS algorthm updates the ompensaton parameters for eah node and over tme the network loks onverge to a onsensus. lm Cˆ C t Ths onsensus lok s not a physal lok. It s a vrtual lok that s generated from the network of nodes runnng the CSS algorthm. Ths lok has ts own skew rate and offset relatve to the absolute tme. By expandng the lok funtons from both sdes we get the ompensaton parameters that all nodes must obtan n order to synhronze to the onsensus lok. lm t ˆ t t ˆ lm ˆ t lm ˆ t The CCS algorthm s repeated n synhronzaton rounds, whh basally onssts of two man tasks: offset ompensaton, and skew ompensaton. Offset ompensaton: In ths phase, nodes exhange loal lok readngs whh are used to synhronze nodes to a ommon tme. The goal s to remove the offset error from all the loks n the network. For ths, eah node tres to aurately estmate the nstantaneous average tme of all the loks n the network, as gven below, and set ther loks to ths tme. N 1 C C N 1 Skew ompensaton: In ths, the nodes teratvely ompare the results from the urrent and prevous synhronzaton round n order to mprove ther skew ompensaton parameter. The goal here s to ensure all ompensated loks n the network tk at the same rate. That means lm, t ˆ For perfet offset ompensaton the skew rate of the onsensus lok s gven by: N 1 N 1 However n realty, paket losses & the random transmsson order of the nodes affets the fnal onsensus skew rate Table 1: A omparson hart of varous shemes s shown above Shemes Energy effeny Complexty Salablty Fault Tolerane RBS hgh hgh good no TPSN hgh low poor no LTS hgh low average no FTSP hgh hgh average no Global lok synhronzaton n sensor networks All-node-based low low very poor no Dffuson-based average hgh good yes Fault tolerant FTSP average hgh average yes Consensus lok synhronzaton for WSN hgh low good yes Page 66
7 Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: CONCLUSION Synhronzaton n a dstrbuted system suh as Wreless Sensor Network s neessary for ts effetve funtonng. The problem of synhronzaton s not new. Several shemes have been proposed tll now. Ths paper presents some of the synhronzaton shemes whh have been proposed tll date. REFERENCES [1]. M. K. Maggs, S. G. Keefe, and D. V. Thel, Consensus Clok Synhronzaton for Wreless Sensor Networks, n Pro. IEEE Sensors Journal, vol. 12, no. 6, June [2]. W. Su and I. Akyldz, Tme-dffuson synhronzaton protool for wreless sensor networks, IEEE/ACM Trans. Netw., vol. 13, no. 2, Apr [3]. L. Shenato and G. Gamba, A dstrbuted onsensus protool for lok synhronzaton n wreless sensor network, n Pro. 46th IEEE Conf. Des. Control, New Orleans, LA, De [4]. Q. L and D. Rus, Global lok synhronzaton n sensor networks, n Pro. IEEE Conf. Comput. Commun., vol. 1. Hong Kong, Chna, Mar. 2004, pp [5]. M. Marot, G. Smon, B. Kusy, and A. Ledez, The floodng tme synhronzaton protool, n Pro. 2nd Int. Conf. Embed. Netw. Sensor Syst., Baltmore, MD, Nov. 2004, pp [6]. J. Elson, L. Grod, and D. Estrn, Fnegraned network tme synhronzaton usng referene broadasts, n Pro. 5th Symp. Operat. Syst. Desgn Implement., vol. 36. De. 2002, pp [7]. M. Shtu and C. Veerarttphan, Smple, aurate tme synhronzaton for wreless sensor networks, n Pro. IEEE Wreless Commun.Netw. Conf., Mar. 2003, pp [8]. S. Ganerwal, R. Kumar, and M. Srvastava, Tmng-syn protool for sensor networks, n Pro. 1st ACM Conf. Embed. Netw. Sensor Syst., Nov. 2003, pp [9]. F. Svrkaya and B. Yener, Tme synhronzaton n sensor networks: Asurvey, IEEE Netw., vol. 18, no. 4, pp , Jul. Aug [10]. H. Kopetz and W. Ohsenreter, Clok synhronzaton n dstrbuted real-tme systems, IEEE Trans. Comput., vol. 36, no. 8, pp Aug [11]. J. Elson and D. Estrn, Tme synhronzaton for wreless sensor networks, n Pro. 15th Int. Parallel Dstr. Proess. Symp. Workshops, vol , pp b b-6. [12]. S. Ganerwal, R. Kumar, S. Adlakha, M. B. Srvastava, Network-wde tme synhronzaton n sensor networks, NESL Tehnal Report, [13]. S. Ganerwal, Man B. Srvastava, Tmng-syn Protool for Sensor Networks (TPSN) on Berkeley Motes, NESL [14]. J. Elson, K. Romer, Wreless Sensor Networks: A New Regme for Tme Synhronzaton, Proeedngs of the Frst Workshop on Hot Tops In Networks (HotNets-I), Prneton, New Jersey. Otober [15]. D. L. Mlls, Internet tme synhronzaton: The Network Tme Protool In Z. Yang and T.A. Marsland, edtors, Global States and Tme n Dstrbuted Systems. IEEE Computer Soety Press, Page 67
On the End-to-end Call Acceptance and the Possibility of Deterministic QoS Guarantees in Ad hoc Wireless Networks
On the End-to-end Call Aeptane and the Possblty of Determnst QoS Guarantees n Ad ho Wreless Networks S. Srram T. heemarjuna Reddy Dept. of Computer Sene Dept. of Computer Sene and Engneerng Unversty of
More informationConnectivity in Fuzzy Soft graph and its Complement
IOSR Journal of Mathemats (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1 Issue 5 Ver. IV (Sep. - Ot.2016), PP 95-99 www.osrjournals.org Connetvty n Fuzzy Soft graph and ts Complement Shashkala
More informationMatrix-Matrix Multiplication Using Systolic Array Architecture in Bluespec
Matrx-Matrx Multplaton Usng Systol Array Arhteture n Bluespe Team SegFault Chatanya Peddawad (EEB096), Aman Goel (EEB087), heera B (EEB090) Ot. 25, 205 Theoretal Bakground. Matrx-Matrx Multplaton on Hardware
More informationResearch on Neural Network Model Based on Subtraction Clustering and Its Applications
Avalable onlne at www.senedret.om Physs Proeda 5 (01 ) 164 1647 01 Internatonal Conferene on Sold State Deves and Materals Sene Researh on Neural Networ Model Based on Subtraton Clusterng and Its Applatons
More informationSemi-analytic Evaluation of Quality of Service Parameters in Multihop Networks
U J.T. (4): -4 (pr. 8) Sem-analyt Evaluaton of Qualty of Serve arameters n Multhop etworks Dobr tanassov Batovsk Faulty of Sene and Tehnology, ssumpton Unversty, Bangkok, Thaland bstrat
More informationSession 4.2. Switching planning. Switching/Routing planning
ITU Semnar Warsaw Poland 6-0 Otober 2003 Sesson 4.2 Swthng/Routng plannng Network Plannng Strategy for evolvng Network Arhtetures Sesson 4.2- Swthng plannng Loaton problem : Optmal plaement of exhanges
More informationA MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams
A MPAA-Based Iteratve Clusterng Algorthm Augmented by Nearest Neghbors Searh for Tme-Seres Data Streams Jessa Ln 1, Mha Vlahos 1, Eamonn Keogh 1, Dmtros Gunopulos 1, Janwe Lu 2, Shouan Yu 2, and Jan Le
More informationMicroprocessors and Microsystems
Mroproessors and Mrosystems 36 (2012) 96 109 Contents lsts avalable at SeneDret Mroproessors and Mrosystems journal homepage: www.elsever.om/loate/mpro Hardware aelerator arhteture for smultaneous short-read
More informationMinimize Congestion for Random-Walks in Networks via Local Adaptive Congestion Control
Journal of Communatons Vol. 11, No. 6, June 2016 Mnmze Congeston for Random-Walks n Networks va Loal Adaptve Congeston Control Yang Lu, Y Shen, and Le Dng College of Informaton Sene and Tehnology, Nanjng
More informationBit-level Arithmetic Optimization for Carry-Save Additions
Bt-leel Arthmet Optmzaton for Carry-Sae s Ke-Yong Khoo, Zhan Yu and Alan N. Wllson, Jr. Integrated Cruts and Systems Laboratory Unersty of Calforna, Los Angeles, CA 995 khoo, zhanyu, wllson @sl.ula.edu
More informationLink Graph Analysis for Adult Images Classification
Lnk Graph Analyss for Adult Images Classfaton Evgeny Khartonov Insttute of Physs and Tehnology, Yandex LLC 90, 6 Lev Tolstoy st., khartonov@yandex-team.ru Anton Slesarev Insttute of Physs and Tehnology,
More informationDesign Level Performance Modeling of Component-based Applications. Yan Liu, Alan Fekete School of Information Technologies University of Sydney
Desgn Level Performane Modelng of Component-based Applatons Tehnal Report umber 543 ovember, 003 Yan Lu, Alan Fekete Shool of Informaton Tehnologes Unversty of Sydney Ian Gorton Paf orthwest atonal Laboratory
More informationAvatar Face Recognition using Wavelet Transform and Hierarchical Multi-scale LBP
2011 10th Internatonal Conferene on Mahne Learnng and Applatons Avatar Fae Reognton usng Wavelet Transform and Herarhal Mult-sale LBP Abdallah A. Mohamed, Darryl D Souza, Naouel Bal and Roman V. Yampolsky
More informationA Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects
Journal of VLSI Sgnal Proessng 2007 * 2007 Sprnger Sene + Busness Meda, LLC. Manufatured n The Unted States. DOI: 10.1007/s11265-006-0024-7 A Novel Dynam and Salable Cahng Algorthm of Proxy Server for
More informationOptimal shape and location of piezoelectric materials for topology optimization of flextensional actuators
Optmal shape and loaton of pezoeletr materals for topology optmzaton of flextensonal atuators ng L 1 Xueme Xn 2 Noboru Kkuh 1 Kazuhro Satou 1 1 Department of Mehanal Engneerng, Unversty of Mhgan, Ann Arbor,
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationInterval uncertain optimization of structures using Chebyshev meta-models
0 th World Congress on Strutural and Multdsplnary Optmzaton May 9-24, 203, Orlando, Florda, USA Interval unertan optmzaton of strutures usng Chebyshev meta-models Jngla Wu, Zhen Luo, Nong Zhang (Tmes New
More informationTopic 5: semantic analysis. 5.5 Types of Semantic Actions
Top 5: semant analyss 5.5 Types of Semant tons Semant analyss Other Semant tons Other Types of Semant tons revously, all semant atons were for alulatng attrbute values. In a real ompler, other types of
More informationMeasurement and Calibration of High Accuracy Spherical Joints
1. Introduton easurement and Calbraton of Hgh Auray Spheral Jonts Ale Robertson, Adam Rzepnewsk, Alexander Sloum assahusetts Insttute of Tehnolog Cambrdge, A Hgh auray robot manpulators are requred for
More informationA Fast Way to Produce Optimal Fixed-Depth Decision Trees
A Fast Way to Produe Optmal Fxed-Depth Deson Trees Alreza Farhangfar, Russell Grener and Martn Znkevh Dept of Computng Sene Unversty of Alberta Edmonton, Alberta T6G 2E8 Canada {farhang, grener, maz}@s.ualberta.a
More informationAVideoStabilizationMethodbasedonInterFrameImageMatchingScore
Global Journal of Computer Sene and Tehnology: F Graphs & vson Volume 7 Issue Verson.0 Year 207 Type: Double Blnd Peer Revewed Internatonal Researh Journal Publsher: Global Journals In. (USA) Onlne ISSN:
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationThe Simulation of Electromagnetic Suspension System Based on the Finite Element Analysis
308 JOURNAL OF COMPUTERS, VOL. 8, NO., FEBRUARY 03 The Smulaton of Suspenson System Based on the Fnte Element Analyss Zhengfeng Mng Shool of Eletron & Mahanal Engneerng, Xdan Unversty, X an, Chna Emal:
More informationFULLY AUTOMATIC IMAGE-BASED REGISTRATION OF UNORGANIZED TLS DATA
FULLY AUTOMATIC IMAGE-BASED REGISTRATION OF UNORGANIZED TLS DATA Martn Wenmann, Bors Jutz Insttute of Photogrammetry and Remote Sensng, Karlsruhe Insttute of Tehnology (KIT) Kaserstr. 12, 76128 Karlsruhe,
More informationBottom-Up Fuzzy Partitioning in Fuzzy Decision Trees
Bottom-Up Fuzzy arttonng n Fuzzy eson Trees Maej Fajfer ept. of Mathemats and Computer Sene Unversty of Mssour St. Lous St. Lous, Mssour 63121 maejf@me.pl Cezary Z. Janow ept. of Mathemats and Computer
More informationA Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks
A Real-Tme Detetng Algorthm for Trakng Communty Struture of Dynam Networks Jaxng Shang*, Lanhen Lu*, Feng Xe, Zhen Chen, Jaa Mao, Xueln Fang, Cheng Wu* Department of Automaton, Tsnghua Unversty, Beng,,
More informationCluster ( Vehicle Example. Cluster analysis ( Terminology. Vehicle Clusters. Why cluster?
Why luster? referene funton R R Although R and R both somewhat orrelated wth the referene funton, they are unorrelated wth eah other Cluster (www.m-w.om) A number of smlar ndvduals that our together as
More informationProgressive scan conversion based on edge-dependent interpolation using fuzzy logic
Progressve san onverson based on edge-dependent nterpolaton usng fuzzy log P. Brox brox@mse.nm.es I. Baturone lum@mse.nm.es Insttuto de Mroeletróna de Sevlla, Centro Naonal de Mroeletróna Avda. Rena Meredes
More informationAdaptive Class Preserving Representation for Image Classification
Adaptve Class Preservng Representaton for Image Classfaton Jan-Xun M,, Qankun Fu,, Wesheng L, Chongqng Key Laboratory of Computatonal Intellgene, Chongqng Unversty of Posts and eleommunatons, Chongqng,
More informationTime Synchronization in Wireless Sensor Networks: CCTS
Time Synchronization in Wireless Sensor Networks: CCTS 1 Nerin Thomas, 2 Smita C Thomas 1, 2 M.G University, Mount Zion College of Engineering, Pathanamthitta, India Abstract: A time synchronization algorithm
More informationColor Texture Classification using Modified Local Binary Patterns based on Intensity and Color Information
Color Texture Classfaton usng Modfed Loal Bnary Patterns based on Intensty and Color Informaton Shvashankar S. Department of Computer Sene Karnatak Unversty, Dharwad-580003 Karnataka,Inda shvashankars@kud.a.n
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationPath Following Control of a Spherical Robot Rolling on an Inclined Plane
Sensors & ransduers, Vol., Speal Issue, May 3, pp. 4-47 Sensors & ransduers 3 by IFSA http://www.sensorsportal.om Path Followng Control of a Spheral Robot Rollng on an Inlned Plane ao Yu, Hanxu Sun, Qngxuan
More informationFuzzy Modeling for Multi-Label Text Classification Supported by Classification Algorithms
Journal of Computer Senes Orgnal Researh Paper Fuzzy Modelng for Mult-Label Text Classfaton Supported by Classfaton Algorthms 1 Beatrz Wlges, 2 Gustavo Mateus, 2 Slva Nassar, 2 Renato Cslagh and 3 Rogéro
More informationPerformance Evaluation of TreeQ and LVQ Classifiers for Music Information Retrieval
Performane Evaluaton of TreeQ and LVQ Classfers for Mus Informaton Retreval Matna Charam, Ram Halloush, Sofa Tsekerdou Athens Informaton Tehnology (AIT) 0.8 km Markopoulo Ave. GR - 19002 Peana, Athens,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationComputing Cloud Cover Fraction in Satellite Images using Deep Extreme Learning Machine
Computng Cloud Cover Fraton n Satellte Images usng Deep Extreme Learnng Mahne L-guo WENG, We-bn KONG, Mn XIA College of Informaton and Control, Nanjng Unversty of Informaton Sene & Tehnology, Nanjng Jangsu
More informationSteganalysis of DCT-Embedding Based Adaptive Steganography and YASS
Steganalyss of DCT-Embeddng Based Adaptve Steganography and YASS Qngzhong Lu Department of Computer Sene Sam Houston State Unversty Huntsvlle, TX 77341, U.S.A. lu@shsu.edu ABSTRACT Reently well-desgned
More informationA Flexible Solution for Modeling and Tracking Generic Dynamic 3D Environments*
A Flexble Soluton for Modelng and Trang Gener Dynam 3D Envronments* Radu Danesu, Member, IEEE, and Sergu Nedevsh, Member, IEEE Abstrat The traff envronment s a dynam and omplex 3D sene, whh needs aurate
More informationA Toolbox for Easily Calibrating Omnidirectional Cameras
A oolbox for Easly Calbratng Omndretonal Cameras Davde Saramuzza, Agostno Martnell, Roland Segwart Autonomous Systems ab Swss Federal Insttute of ehnology Zurh EH) CH-89, Zurh, Swtzerland {davdesaramuzza,
More informationOSSM Ordered Sequence Set Mining for Maximal Length Frequent Sequences A Hybrid Bottom-Up-Down Approach
Global Journal of Computer Sene and Tehnology Volume 12 Issue 7 Verson 1.0 Aprl 2012 Type: Double Blnd Peer Revewed Internatonal Researh Journal Publsher: Global Journals In. (USA) Onlne ISSN: 0975-4172
More informationA min-max Approach for Improving the Accuracy of Effort Estimation of COCOMO
Internatonal Journal of Soft Computng and Engneerng (IJSCE) ISSN: 3-307, Volume-, Issue-3, July 0 A mn-max Approah for Improvng the Auray of Effort Estmaton of COCOMO H. S. Hota, Ramesh Pratap Sngh Abstrat
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationSOCIAL networking is among the fastest growing information
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBTED SYSTEMS, VOL. 26, NO. 5, MAY 2015 1301 Effent Data Query n Intermttently-Conneted Moble Ad Ho Soal Networks Yang Lu, Student Member, IEEE, Yanyan Han, Zhpeng
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationFUZZY SEGMENTATION IN IMAGE PROCESSING
FUZZY SEGMENTATION IN IMAGE PROESSING uevas J. Er,, Zaldívar N. Danel,, Roas Raúl Free Unverstät Berln, Insttut für Inforat Tausstr. 9, D-495 Berln, Gerany. Tel. 0049-030-8385485, Fax. 0049-030-8387509
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationImplementing Lattice Boltzmann Computation on Graphics Hardware
To appear n The Vsual omputer Implementng Latte oltzmann omputaton on Graphs Hardware We L, Xaomng We, and re Kaufman enter for Vsual omputng (V) and epartment of omputer Sene State Unversty of New York
More informationMulti-Collaborative Filtering Algorithm for Accurate Push of Command Information System
Mult-Collaboratve Flterng Algorthm for Aurate Push of Command Informaton System Cu Xao-long,, Du Bo, Su Guo-Png, Yu Yan Urumq Command College of CPAPF, Urumq 83000, Chna XnJang Tehnal Insttute of Physs
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationSwarm intelligence based dynamic obstacle avoidance for mobile robots under unknown environment using WSN
J. Cent. South Un. Tehnol. (008) 15: 860 868 DI: 10.1007/s11771 008 0158 9 Swarm ntellgene based dynam obstale aodane for moble robots under unnown enronment usng WSN XUE Han( 薛晗 ), MA Hong-xu( 马宏绪 ) (College
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
More informationElsevier Editorial System(tm) for NeuroImage Manuscript Draft
Elsever Edtoral System(tm) for NeuroImage Manusrpt Draft Manusrpt Number: Ttle: Comparson of ampltude normalzaton strateges on the auray and relablty of group ICA deompostons Artle Type: Tehnal Note Seton/Category:
More informationLOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION
IEEE-Internatonal Conferene on Reent Trends n Informaton Tehnology, ICRTIT 211 MIT, Anna Unversty, Chenna. June 3-5, 211 LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION K.Meena #1, Dr.A.Suruland
More informationA GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS
A GENETIC APPROACH FOR THE AUTOMATIC ADAPTATION OF SEGMENTATION PARAMETERS R. Q. Fetosa a, *, G. A. O. P. Costa a, T. B. Cazes a, B. Fejo b a Dept. of Eletral Engneerng, b Dept of Informats, Cathol Unversty
More informationWhat about asynchronous systems? The Game of Paxos. Quorum Systems. The Game of Paxos
What about asynhronous systems? FLP says onsensus annot be solved... For benign failures, Paos provides net best thing always safe And for Byzantine failures? The Game of Paos Proesses are ompeting to
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationThe stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0
The stream cpher MICKEY-128 (verson 1 Algorthm specfcaton ssue 1. Steve Babbage Vodafone Group R&D, Newbury, UK steve.babbage@vodafone.com Matthew Dodd Independent consultant matthew@mdodd.net www.mdodd.net
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY Networking Laboratory
ABHELSINKI UNIVERSITY OF TECHNOLOGY Networkng Laboratory Load Balanng n Cellular Networks Usng Frst Poly Iteraton Johan an Leeuwaarden Samul Aalto & Jorma Vrtamo Networkng Laboratory Helsnk Unersty of
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationTAR based shape features in unconstrained handwritten digit recognition
TAR based shape features n unonstraned handwrtten dgt reognton P. AHAMED AND YOUSEF AL-OHALI Department of Computer Sene Kng Saud Unversty P.O.B. 578, Ryadh 543 SAUDI ARABIA shamapervez@gmal.om, yousef@s.edu.sa
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationChapter 6 Ti T me m s ynchronization
Chapter 6 Time synchronization Outline 6.1. The Problems of Time Synchronization 6.2. Protocols Based on Sender/Receiver Synchronization 6.2.1. Network Time Protocol (NTP) 6.2.2. Timing-sync Protocol for
More informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationBoosting Weighted Linear Discriminant Analysis
. Okada et al. / Internatonal Journal of Advaned Statsts and I&C for Eonoms and Lfe Senes Boostng Weghted Lnear Dsrmnant Analyss azunor Okada, Arturo Flores 2, Marus George Lnguraru 3 Computer Sene Department,
More informationPBFT: A Byzantine Renaissance. The Setup. What could possibly go wrong? The General Idea. Practical Byzantine Fault-Tolerance (CL99, CL00)
PBFT: A Byzantine Renaissane Pratial Byzantine Fault-Tolerane (CL99, CL00) first to be safe in asynhronous systems live under weak synhrony assumptions -Byzantine Paos! The Setup Crypto System Model Asynhronous
More informationGabor-Filtering-Based Completed Local Binary Patterns for Land-Use Scene Classification
Gabor-Flterng-Based Completed Loal Bnary Patterns for Land-Use Sene Classfaton Chen Chen 1, Lbng Zhou 2,*, Janzhong Guo 1,2, We L 3, Hongjun Su 4, Fangda Guo 5 1 Department of Eletral Engneerng, Unversty
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationGPU Accelerated Elevation Map based Registration of Aerial Images
GPU Aelerated Elevaton Map based Regstraton of Aeral Images Joseph Frenh, Student Member, IEEE, Wllam Turr, Joseph Fernando, Member, IEEE and Er Balster Senor Member IEEE {joseph.frenh, Wllam.turr, joseph.fernando}@udr.udayton.edu,
More informationIJCTA Nov-Dec 2016 Available
Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationInternational Conference on Applied Science and Engineering Innovation (ASEI 2015)
Internatonal Conference on Appled cence and Engneerng Innovaton (AEI 2015) A new MAC protocol of UAN (ABIC-MAC) based on hgh effcency, concurrent and bdrecton LIU Jun 1,a, YANG Xao Lan 2, PENG Lng Feng
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationParallel Grammatical Evolution for Circuit Optimization
Proeedngs of the World Congress on Engneerng and Computer Sene 2009 Vol II WCECS 2009, Otober 20-22, 2009, San Franso, USA Parallel Grammatal Evoluton for Crut Optmzaton 2OGLFK Kratohvíl, Pavel Ošmera,
More informationRV-Monitor: Efficient Parametric Runtime Verification with Simultaneous Properties
RV-Montor: Effent Parametr Runtme Verfaton wth Smultaneous Propertes Qngzhou Luo 1, Y Zhang 1, Choonghwan Lee 1, Dongyun Jn 2, Patrk O Nel Meredth 1, Traan Florn Şerbănuţă 3, and Grgore Roşu 1 1 Unversty
More informationBANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION
ARPN Journal of Engneerng and Appled Scences 2006-2009 Asan Research Publshng Network (ARPN). All rghts reserved. BANDWIDTH OPTIMIZATION OF INDIVIDUA HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICA APPICATION
More informationON THE USE OF THE SIFT TRANSFORM TO SELF-LOCATE AND POSITION EYE-IN-HAND MANIPULATORS USING VISUAL CONTROL
XVIII Congresso Braslero de Automáta / a 6-setembro-00, Bonto-MS ON THE USE OF THE SIFT TRANSFORM TO SELF-LOCATE AND POSITION EYE-IN-HAND MANIPULATORS USING VISUAL CONTROL ILANA NIGRI, RAUL Q. FEITOSA
More informationPattern Classification: An Improvement Using Combination of VQ and PCA Based Techniques
Ameran Journal of Appled Senes (0): 445-455, 005 ISSN 546-939 005 Sene Publatons Pattern Classfaton: An Improvement Usng Combnaton of VQ and PCA Based Tehnques Alok Sharma, Kuldp K. Palwal and Godfrey
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationEvaluation of Segmentation in Magnetic Resonance Images Using k-means and Fuzzy c-means Clustering Algorithms
ELEKTROTEHIŠKI VESTIK 79(3): 129-134, 2011 EGLISH EDITIO Evaluaton of Segmentaton n Magnet Resonane Images Usng k-means and Fuzzy -Means Clusterng Algorthms Tomaž Fnkšt Unverza v Lublan, Fakulteta za stronštvo,
More informationPerformance Improvement of the DSRC System Using a Novel S and Π-Decision Demapper
Wreless Sensor Network, 29,, 268-275 do:.4236/wsn.29.433 Publshed Onlne Noveber 29 (http://www.srp.org/journal/wsn). Perforane Iproveent of the DSRC Syste Usng a Novel S and Π-Deson Deapper Abstrat Jeh
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationInternational Journal of Pharma and Bio Sciences HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS ABSTRACT
Int J Pharm Bo S 205 Ot; 6(4): (B) 799-80 Researh Artle Botehnology Internatonal Journal of Pharma and Bo Senes ISSN 0975-6299 HYBRID CLUSTERING ALGORITHM USING POSSIBILISTIC ROUGH C-MEANS *ANURADHA J,
More information