Behavioral Model Extraction of Search Engines Used in an Intelligent Meta Search Engine
|
|
- Kathleen Williamson
- 6 years ago
- Views:
Transcription
1 Behavoral Model Extracton of Search Engnes Used n an Intellgent Meta Search Engne AVEH AVOUSI Computer Department, Azad Unversty, Garmsar Branch BEHZAD MOSHIRI Electrcal and Computer department, Faculty of engneerng, Unversty of Tehran IRAN Abstract: Informaton fuson placed over the Data fuson level prepares grounds to gan more perfect and clear results based on uncertan collected nformaton on one subect from dfferent aspects. Nowadays, the need for ntellgent systems as personal Meta Search engne capable of supplyng user by needed nformaton from great mass of nformaton resources s sensble. More over, the measures taen on ths ground have many defcences. In a Meta Search engne the user's nterests are receved and the proper queres based upon them are transmtted to the search engnes. Then, the returned results of the search engnes become fltered and based on prorty they are made avalable for the user. But, t s obvous that the dfferent search engnes have dfferent behavor on dfferent subects. On the same drecton n ths study we try to examne a part of a customzed ntellgent agent whch s able to extract behavoral model of search engnes from dfferent subectve clusters gradually, and accordng to the feedbac t gets from the user. ey words: Data/Informaton fuson-lst fuson-meta search engne- Intellgent agent Subectve clusters. Introducton Undoubtedly,sutable retreve of nformaton from nternet and other data sources wth large scales and very large scales s one of the most mportant problems n effcent use of nformaton sources. Nowadays, web s the largest data source of documents and other forms of nformaton, and a sutable ground for evaluatng the dfferent Informaton retreval technques. The more the web s expanded, the more need for powerful search tools become evdent. At the present, there are lots of servces for web search. But none of them are helpful as expected, and actually n the most cases the results are dssatsfactory. One of the most mportant reasons of ths s because of naccurate nowledge of the users about present search engne abltes, by the other word, ther behavoral model. Researches done about the nternet Meta Search engnes shows that the lsts fuson whch has ts own ndependent lterature [] and also the behavoral model of nternet search engnes were not studed from the angle consdered n ths paper. The Characterstcs of Intellgent Meta Search engne based on Informaton Fuson In ths paper, an ntellgent Meta Search engne s dscussed whch usng nformaton Fuson technques, t roles as a customzed Meta Search engne for the user. Ths agent receves the words or phrases nterested for the user who s wllng to fnd the subects related to them to study, and then t ass the user to determne weghts of words accordng to ther mportance, whether or not to be used n the text. Weght has a lngustc concept here. It means that the user can determne the mportance of whether or not word to be n the text as None, Low, Medum, Hgh, and Very Hgh. Then the agent maes ready the queres, by a unt named "Query Generator", accordng to the number of nformaton servers (e.g. nternet search engnes, and/ or data sources) [,]. After sendng queres each server returns a lst of raned documents based on ther proxmty to the subect, and accordng to the algorthm that server wors upon t. Then the Meta Search engne revews these lsts and then elmnates the repeated tems, and fuses them based on lst fuson algorthms such that a raned lst of documents s prepared. In ths lst a
2 score s gven to each document based on ts poston n the lst []. Then the documents are processed one by one n ths lst, and ther condtons are determned regardng whether or not the ey words or phrases selected by the user to be present, and accordng to ther presence quantty and dstrbuton, two scores are gven to each document. In ths mechansm, Ordered Weghted Averagng operator (OWA) [,8,9,0,] has the basc role. The mentoned aspects of Meta Search engne operaton are dscussed n [,,] thoroughly. Ths paper ntally focused on the fusng method of the lsts attaned from search engnes and modelng of the search engnes used by Meta Search engne. Each tme the user decdes to use the Meta Search engne, he or she specfes that ths nterestng subect s n whch subectve cluster [6,7]. By subectve cluster, we mean "a logcal classfcaton of nterestng subects". Each tme the user starts a new search; he or she can select from the avalable clusters or create a new cluster. Some of avalable clusters at the present are shown n Table. The agent has allocated one score to each server based on ts hstorc operaton n each subectve cluster. The agent allocates the score of the server whch has retreved the document to t. These scores become updated after each use of Meta Search engne, based on an algorthmthoroughly dscussed later so gradually the behavoral model of each search engne and ts effcency on a specal subect s formed n the mnd of ntellgent Meta Search engne. Regardng the mentoned explanatons, dfferent scores are ganed for each document that at the end the agent must calculate the fnal score of each document based on them and represent t to the user. It s done by fusng of these scores by methods of nformaton fuson and for each score a weght s consdered whch shows the mportance of that crteron at the fnal decson. Also, fnally, the score of each server n the specal subectve cluster s updated wth / wthout feedbac receved from the user.. The problem of lst fuson Dfferent data sources on the web often complete each other. Thus, to cover all the nformaton resources and to gan more pure results, t s a logc strategy to use dfferent search tools and at the end the results to be refned and then fused together. Now, the queston s: what s the best method to fuse these lsts together? Ths queston s mportant because the lsts whch are represented by the search tools are often raned. Now, we want to fuse all these lsts together to get a unt lst whch ts tems are selected from all the presented tems n all the lsts. But fusng these and producng a fnal lst s an mportant dscusson. Suppose we have a group of nformaton servers. S We show these servers wth In whch, =,... M M s the number of servers. Also, we suppose each server got a unque collecton of documents. It means that each document s n ust one nformaton server. Of course, we can't suppose ths for nternet search engnes. But we can create the same condton by elmnatng the repeated tems from other lsts. We also suppose that each nformaton server has ts own search mechansms. For a Query Q, each server gve one score to each document and at the end prepares a raned lst of documents related to the query as ts answer. The problem we have to solve: to choose N documents most related to query and put them nto the fnal lst. Each N document may be got from each of the servers. The pont whch maes our ob harder s the dfference among servers n ther methods of allocatng scores, and these methods may never be comparable. For ths reason we can't select N documents n order from hghest score to the lowest one n each server.. Representng Mathematcal Formulaton of the Lsts Fuson Mechansm Let us denote the number of lsts that we want to fuse by M.The lsts themselves can be denoted by L,..., L M. For each from to M let us denote by N the number of tems n -th lst. A natural way of fusng these M lsts nto a sngle sorted lst s to assgn a value v to each tem of the lsts and then sort all N + N N M elements n the ncreasng order of ths value. So the queston s: How can we determne the value v for each tem? We need a functon of two varables. An tem s unquely characterzed wth two parameters: The number of the lst L from whch ths tem comes The order of the gven tem n the correspondng lst L ( =,, ). The value v must be unquely determned by the values of these two parameters. Dependence v on, can only appear through dependence on N.So v s a functon of and N.
3 () v= v(, N ) If two lsts L and L have the same length, there s no reason to assgn hgher prorty to each one of them. It means: v (, N ) = v(, N ). The way of calculatng V (, N ) s descrbed thoroughly n []. Here, we agan state the optmal formula for such functon s: α ) v (, N) = N.( + cn) In the same reference, t s shown that for α = 0 also ths formula can model the behavor of an expert person. Now, after utlzng fusng lsts method, we have a raned lst, that each document n t has a score based on ts ran n ths lst. A smple and adequate method s represented later. But, n advance we represent the followng defntons: Total number of documents = N Absolute score of document n the fused lst = μ. Ths score s descrbed completely before. Normalzed score of document = V Ths s one of the four crtera n fnal documents scorng and for each document s calculated as: μ V = Max( μ ) =. Score allocaton to nformaton servers As explaned before now we have a raned lst of documents whch extracted from dfferent search engnes. But, n ths ranng the behavoral model of search engnes has no role. But as t s explaned before due to varablty and dfferences of desgn parameters and the desgners of each search engne, and also due to ams of each search engne, each search engne has a powerful functon n one Feld, and medum or wea n another. Thus, neglectng ths fact leads to accuracy decreasng n Meta Search engne's functon. In ths part, the place and tme are gven to extract behavoral model of each search engne to utlze t n documents ranng. Intally, a score of 5 s gven to all the nformaton servers. Ths ncludes the sources wll be added gradually to the system n the future. It must be consdered that the deal score of a source s. Each tme the user sends a request to the system and gets result (s) from t, a lst of raned documents s prepared. We devsed a method for learnng the mportance weght of each nformaton server. Ths parameter has mportant role n mang behavoral model of the nformaton servers. A score s allocated to each document n the fnal lst based on the nformaton server that has retreved that document. Thus, the documents retreved from servers wth more powerful bacground n that certan subect, have more chances. Ths pont s mportant. Because, some nformaton servers may be very powerful n a certan feld (subectve cluster), or they are desgned and practced for retrevng the documents related to a certan subect. For modelng of score allocaton to each nformaton server we represent the followng defntons: The number of nformaton servers whch have at least one document n the fnal lst = M The number of documents presented from server n the fnal lst = d Set of the documents rans related to server arranged n ncreasng order = R R = r =,, d ; r < r < < r { } d The number of the documents wth most mportance n the fnal lst = (The user wll chec only documents n the fnal lst) The score of Server form begnnng tll ( t) () t now for cluster = s ( 0 s ) The score of Server n the next step for ( t+ ) ( t+ ) cluster = s ( 0 s ) The absolute score of Server n the current step for cluster = φ The relatve score of Server n the current step for cluster (resulted from normalzng ϕ ) = ψ ( 0 ψ ) Now, we explan the calculatng way ofφ. It s observed that at the present tme each nformaton (t) server's score to the subectve cluster s S whch s between 0 and, and ths value s consdered for all the documents retreved by ths server, and along wth other scores partcpates n the fnal score(usng OWA operator). To calculate φ varety of methods can be adopted. But, we should fnd a moderate method to ths fgure. It seems that the followng methods are adequate: (5) φ = r R d β ( ) β ( ) = r = r R r
4 (6) φ r R r d r β( ) β( ) = e = = r R In each of the above formulas the more the document become far from the top of lst the more the allocated scores decreased, and the fnal score of each server s obtaned from sum of scores of documents that are retreved by ths server. β( ) s a contnuous functon of n whch s the number of document most consdered by the user n the fnal lst. For example, = 0 means that ordnarly the frst 0 documents s more useful for the user, thus nformaton servers from whch the frst 0 documents are retreved must get the most ncreasng n scores. The value of s determned by the user. β( ) specfes the documents, How affect on score changng of ther nformaton servers. For example n (5) the bgger β( ) conduce that documents wth hgher ran be more effectve n ncreasng the score of related nformaton server. Relatng to (5) f β( ) >, the results wll be unreasonable, such that there wll be a bg dfference between document wth frst poston n the lst and the second. Relatng to (6) ths s vce versa. The more β( ) > s the more the condton s moderate. To mae the matter more clear an example represented: Example: suppose we have 5 nformaton servers (M=5) whch are specfed by S to. Also, suppose that the fused lst for subectve cluster s as Table. Consderng table the values of r and are calculated accordng to table ( s the score of Server form begnnng tll now for cluster ). Now, relatng to (5), for β( ) = and 0 β( ) = and = 0 we calculate φ (Table ). 5 e d (t) S As t s observed, the values of φ for β > are exactly on the opposte of an expert's vew. Because, consderng the raned lst of documents, an expert evaluates the scores of and servers close to each other, but for (5) when β > ths s not correct. Also, for 0 β, determnng the sutable amount for β s not smple. We can show that (5) s not sutable for our purpose. But tunng τ n (6) can produce proper results (Because of the t nature of functon ft () = e τ ). Thus, t maes t 0 possble that only the frst documents n the fnal lst ncrease the score of ther related nformaton server. For example, f an nformaton server has retreved even ust the last document nterested for user (nterestng document ), t gets a postve score. But, after that the speed of decreasng the allocated scores wll ncrease rapdly. β( ) = α can be the smplest form for ths α 5 purpose. Consderng the above ponts the formula used by the ntellgent agent to calculatng the values of φ s as followng: (7) α φ = d r e = r R (α = s sutable amount). Le other parts, wth normalzng the amounts ofφ, we calculate the score of each φ server as followng: (8) ψ = M Max ( φ ) = Now we descrbe the way of updatng (t ) server's score by the agent. S s the server score on the current step. We are gong to fnd a ( t+) functon by whch we calculate S (server ( t+ ) ( t) score on the next step): (9) s = f( s,ψ ) The score of each server can be updated by determnng functon f. But, t must be consdered that the tme parameter, also, affects the functon, ndrectly. The mportance of ths functon s capablty of t n reconstructng the behavoral model of each server. In ths case, the smplest way, s calculatng the average scores of each sever n each cluster. To do ths the followng formula s sutable: (0) ( t+ ) t t s = s t+ + ψ (). t+ In whch, t s the number of queres that agent has sent them about cluster to the server. The results obtaned from the above mechansm, mprove the qualty of the Meta Search engne s results effectvely. The complete results of usng ths mechansm are represented n []. 5. Concluson Snce each of the nternet search engnes are produced by ther own desgner's thought, vson,
5 and reasonng t s obvous that they have dfferent behavors on fulfllng the users' demands on searchng dfferent subects. Thus, t seems that desgnng an ntellgent Meta search engne wthout consderng behavor of each search engne aganst dfferent subects s naccurate. The results obtaned from ths paper shows that consderng ths parameter n desgnng Meta search engnes, conduce to mprovement n qualty of output results of desgned Meta Search Engne. Accurate modelng of a search engne, n addton to stated parameters n ths paper, may depend on other parameters, too. For example, many search engnes consder the amount of money receved form the document owner n fnal ranng, on whch we ddn t dscuss. Ths parameter and the others effectng on modelng process can be studed more complete n next studes. References: [] Improvng the ntellgent methods of Informaton Fuson Software agent on nternet, aveh avous, M.Sc thess for Artfcal Intellgence and Robotcs, Dept. of Electrcal and computer engneerng, Faculty of engneerng,unversty of Tehran. [] Improvng the functon of ntellgent agent of nformaton fusng, aveh avous, Behzad Moshr, Technology College of Tehran Unversty's publshng, summer 00 ssue. [] Archtectural desgnng of an ntellgent agent based on data fuson for extractng nformaton from searchng felds, Behzad Moshr, aveh avous, The th electrcty engneerng Conference n Shraz. [] A Broad Class of Standard DFSes, I. Glocner, Belefeld Unversty Report TR-000, 00 [5] Usng An Intellgent Agent to Enhance Search Engne Performance, J. Jansen, Peer Revewed Journal on the Internet, s/nstruct/ansen/, 997. [6] Inductve learnng from consderably erroneous examples wth a specfcty based stoppng rule, J. acprzy, Proceedngs of the Internatonal Conference on Fuzzy Logc and Neural Networs, Izua, Japan, 89, 99 [7] Text-Learnng and Related Intellgent Agents: A Survey, D. Mladenc, IEEE Intellgent Systems Journal, pp. -5, July/August, 999. [8] Pecewse Lnear Aggregaton Functons, S. Ovchnnov, Internatonal Journal of Uncertanty, Fuzzness and nowledge-based Systems, Vol. No. (000). pp.-, 00 [9] Decson mang under Dempster-Shafer uncertantes, Ronald R. Yager, Internatonal Journal of General Systems, Vol. 0, pp. - 5, 99. [0] Fuzzy logc controllers wth flexble structures, Ronald R. Yager and D. P. Flev, Proceedngs of Second Internatonal Conference on Fuzzy Sets and Neural Networs, Izua, Japan, pp. 7-0, 99. [] On the Fuson of Documents from Multple Collecton Informaton Retreval Systems, R. R. Yager, A. Rybalov, Journal of the Amercan Socety for Informaton Scence, 997. [] Fuzzy quotent operators for fuzzy relatonal data bases, Ronald R. Yager, Proc. Int. Fuzzy Engneerng Symposum, pp. 8-96, Yoohama, Japan, 99.
6 Table : Informaton clusters lst whch the agent holds ther bacground to dentfy behavoral model of nformaton servers. Name of cluster Cluster No. Name of cluster Cluster No. Moble Robot Navgaton 8 Data / Informaton Fuson In tumescent Coatngs 9 Context Senstve Web Searchng Pant & Resn Technology 0 Dempster Shafer Theory Robotcs Computer Scence, Hardware TBM model Computer Scence, Software 5 Neural Networs Case Based Reasonng 6 Neuro Fuzzy Systems Fuzzy Controllers 7 Table - fused lst ganed from raned lsts that retreved by Informaton servers the server that retreved ths dacument Score The server that retreved ths S Score 6 The server that retreved ths document S S 5 S () t s Table - Extractng the ran of each document n fused lst R = { r =,, d; r < L< rd } Server d { 68, } { 5,,9, 0} { 75,, } {, } {,,, } S S Table -Extractng absolute score of servers accordng to dfferent values of φ for φ for Server R = { r =,, d; r < L < rd } d ( ) 05. β( ) S β = = = = { 68, } { 5,,9, 0} { 75,, } {, } {,,, } S S
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 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 informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
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 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 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 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 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 informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
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 informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
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 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 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 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 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 informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
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 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 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 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 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 informationOptimizing Document Scoring for Query Retrieval
Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng
More informationCONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal
CONCURRENT OPTIMIZATION OF MUTI RESPONCE QUAITY CHARACTERISTICS BASED ON TAGUCHI METHOD Ümt Terz*, Kasım Baynal *Department of Industral Engneerng, Unversty of Kocael, Vnsan Campus, Kocael, Turkey +90
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
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 informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
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 informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
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 informationDecision Strategies for Rating Objects in Knowledge-Shared Research Networks
Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,
More information(1) The control processes are too complex to analyze by conventional quantitative techniques.
Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
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 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 Fuzzy Image Matching Algorithm with Linguistic Spatial Queries
Fuzzy Matchng lgorthm wth Lngustc Spatal Queres TZUNG-PEI HONG, SZU-PO WNG, TIEN-HIN WNG, EEN-HIN HIEN epartment of Electrcal Engneerng, Natonal Unversty of Kaohsung Insttute of Informaton Management,
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
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 informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationClassifying Acoustic Transient Signals Using Artificial Intelligence
Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationDependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples
Australan Journal of Basc and Appled Scences, 4(10): 4609-4613, 2010 ISSN 1991-8178 Dependence of the Color Renderng Index on the Lumnance of Lght Sources and Munsell Samples 1 A. EL-Bally (Physcs Department),
More informationA new paradigm of fuzzy control point in space curve
MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr
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 informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationEECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science
EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty
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 informationQoS-aware composite scheduling using fuzzy proactive and reactive controllers
Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationImproving Web Image Search using Meta Re-rankers
VOLUME-1, ISSUE-V (Aug-Sep 2013) IS NOW AVAILABLE AT: www.dcst.com Improvng Web Image Search usng Meta Re-rankers B.Kavtha 1, N. Suata 2 1 Department of Computer Scence and Engneerng, Chtanya Bharath Insttute
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
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 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 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 informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationA Comparative Study of Fuzzy Classification Methods on Breast Cancer Data *
Comparatve Study of Fuzzy Classfcaton Methods on Breast Cancer Data * Rav. Jan, th. braham School of Computer & Informaton Scence, Unversty of South ustrala, Mawson Lakes Boulevard, Mawson Lakes, S 5095
More informationPerformance Evaluation of an ANFIS Based Power System Stabilizer Applied in Multi-Machine Power Systems
Performance Evaluaton of an ANFIS Based Power System Stablzer Appled n Mult-Machne Power Systems A. A GHARAVEISI 1,2 A.DARABI 3 M. MONADI 4 A. KHAJEH-ZADEH 5 M. RASHIDI-NEJAD 1,2,5 1. Shahd Bahonar Unversty
More informationA Fuzzy Goal Programming Approach for a Single Machine Scheduling Problem
Proceedngs of e 9 WSEAS Internatonal Conference on Appled Maematcs, Istanbul, Turkey, May 7-9, 006 (pp40-45 A Fuzzy Goal Programmng Approach for a Sngle Machne Schedulng Problem REZA TAVAKKOLI-MOGHADDAM,
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 informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationSome material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier
Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)
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 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 informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationCracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm
Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,
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 informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
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 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 informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationImproving anti-spam filtering, based on Naive Bayesian and neural networks in multi-agent filters
J. Appl. Envron. Bol. Sc., 5(7S)381-386, 2015 2015, TextRoad Publcaton ISSN: 2090-4274 Journal of Appled Envronmental and Bologcal Scences www.textroad.com Improvng ant-spam flterng, based on Nave Bayesan
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 informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
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 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 informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
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 informationRules for Using Multi-Attribute Utility Theory for Estimating a User s Interests
Rules for Usng Mult-Attrbute Utlty Theory for Estmatng a User s Interests Ralph Schäfer 1 DFKI GmbH, Stuhlsatzenhausweg 3, 66123 Saarbrücken Ralph.Schaefer@dfk.de Abstract. In ths paper, we show that Mult-Attrbute
More informationThe Man-hour Estimation Models & Its Comparison of Interim Products Assembly for Shipbuilding
Internatonal Journal of Operatons Research Internatonal Journal of Operatons Research Vol., No., 9 4 (005) The Man-hour Estmaton Models & Its Comparson of Interm Products Assembly for Shpbuldng Bn Lu and
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More informationDescription of NTU Approach to NTCIR3 Multilingual Information Retrieval
Proceedngs of the Thrd NTCIR Workshop Descrpton of NTU Approach to NTCIR3 Multlngual Informaton Retreval Wen-Cheng Ln and Hsn-Hs Chen Department of Computer Scence and Informaton Engneerng Natonal Tawan
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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationCAN COMPUTERS LEARN FASTER? Seyda Ertekin Computer Science & Engineering The Pennsylvania State University
CAN COMPUTERS LEARN FASTER? Seyda Ertekn Computer Scence & Engneerng The Pennsylvana State Unversty sertekn@cse.psu.edu ABSTRACT Ever snce computers were nvented, manknd wondered whether they mght be made
More information