Journal of Chemical and Pharmaceutical Research, 2014, 6(10): Research Article. Study on the original page oriented load balancing strategy
|
|
- Christopher Joseph
- 5 years ago
- Views:
Transcription
1 Avalable onlne Journal of hemcal and Pharmaceutcal Research, 2014, 6(10): Research Artcle IN : ODEN(UA) : JPR5 tudy on the orgnal page orented load balancng strategy Kunpeng Kang chool of omputer and Informaton Technology, hangqu Normal Unversty, hangqu, hna ABTRAT Load balance plays an mportant role to nformaton acquston system performance. Excellent load balancng strategy s a key for us to make full use of system memory and computng resources, to reduce the response tme of the dstrbuted operaton. Internal mechansm of orgnal page load balance s gven, based on analyss of the two recent commonly dynamc load balance methods. Fve orgnal page orented load balancng strateges are compared From the expermental and theoretcal perspectves On the premse of calculatng load ndex. Fnally, the concluson s drawn that date channel storage calculaton senstve partton s the most optmal load partton strategy. Keywords: Orgnal Page, Load Balance, Pollng, Load Balancng trategy INTRODUTION The load balancng n storage system of dstrbuted search engne. It can be dvded nto two aspects from the machne resources: hard dsk storage load balancng, ncludng the orgnal page, page content and ndex fles n dfferent nodes of the hard dsk storage. Load balance of computaton, whch refers to the load balancng of the calculaton among the storage nodes. Each node needs to carry out many computng tasks, ncludng the orgnal page wrtng dsk, the orgnal page content extracton, content page update, ndex update and ndex query etc. From the pont of vew of applcaton, the load balancng of these computng and storage resources may be dvded nto two stages. The frst stage s related wth the orgnal page, wth the crawler node wrtng the orgnal page drve on the system. For the storage t s the three data volume ncreasng and for the calculaton t s wrtng dsk ca by the orgnal page wrtng dsk, content extracton, ndex and content page update; the second stage s relevant to the ndex query, between storage nodes equlbrum ndex query load, to make the system have faster response tme of dstrbuted ndex query. The load balancng of the frst stage s crtcal for the equlbrum and full use of the storage capacty, as well as for the mprovement of the wrtng response tme of graspng subsystem. The load balancng of the second stage can optmze ndex query response tme. Ths paper manly studes the storage facng the orgnal page and computatonal load balancng. The second secton analyses the research status of the orgnal page load balance; the thrd secton puts forward the orgnal page load balance system; the fourth quarter puts forward fve strateges of the orgnal page load balancng; the ffth secton carry out the test and performance analyss for the load balancng strateges; the last secton s the summary. 2. Relevant Task The orgnal page related load dstrbuton occurs n dstrbuted acquston subsystem crawler node wrtng the page to the storage system. Before the crawler wrtes page to the storage node of the storage system, t needs to ask storage system for the nformaton of the storage nodes on the page. Load balancng strategy mplementaton begns at the moment when the management node wrtes the request to the crawler to dstrbute the storage nodes. The man task of the balance algorthm s to decde how to choose the next node, and then transmt the new servce request to 274
2 t. A good load balance algorthm s not omnpotent; generally speakng t s closely lnked wth applcaton scene. o we should consder the equalzaton algorthm comprehensvely accordng to the characterstcs of the process and make use dfferent algorthms and technques [1] [2] [3]. At present, there are two commonly dynamc load balance methods: 2.1 Pollng method In a task queue node, every member has the same status. Pollng method smply makes cycle selecton n turn n ths group. In load balancng envronment, the algorthm wll dstrbute new request next node n ths node queue, so contnuous, round and round. Each node s chosen n turn n equal status. Pollng method actvty s predctable, that s, each node s chance to be chosen s 1 / N (assumng there are N nodes). Pollng method s the most smple and most easy mplementaton approach. Ths method doesn't consder the machne somersm. 2.2 Load Index Method Load ndex algorthm calculates nodal Load Index LI (Load Index) based on node current Load condton. The Load Index consttutes the Load prorty queue of a storage node; t takes the team node from prorty queues and forwards servce request every tme when the servce request arrves. Load ndex s a dynamc estmate [4][5]. The dsadvantage of ths method s that the cost of the dynamc montorng of load ndex and the calculaton s too hgh. 3. The orgnal page load balance system The computaton load of ths part s the frst two stages of three processng phases of storage node, namely the orgnal page analyss storage and the content page processng. The content page processng needs to update the content page and ndex; storage load refers to the hard dsk storage of three data, of whch the storage of the orgnal page accounts for more than 80% of the storage; the weght of orgnal page load balance s maxmum. The frst target of the load balance s that the storage capacty of the machne can be fully and balanced, make full use of the system s hard dsk storage space; secondly, the computng power s equalzaton, avod calculaton overloadng of the node and make the whole storage system completes analyzng the receved orgnal page as soon as possble. Reply: Drectory crawler erver Request : news.sna.com.cn torage torage torage Informaton Form of torage Node Node IP Address alculatng occupancy torage occupancy LI Other Number rate rate nformaton Node % 50% 1.2 Node % 50% 1.15 Node % 50% 1.2 Node N % 40% 1.1 Fgure 1: The basc procedure of load balancng 275
3 Informaton Form of Fle drectory Date hannel torage Node News.sna.com.cn Node It.sohu.com.cn Node ports.qq.com Node News.sna.com.cn NodeN It.sohu.com.cn Node News.feng.com Node 1 Fgure 2: The logc drectory table Fgure 1 s the load balancng schematc dagram. Frst of all, grab subsystem s crawler nqury storage unt; then load balancng module chooses the storage node of whch the current load ndex beng the smallest as the storage destnaton of ths unt; At last, modfyng fgure 2 fles n a drectory nformaton sheet, recordng the unt storage nformaton for subsequent query, and returnng the unt storage node nformaton to the crawler. 4. The Orgnal Page Orented Load Balancng trategy The somersm of machne s not consdered n mple pollng method; on the other hand, even the somersm s consdered, there are dfferences n sze of the cells parttoned by task, n order to ensure the nstantanety of the nformaton collecton, we can't make the bg unt wrte request after the cache. There s great uncertanty as long as the storage unt s bg enough. The premse of load ndex method s to desgnate the dstrbuted system a load ndex whch can correctly reflect current load condton of the system. The defnton of the load ndex s crtcal. Lteratures[4] suggest usng resource utlzaton rather than resources queue length as the load ndex. Besdes, n the dstrbuted applcatons, processng memory, hard dsk, PU and I/O etc wll affect the overall speed. It s more practcal to defne the composte load ndex comprehensvely accordng to the nature of the task [6]. To balance the relevant storage and computatonal load of the orgnal page, we consdered the overall effect of the sze of the load cell, load balance method, load nformaton acquston and load balancng algorthm for storage system, and desgned a varety of load balance methods. In each method, the load ndex s defned (pollng method after consderng machne somersm transmttng nto load ndex method, just wthout dynamc montorng load nformaton). 4.1 Page Round Partton Page Round Partton P - RP (Page Round Partton) method regards the orgnal Page as the load partton unt, proportonally dstrbutes load accordng to the ntal storage capacty of each storage node. It does not take the balance of computng power nto consderaton. Its load ndex calculaton s shown as follows: pages LI = pages ( ) In the formulaton, t means at the moment t, the page numbers that the storage node has receved, refers to the hard dsk storage capacty of storage nodes. Ths method hypotheszes that the page sze s equal, due to the huge number of pages and pages beng small fles. The equalzaton of the number of page represents the equalzaton of the storage capacty, so t can balance capacty load very well. But ths strategy brngs much metadata traffc and yuan data storage to management node. Because the number of the page n the system memory s large, management node cannot stand these loads. 4.2 hannel Round Partton hannel round partton - RP (hannel Round Partton) method regards hannel as load partton unt, proportonally dstrbutes load accordng to ntal storage capacty of each storage node, and not take the balance of computng power nto consderaton. Its load ndex calculaton s as follows: channels LI = In the formulaton, channels means at the moment, the channel numbers that the storage node has receved, 276
4 refers to the hard dsk storage capacty of the storage nodes. Ths method hypotheszes the channel sze s equal, and ts load s uneven because the channel number s not large and the szes are dfferent; on the other hand, ts load dfference wll become worse wth the passage of tme because once a channel s assgned to a node, the data that the channel later grabs wll be stored n ths node, then the orgnal load dfference wll become greater wth tme goes on. But the related operatons of page content of ths method can only be carred out n the machne, makng the whole system smple n desgn. 4.3 hannel Date Round Partton hannel Date Round Partton D - RP (hannel Date Round Partton) methods regards the day hannel as load partton unt, proportonally dstrbutes load accordng to the ntal storage capacty of each storage node. It does not take the balance of computng power nto consderaton. Its load ndex calculaton s as follows: Datehannels LI = In the formulaton the Datehannels refers to the day channel number stored by the storage node at the refers to the hard dsk storage capacty of storage node. Ths method hypotheszes that the sze of moment oft, day channel s equal, though there s great dfference between the channel szes, day channel number s large, and at the same tme - RP load deteroraton does not exst. The same bg channel data wll be stored n dfferent nodes on dfferent dates, and the effect of load balance s good. But the same channel s dvded nto dfferent storage nodes. In the operaton of the content page t needs to transmt n dfferent nodes n order to have a judgment of new content. 4.4 hannel Date torage-enstve Partton hannel Date torage-enstve Partton D - P (hannel Date torage - enstve Partton) method regards hannel date as load partton unt, measurng the dsk occupaton of storage nodes real tme, dstrbutng load unt to those machnes of whch the dsk occupaton rate s low. Its load ndex calculaton s as follows: LI = In the formulaton, refers to the data quantty stored by the storage node at the moment t ; refers to the storage capacty of hard dsk of storage nodes. Ths method dstrbutes load accordng to the storage occupaton rate on the bass of D - RP, whch reflects the storage load condton of nodes. But n addton to the shortcomng D - RP, the management node needs to real-tme montorng dsk s occupaton quantty of the storage nodes, to ncrease the load balance mechansm expense. 4.5 hannel Date torage-ompute-enstve Partton hannel Date torage-ompute-enstve Partton D - P (hannel Date torage - ompute - enstve Partton) method regard hannel date as load partton unt, real-tme measurng the torage nodes dsk and computatonal load, calculatng the comprehensve load ndex, assgnng load unt to lower ndex. Its load ndex calculaton s as follows: LI = K ρ RT ( ) ρ t RT LI = u1ρ + u2ρ ρ < RT ( ) ( ) / 2 ρ t < RT ρ t RT LI = u1ρ others ρ = s the hard dsk occupancy rate of storage nodes at the moment of t ρ = ; refers to the calculaton occupancy rate of storage node at the moment t u ; 1 u 与 2 refers to storage and 277
5 calculatng adjustment factor Respectvely, equally large; RT 和 RT s storage and computng occupancy rate threshold Respectvely, beng less than and close to 1; K s a very large Number, on behalf of overload. When the node calculates or memory occupancy rate s more than threshold, the load ndex ndcates overload; In the premse of not more than the threshold value, f the node calculaton load up to more than half calculaton threshold value, t wll add the calculaton load to load ndex, otherwse, t only takes capacty load as load ndex. Ths method adds calculaton load regulaton factor based on D - P method, gves full consderaton to the nfluence on the system load of storage and calculaton. The shortcomng s load nformaton acquston quantty ncreases. 4.6 dynamc load nformaton acquston The premse to calculate load ndex s the load nformaton acquston, fast and smple load nformaton acquston mechansm ensures the tmely and effectve load ndex. The frst three knds of methods do not need to acquston the dynamc load nformaton, because management node has dstrbuton unt of each node [7]. The later two strateges need to obtan dynamc load nformaton: storage load and computatonal load. torage load s hard dsk occupancy rate; each node obtans the dsk occupaton through the system call, and then takes the nformaton real-tme feedback to management node. Because the content page analyss s the most onerous lnk of storage node calculaton. The computaton load takes the orgnal page cache data quantty to be analyzed of the storage nodes as the measurement, and takes the buffer occupancy rate as calculatng load to sent to management node at true tme. 5. Experment nce the Page Round Partton method s nfeasble n actual deployment, we do not make further expermental analyss. Ths paper makes further expermental measurement wth the later four methods about ther equlbrum effect. Two experments are carred out, and each experment takes sx days. In each experment, the storage node s 8, storage node operatng system s Red Hat Enterprse Lnux A release 4. The former one somorphsm storage nodes, the machne s processng speed s the same between hard dsk and PU; the later one s heterogeneous storage nodes, the machne s processng speed s dfferent between hard dsk and PU. No matter whch group of machne, the network card s MB Enterc card,the sze of cache area of content analyss s 1 G. At the end of the frst day of each experment, the load s recorded, and at the end of the sxth day, the load s recorded agan. oeffcent of Varaton s statstcal mathematcal concepts, ts value s the mean square error dvded by average of the statstc data, representng the dstrbuton of the data. If the coeffcent of varaton s smaller, the dfference between data s smaller, and the dstrbuton s more average; on the contrary, f the dfference s bgger, the dstrbuton s uneven. In ths paper, the load balance s measured, calculaton or storage load of each machne s quantzed, and then coeffcent of varaton of these values s calculated. By usng load coeffcent of varaton we ndcate storage system load balance. The load coeffcent of varaton s the smaller, the load s well-dstrbuted. tatstcs are made wth three knds of load oeffcent of Varaton. torage load oeffcent of Varaton ( - V): oeffcent of Varaton of hard dsk space occupancy of all storage nodes, ths value represents storage load dstrbuton. omputaton load oeffcent of Varaton ( - V): oeffcent of Varaton of content analyss buffer occupancy of all storage nodes, ths value represents computaton load dstrbuton. Total load oeffcent of Varaton (T - V): Average of - V and - V values, ndcatng total load dstrbuton of system. Ths paper made statstcs on the dstrbuton of date channel partton unt. Fgure 3 s date channel data dstrbuton, comparson s made between ts dstrbuton and random data dstrbuton. In random data, medan and mean s nearly equal; coeffcent of varaton of all values s 0.5, well-dstrbuted. n the actual date channel data, small channels are many, the greater the channel, the sparser the dstrbuton; the coeffcent of varaton of all the values s large, up to 2.9; The medan value s much smaller than the mean, ndcatng the date tends to the small. The dfference between maxmum and mnmum of the actual date channel data s great; the bggest reach 2G, and the mnmum s 100 k. 278
6 Fgure 3: The data dstrbuton of the unt of channel date Fgure 4 and fgure 5 are the result of the frst group of experments. Wth - RP method, storage load s deteroraton, the effect of long-term operaton s the worst; wth D - RP method, although the load coeffcent s larger n the frst day, t declned n sx day, whch s the adjustment by the Date hannel Partton ; - RP and D - RP are two methods based on the storage round, - V s much greater compared wth non-round method; D - P method and D - P method are the most load balanced, they are almost the same. D - P method s a lttle better n the calculaton of loadng. Wth D - P method, the man reason for calculatng the coeffcent of varaton s the somorphsm of machnes, the result of storage balance s that the calculaton s nearly equal for each machne (calculaton s wrtten by the orgnal page drve). Fgure 4: One day of somorphsm stores Fgure 5: x days of somorphsm stores Fgure 6 and fgure 7 are the results of the second set of experment. ompared wth the frst set of experments, the - V of ths group of data of the former three methods s partcularly bg, because wth the former three methods t only carres out storage load balancng, wthout consderng computaton load, to make the machne calculaton overload, whch wll as a result ncrease the crawler wrtng response tme. D - P method stll has the least load coeffcent of varaton, although ts V s bgger than D - P, ts - V s much smaller, and n D - P method, - V and - V both are about 0.3. The system can accept ths uneven load. hown by the comparson of two groups of the experments, D - P method has the most equlbrum computng and storage load dstrbuton n both somorphsm and heterogeneous fleet. D - P method takes the second place, and n the heterogeneous network t could form serous uneven dstrbuton of calculaton. Round method performs the worst. 279
7 Fgure 6: One day of heterogeneous stores Fgure 7: x days of heterogeneous stores ONLUION Load balance plays a key role to nformaton acquston system performance. only load balance s well done, can we make full use of system memory and computng resources, to reduce the response tme of the dstrbuted operaton. Ths paper deals wth balance processng to storage and calculaton related load brought by the orgnal page wrte system, and puts forward a varety of load balancng strateges, and further measures the load balance effect of each scheme through experments. Fnally, we fnd that date channel storage calculaton senstve partton s the most optmal load partton strategy. Acknowledgements Ths paper s supported by cence and Technology Department of Henan Provnce (No ). REFERENE [1] Pol R; Kennedy J; Blackwell T. warm Intellgence, 2007, 1(1), [2] He Jalang; Ouyang Dantong; Zhu X; J Jnchao, AI, 2012, 4(7), [3] Banks A; Vncent J; Anyakoha. Natural omputng, 2007, 45(6), [4] ZHANG Deyu; LI hunyan.jdta, 2012,6(23), [5] Jpng L; houyn Lu; hxun Wu. IJAT, 2012, 4(12), [6] Janguo Wang; Zhje Zhang; Wenxng Zhang. JIT, 2013, 8(8), [7] Zhaohu Jang; Jng Zhang; hunsheng Wang. IJAT, 2013, 5(8),
Cluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
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 informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
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 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 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 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 informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
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 informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
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 informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
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 informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationFinite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c
Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor
More informationAnalysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD
Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,
More informationTwo-Stage Data Distribution for Distributed Surveillance Video Processing with Hybrid Storage Architecture
Two-Stage Data Dstrbuton for Dstrbuted Survellance Vdeo Processng wth Hybrd Storage Archtecture Yangyang Gao, Hatao Zhang, Bngchang Tang, Yanpe Zhu, Huadong Ma Bejng Key Lab of Intellgent Telecomm. Software
More informationA Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI
216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent
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 informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationParallelization of a Series of Extreme Learning Machine Algorithms Based on Spark
Parallelzaton of a Seres of Extreme Machne Algorthms Based on Spark Tantan Lu, Zhy Fang, Chen Zhao, Yngmn Zhou College of Computer Scence and Technology Jln Unversty, JLU Changchun, Chna e-mal: lutt1992x@sna.com
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationA Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures
A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
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 informationQuantifying Performance Models
Quantfyng Performance Models Prof. Danel A. Menascé Department of Computer Scence George Mason Unversty www.cs.gmu.edu/faculty/menasce.html 1 Copyrght Notce Most of the fgures n ths set of sldes come from
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationProfessional competences training path for an e-commerce major, based on the ISM method
World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng
More informationInternet Traffic Managers
Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John
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 Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationAdvanced Computer Networks
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
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 informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
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 informationApplication of Clustering Algorithm in Big Data Sample Set Optimization
Applcaton of Clusterng Algorthm n Bg Data Sample Set Optmzaton Yutang Lu 1, Qn Zhang 2 1 Department of Basc Subjects, Henan Insttute of Technology, Xnxang 453002, Chna 2 School of Mathematcs and Informaton
More informationAn IPv6-Oriented IDS Framework and Solutions of Two Problems
An IPv6-Orented IDS Framework and Solutons of Two Problems We LI, Zhy FANG, Peng XU and ayang SI,2 School of Computer Scence and Technology, Jln Unversty Changchun, 3002, P.R.Chna 2 Graduate Unversty of
More informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationDistributed Resource Scheduling in Grid Computing Using Fuzzy Approach
Dstrbuted Resource Schedulng n Grd Computng Usng Fuzzy Approach Shahram Amn, Mohammad Ahmad Computer Engneerng Department Islamc Azad Unversty branch Mahallat, Iran Islamc Azad Unversty branch khomen,
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationKeyword-based Document Clustering
Keyword-based ocument lusterng Seung-Shk Kang School of omputer Scence Kookmn Unversty & AIrc hungnung-dong Songbuk-gu Seoul 36-72 Korea sskang@kookmn.ac.kr Abstract ocument clusterng s an aggregaton of
More informationClustered Multimedia NOD : Popularity-Based Article Prefetching and Placement
Clustered Multmeda NOD : Popularty-Based Artcle Prefetchng and Placement Y.J.Km, T.U.Cho, K.O.Jung, Y.K.Kang, S.H.Park, K-Dong Chung Department of Computer Scence, Pusan Natonal Unversty, Korea Abstract
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationRemote Sensing Image Retrieval Algorithm based on MapReduce and Characteristic Information
Remote Sensng Image Retreval Algorthm based on MapReduce and Characterstc Informaton Zhang Meng 1, 1 Computer School, Wuhan Unversty Hube, Wuhan430097 Informaton Center, Wuhan Unversty Hube, Wuhan430097
More informationA KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE
A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
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 informationA Distributed Dynamic Bandwidth Allocation Algorithm in EPON
www.ccsenet.org/mas Modern Appled Scence Vol. 4, o. 7; July 2010 A Dstrbuted Dynamc Bandwdth Allocaton Algorthm n EPO Feng Cao, Demng Lu, Mnmng Zhang, Kang Yang & Ynbo Qan School of Optoelectronc Scence
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationDEVELOPMENT AND RESEARCH OF OPEN-LOOP MODELS THE SUBSYSTEM "PROCESSOR-MEMORY" OF MULTIPROCESSOR SYSTEMS ARCHITECTURES UMA, NUMA AND SUMA
DEVELOPMENT AND RESEARCH OF OPEN-LOOP MODELS THE SUBSYSTEM "PROCESSOR-MEMORY" OF MULTIPROCESSOR SYSTEMS ARCHITECTURES UMA, NUMA AND SUMA A. I. Martyshkn Penza State Technologcal Unversty, Baydukov Proyezd
More informationApplication of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling
, pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute
More informationResearch on a Method of Geographical Information Service Load Balancing
Research on a Method of Geographcal Informaton Servce oad Balancng Heyuan a, Yongxng a, Xue Zhyong a, Feng Tao a a X an Research Insttute of Surveyng and Mappng, X an, Shaanx, Chna; 305789861@qq.com; yongxngl2017@163.com;
More informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
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 informationA fair buffer allocation scheme
A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationStudy on Properties of Traffic Flow on Bus Transport Networks
Study on Propertes of Traffc Flow on Bus Transport Networks XU-HUA YANG, JIU-QIANG ZHAO, GUANG CHEN, AND YOU-YU DONG College of Computer Scence and Technology Zhejang Unversty of Technology Hangzhou, 310023,
More informationStudy of Data Stream Clustering Based on Bio-inspired Model
, pp.412-418 http://dx.do.org/10.14257/astl.2014.53.86 Study of Data Stream lusterng Based on Bo-nspred Model Yngme L, Mn L, Jngbo Shao, Gaoyang Wang ollege of omputer Scence and Informaton Engneerng,
More informationSelf-tuning Histograms: Building Histograms Without Looking at Data
Self-tunng Hstograms: Buldng Hstograms Wthout Lookng at Data Ashraf Aboulnaga Computer Scences Department Unversty of Wsconsn - Madson ashraf@cs.wsc.edu Surajt Chaudhur Mcrosoft Research surajtc@mcrosoft.com
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationCS 268: Lecture 8 Router Support for Congestion Control
CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationAn Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationPopularity and gain based caching scheme for information-centric networks
Research Artcle Internatonal Journal of Advanced Computer Research, Vol 7(30) ISSN (Prnt): 2249-7277 ISSN (Onlne): 2277-7970 http://dx.do.org/10.19101/ijacr.2017.730015 Popularty and gan based cachng scheme
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 informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
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 informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More information