Adaptive Knowledge-Based Visualization for Accessing Educational Examples

Size: px
Start display at page:

Download "Adaptive Knowledge-Based Visualization for Accessing Educational Examples"

Transcription

1 Adaptve Knowledge-Based Vsualzaton for Accessng Educatonal Examples Peter Bruslovsky, Jae-wook Ahn, Tbor Dumtru, Mchael Yudelson School of Informaton Scences, Unversty of Pttsburgh {peterb, jaa38, Abstract A number of research teams are workng to organze personalzed access to the modern repostores of educatonal resources. The goal of personalzed access s to help students locate resources that match ther ndvdual goals, nterests, and current knowledge. The project presented n ths paper s focused on the least explored way of personalzed access adaptve vsualzaton. Here, we present the NavEx ADVISE vsualzaton system, whch provdes personalzed access to a repostory of educatonal examples. The system combnes spatal, smlarty-based vsualzaton wth adaptve annotatons of resources. The spatal layout and the adaptve annotatons are generated usng a knowledge-based ndexng of examples wth doman concepts. 1. Introducton Dedcated repostores of educatonal materals such as educatonal dgtal lbrares (DL) and pools of reusable learnng objects are now accumulatng a large volume of educatonal resources. The abundance of resources avalable to students has created a new challenge how to help students locate resources that match ther ndvdual goals, nterests, and current knowledge. We frst faced ths challenge n our WebEx project, when we developed a repostory of about a hundred annotated program examples for an ntroductory programmng course [2]. The repostory contans lnes of example code that has been annotated by teachers. Once an example s selected, the WebEx system allows students to explore t nteractvely nsde a Web browser, by clckng on the annotated lnes of code and readng the teacher s explanatons. But the queston s how can the most relevant examples n a repostory be located when there are dozens of examples accessble at any one tme? Our frst soluton was to apply the adaptve navgaton support approach by usng NavEx [9], an adaptve nterface for the WebEx system. It provded a lst of lnks to all examples and augmented each lnk wth an adaptve con that vsualzed the status of the example, adapted to the current state of the student's knowledge and hstory of past nteractons (Fgure 1). These cons help students to: a) dstngush new examples from examples that have already been partally or fully explored n the past; as well as to b) dstngush examples that are ready to be explored from examples that demand prerequste knowledge the student lacks. The problem that we are addressng n ths paper s how to help students to locate examples that are relevant not only to ther current knowledge, but also to ther current learnng goal. What f a student has problems wth understandng a specfc example and wants to read explanatons for one or more smlar examples? Or, n contrast, what f a student fully understands the programmng constructs explaned n a specfc example and now wants to explore an essentally dfferent example to better cover the content of the course? Unfortunately, the ordered lst of lnks to examples used n NavEx offered no help n selectng smlar or dssmlar examples. Past research on nformaton vsualzaton suggests that goal-based selecton of documents s better supported by two-dmensonal vsualzaton than by a onedmensonal lst. In partcular, the Lghthouse system [5] appled spatal smlarty-based vsualzaton and relevance markng to assst users n fndng documents most relevant to ther search goals. Due to the nature of smlarty-based vsualzaton, smlar documents were postoned close to each other and dssmlar far from each other. Ths allowed the users to vsually receve better gudance n selectng documents than s usually provded by a ranked lst. Ths paper presents our attempt to mplement deas of adaptve vsualzaton n the context of personalzed access to a repostory of annotated program examples. We present our new vsualzaton nterface, NavEx ADVISE, whch combnes spatal smlarty-based vsualzaton wth adaptve annotatons. The smlarty-based layout allows students to easly locate the most smlar and dssmlar examples vsually, helpng the student to select examples relevant to ther current learnng goal. Adaptve annotatons support knowledge-based and progress-based adaptaton. NavEx ADVISE was mplemented usng ADVISE 2D, a vsualzaton tool developed by the authors.

2 Fgure 1 Adaptve navgaton support n NavEx system helps students choose the example to browse by augmentng each example lnk wth an adaptve con that vsualzes the status of the example The need to provde personalzed access to program examples served as the motvaton to develop ADVISE 2D; however, we attempted to make ADVISE 2D generc enough so that t can support a range of smlar nformaton access needs. The paper focuses on both NavEx ADVISE, a specfc adaptve vsualzaton system, and ADVISE 2D, a tool that we have created to support ths and smlar projects. The next secton presents the user's vew of the adaptve vsualzaton nterface n NavEx ADVISE. The remanng sectons present ADVISE 2D and ts applcaton to gudng students through examples wth personalzed access. 2. Accessng program examples wth adaptve vsualzaton The vsualzaton-based nterface for accessng examples organzes and dsplays the whole repostory of examples on a two dmensonal example map. Fgure 2 shows the map wth ts examples dstrbuted accordng to smlarty. Each rectangle represents an example. The dstance between two documents on the map represents how smlar they are to each other. If ther knowledge-level content s smlar, they are placed closer to each other, but f dssmlar, they are placed farther from each other. It s mportant to know that the vsualzaton s based on knowledge-based smlarty. The dstance between two examples s determned by comparng the set of programmng concepts presented by these examples. Each example bears an adaptve con that shows the relevance of ths example to the user's current knowledge and completon of progress through the example. If the user s not ready to access the example, due to a lack of prerequste knowledge, a red X s dsplayed (Fgure 2). If the user s ready to access an example, then a green bullet s shown. The fullness of the bullet approxmates the user's progress wthn the example. An empty bullet shows a completely new, but ready-to-be explored example. A flled bullet denotes a fully explored example. The current con s determned by the NavEx system, whch compares the past hstory of the student's nteracton wth the example to the concept-level model of knowledge mantaned by NavEx. The spatal layout and adaptve annotatons help the users to locate the most relevant examples. To start workng wth an example, the user double-clcks the example box, whch causes a WebEx wndow to open for nteractve exploraton of the selected example. To better explore the set of examples, users can manpulate the vsualzaton: zoomng n or out wth a slde bar or pannng the screen n four drectons. In addton, users can dsplay lnes between smlar documents and exact smlarty values between pars of documents.

3 Fgure 2 ADVISE 2D helps students choose the most relevant example by combnng adaptve navgaton support wth spatal 2D vsualzaton of the example space These functonaltes are mportant for dealng wth an abundance of documents that may potentally be dsplayed n a relatvely small wndow. Fnally, the example names sometmes make the dsplay too crowded to grasp the whole pcture. In such stuaton, the rectangles wth document ttles can be reduced to small cons, as shown n Fgure 3. In ths vew, the example name s only dsplayed when a user moves a mouse cursor over ts con. 3. Smlarty-based vsualzaton n ADVISE The spatal vsualzaton of examples n NavEx was produced wth ADVISE 2D one of the tools developed n our lab for the ADVISE project. ADVISE (ADaptve VISualzaton for Educaton) s a sute of web-based, personalzed document-vsualzaton systems for educatonal purposes. The goal of the ADVISE project s to help students fnd the most relevant educatonal materals, through personalzed vsualzaton. ADVISE sute ncludes three systems wth dfferent perspectves and approaches. ADVISE 2D and ADVISE 3D are smlarty-based document space vsualzaton systems for two- and threedmensonal spaces, respectvely. They provde spatal document maps where documents are dstrbuted accordng to ther smlarty values. (We refer to every educatonal object n ths system as a document.) ADVISE VIBE s an mplementaton of the VIBE [7] document vsualzaton approach. It calculates smlartes between documents and POIs (Pont Of Interest) or concepts and determnes document postons relatve to the postons of the POIs. ADVISE tools are customzable to dfferent applcaton contexts and are avalable from the project home page ( ADVISE 2D s a generc tool that provdes personalzed access to documents usng a smlarty-based vsualzaton approach known as sprng modelng (see secton 3.4 for detals). Icons whch represent smlar documents are postoned relatvely closer to each other on a two dmensonal map and whle those whch are dfferent would be placed more dstantly on the map. By consultng the dstrbuton of the cons and the postons of each of them, users can make some general assumptons about the contents of a document even before actually openng t, understand the relatonshps between documents n terms of ther contents, and see the overall pcture of the documents n the corpus. The adaptve smlarty-based vsualzaton s produced n several steps: representng document contents as vectors, loadng the vectors nto the applcaton, calculatng smlartes among document vectors, decdng document postons on a two dmensonal space based on these smlarty values, and fnally presentng vsual representaton to users.

4 scheme can be appled for term weghts. TF means the frequency of a term n a document and IDF s an nverse of the number of documents whch have the correspondng term (Equaton 1). Fgure 3 Smple dsplay for documents Term 1 Term 2 Term 3 Term Doc 1 w 11 w 12 w 13 w 1j Doc 2 w 21 w 22 w 23 w 2j Doc w 1 w 2 w 3 w j Fgure 5 Document-term matrx D tfdf ( d, t) = tf ( d, t) log df ( t) tf(d,t): number of occurrences of term t n document d df(t): number of documents where term t appears D : total number of documents n the corpus Equaton 1 TF-IDF weghtng Fgure 4 ADVISE 2D archtecture ADVISE 2D was desgned as a context-ndependent Web-based vsualzaton tool. It can vsualze data that has been loaded from several dfferent applcatons. Fgure 4 s the archtecture of ADVISE 2D. For the purpose of ths project, ADVISE 2D was tuned to work wth a repostory of WebEx examples. The remanng part of ths secton descrbes ADVISE 2D and the next secton presents use of the system for personalzed access to examples Document representaton Documents n ADVISE 2D are represented as weghted term vectors n order to calculate the smlartes and to place them n approprate postons [8]. If a document s a full-text tutoral or a lecture slde, terms from the document are extracted and stored n a vector, whch represents the document. If the document s a code example, language constructs are stored n the vector. Therefore, the whole corpus can be represented as a matrx wth documents n ts rows and terms n ts columns. If the corpus contans a total of M documents and the total number of terms n t s N, an M by N matrx s constructed (Fgure 5). In most cases, few documents would even come close to contanng every term n the corpus, so the matrx tends to be very sparse, wth a lot of 0 s, whch means that there s no occurrence of another correspondng term n the document. The value of vector components can be bnary or weghted. A well known TF (term frequency) or TF-IDF (term frequency multpled by nverse document frequency) 3.2. Smlarty calculaton The cosne smlarty coeffcent (Equaton 2) was used for calculatng nter-document smlartes. Ths relates to the cosne angle of the two vectors x and y, and ranges from 0 (the two documents beng completely dssmlar) to 1 (they are dentcal). Sm( x, y) = x 2 x y Equaton 2 Cosne smlarty coeffcent 3.3. Data communcaton ADVISE 2D was desgned to work seamlessly wth webbased materals. It can spatally map the materals by ther contents, explore the mappng, and open ther contents by connectng to ther URL s. For ths last purpose, t was mplemented as a Java applet and can launch wthn web browsers. It loads three types of data to make the vsualzaton: a) document vectors wth ttles, b) lst of terms, and c) document URL s. They are fed nto the applet n two dfferent ways: usng <PARAM> tags n HTML- and XMLbased communcaton wth a server. The frst method works n a statc manner, whch cannot dynamcally update the contents beng vsualzed but the second method makes t y 2

5 possble for the applet to send a request to the server for new data, enablng the applet to update the current vsualzaton. The applet and the server communcate n a predefned XML-formatted protocol Spatal mappng wth the sprng model ADVISE 2D organzes and vsualzes documents based on the sprng modelng algorthm. The sprng modelng algorthm or FDP (Force Drected Placement) s a heurstc approach to graph drawng, based on a hypothetcal physcal (mechancal) system n whch the graph s edges are replaced by sprngs whle the vertces (nodes) are replaced by rngs. The sprngs attract the rngs f they are too far apart and repel them f they are too close [1; 4]. It can be used to sort randomly placed nodes nto a desrable layout that satsfes the aesthetcs of vsual presentaton. F F s r = C s = C r log( d / C / d Equaton 3 The forces formula for the sprng model The forces actng on every node nclude sprng force and repulson force. The resultant of these forces can be calculated and, under the nfluence of sprng force between connected nodes and repulson force between unconnected nodes, the graph wll automatcally adjust tself untl the system reaches a stable state. It calculates ths resultant of forces by ncludng the sprng and repulson forces that act on every node, n an teraton of the loop untl the graph reaches a stable state [6]. Equaton 3 shows the calculatons of sprng force and repulson force n ths sprng model. Cs, Cd, Cr are constants such as sprng length, sprng stffness, sprng type, and ntal confguraton, whch control the forces actng on nodes and ther movements. In ADVISE 2D, both sprng forces and repulson forces were consdered to show ther relatonshps n terms of smlartes. When a system launches and reads n the data needed, t randomly places every document on the map. The sprng algorthm begns from ths state and terates untl t reaches a stable state. In ths stable state, the documents are arranged accordng to ther smlarty values and are then fnally vsualzed on the map. 2 d ) representaton of program examples produced by the NaxEx system [9]. As we mentoned n the ntroducton, NavEx was desgned to provde personalzed access to code examples through adaptve navgaton support. NavEx provdes gudance regardng relevant examples that students should or shouldn t explore by dsplayng an adaptve con (Fgure 7). To generate ths con dynamcally for each example, NavEx takes nto account the programmng knowledge presented by each example, the current state of the student's knowledge, and hs/her past nteracton wth the examples. 4.1 Knowledge-based example ndexng The key to ths functonalty s the knowledge-based ndexng of each annotated example wth a set of concepts from the C-programmng doman. The concepts used are C language constructs such as decl_var, vod, nclude, man_func, etc. The ndexng s done automatcally by a doman-specfc parser. After all examples are ndexed, concepts of each of the examples are splt nto prerequstes and outcomes. Outcomes are concepts that are llustrated by that example. Prerequstes are concepts that should be learned before explorng the example. The splttng s automatc, but t s drven by the teacher s ndvdual approach to concept- sequencng wthn the course. To tune the ndexng to a specfc teachng approach, a teacher must provde a set of representatve examples for each course lecture. More detals about the ndexng procedure can be found n [3]. The result of concept ndexng and dvson s shown n Fgure 6. Ths knowledge-based example ndexng was used by NavEx ADVISE to produce a spatal layout for the repostory of examples. The concept ndex of each example was converted nto a term vector as explaned n secton 3.1. To produce a course-ndependent layout, the ndexng does not dstngush prerequste and outcome concepts, but takes nto account how frequently each concept s found n each example (and some concepts can present n several places wthn the same example). The resultng layout s based on deep knowledge-level smlarty between the examples. 4. Customzng ADVISE 2D to work wth program examples To acheve the goals of our current project, our contextndependent system ADVISE 2D was customzed to provde adaptve knowledge-based vsualzatons of annotated program examples. The customzed system s referred to as NavEx ADVISE snce both the spatal representaton and the adaptve cons are generated usng the knowledge-based Fgure 6 Concept ndexng and dvson

6 4.2 The adaptve annotaton of examples The adaptve annotaton of examples n NavEx ADVISE was produced usng the same cons and algorthms as n the orgnal NavEx system. Thus the same example n the NavEx lst and on the NavEx ADVISE map bears an dentcal annotaton at the same moment n tme. Both vews provde two knds of annotaton: progress-based and prerequste-based. The progress-based annotaton shown as a partally-flled green bullet (Fgure 7) s calculated as smply the percentage of example code lnes already explored by the student, compared to the total number of annotated lnes n ths example. Computaton of prerequste-based readness for an example s based on a concept-level model of student knowledge. The example s consdered ready for exploraton f all of ts prerequste concepts are already known to the student to a specfed extent. The system approxmates the student's level of knowledge for each concept by montorng student actvtes wthn the system (.e., example exploraton) and by consultng a centralzed student model that collects evdences of student knowledge from multple sources (.e., readng a tutoral secton or answerng a quz). Not ready to be accessed Ready to be accessed Fgure 7 Annotaton clues n NavEx The adaptve annotatons support a natural flow for exploraton of concepts and examples. Once a student starts to work wth examples, only those that are ready to be accessed wll have no prerequstes. As a user explores an example and revews a certan number of annotatons (defned by a dynamc threshold), an example s consdered to be completed (although ther progress may reman below 100%). At the same tme, all of the assocated concepts are marked as learned. If there exst some examples whose prerequstes are now all marked learned, these open up to be explored and the flow contnues on. For more detals refer to [3]. Conclusons Ths paper presents our attempts to apply adaptve, knowledge-based vsualzaton to gude students of ntroductory programmng courses to most of the tems n a repostory of educatonal examples. We presented the NavEx ADVISE vsualzaton system, whch combnes a spatal smlarty-based vsualzaton wth the adaptve annotaton of educatonal objects. Both the spatal layout and the adaptve annotatons are generated by usng a knowledge-based ndexng of program examples wth programmng concepts. The system was developed by the targeted customzaton of the generc ADVISE 2D vsualzaton tool, whch had prevously been developed n our lab. Both the NavEx and NavEx ADVISE systems are currently beng used n an ntroductory programmng course. Our earler exploraton of NavEx demonstrated that students apprecate the gudance provded by adaptve annotatons and that t encourages students to explore sgnfcantly more examples [9]. Our current challenge s to determne the value of adaptve vsualzaton n ts role of supportng student access to educatonal examples. Acknowledgements Ths materal s based upon work supported by the Natonal Scence Foundaton under Grant No References [1] Battsta, G. D., Eades, P., Tamassa, R., and Tolls, I. G., "Algorthms for drawng graphs: an annotated bblography", Computatonal Geometry: Theory and Applcatons 4, 1994, pp [2] Bruslovsky, P., WebEx: "Learnng from examples n a programmng course", In: Fowler, W. and Hasebrook, J. (eds.) Proc. of WebNet'2001, World Conference of the WWW and Internet, Orlando, FL, AACE, 2001, pp [3] Bruslovsky, P., Yudelson, M., and Sosnovsky, S., "An adaptve E-learnng servce for accessng Interactve examples", In: Nall, J. and Robson, R. (eds.) Proc. of World Conference on E-Learnng, E-Learn 2004, Washngton, DC, USA, AACE, 2004, pp [4] Eades, P., "A Heurstc for Graph Drawng". Congressus Numerantum 42, 1984, pp [5] Leusk, A. and Allan, J., "Interactve nformaton retreval usng clusterng and spatal proxmty", User Modelng and User Adapted Interacton 14, 2-3, 2004, pp [6] Lu, X., Shzuk, B., and Tanaka, J., "Dynamc Parameter Sprng Modelng Algorthm for Graph Drawng", In: Proc. of Internatonal Symposum on Future Software Technology (ISFST2001), Zheng Zhou, Chna, 2001, pp [7] Olsen, K. A., Korfhage, R. R., Sochats, K. M., Sprng, M. B., and Wllams, J. G., "Vsualsaton of a document collecton: The VIBE system", Informaton Processng and Management 29, 1, 1993, pp [8] Salton, G., Automatc Text Processng, Addson-Wesley Publshng Co., Readng, MA. [9] Yudelson, M. and Bruslovsky, P., "NavEx: Provdng Navgaton Support for Adaptve Browsng of Annotated Code Examples", In: Loo, C.-K., McCalla, G., Bredeweg, B. and Breuker, J. (eds.) Artfcal Intellgence n Educaton: Supportng Learnng through Intellgent and Socally Informed Technology. IOS Press, Amsterdam, 2005, pp

Cluster Analysis of Electrical Behavior

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 information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A 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 information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

Performance Evaluation of Information Retrieval Systems

Performance 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 information

Load Balancing for Hex-Cell Interconnection Network

Load 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 information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps 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 information

A Knowledge Management System for Organizing MEDLINE Database

A Knowledge Management System for Organizing MEDLINE Database A Knowledge Management System for Organzng MEDLINE Database Hyunk Km, Su-Shng Chen Computer and Informaton Scence Engneerng Department, Unversty of Florda, Ganesvlle, Florda 32611, USA Wth the exploson

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 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 information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term 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 information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course 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 information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User 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 information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

Module Management Tool in Software Development Organizations

Module 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 information

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,

More information

PRÉSENTATIONS DE PROJETS

PRÉSENTATIONS DE PROJETS PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng

More information

3D vector computer graphics

3D 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A 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 information

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vdyanagar Faculty Name: Am D. Trved Class: SYBCA Subject: US03CBCA03 (Advanced Data & Fle Structure) *UNIT 1 (ARRAYS AND TREES) **INTRODUCTION TO ARRAYS If we want

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Parallel matrix-vector multiplication

Parallel 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL 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 information

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt

More information

An Image Fusion Approach Based on Segmentation Region

An 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 information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

Efficient Distributed File System (EDFS)

Efficient 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 information

Relevance Feedback for Image Retrieval

Relevance Feedback for Image Retrieval Vashal D Dhale et al, / (IJCSIT Internatonal Journal of Computer Scence and Informaton Technologes, Vol 4 (2, 203, 39-323 Relevance Feedback for Image Retreval Vashal D Dhale, Dr A R Mahaan, Prof Uma Thakur

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis 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 information

The Codesign Challenge

The 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 information

Related-Mode Attacks on CTR Encryption Mode

Related-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 information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query 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 information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place

More information

Content-based Image Retrieval in Augmented Reality

Content-based Image Retrieval in Augmented Reality Content-based Image Retreval n Augmented Realty Leszek Kalcak, Hans Myrhaug, and Ayse Goker Ambesense Ltd, Aberdeen, UK {leszek,hans,ayse}@ambesense.com Abstract. In ths paper, we present a content-based

More information

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps Vsual Thesaurus for Color Image Retreval usng Self-Organzng Maps Chrstopher C. Yang and Mlo K. Yp Department of System Engneerng and Engneerng Management The Chnese Unversty of Hong Kong, Hong Kong ABSTRACT

More information

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School

More information

UB at GeoCLEF Department of Geography Abstract

UB 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 information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-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 information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An 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 information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL 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 information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

MPEG-7 Pictorially Enriched Ontologies for Video Annotation

MPEG-7 Pictorially Enriched Ontologies for Video Annotation MPEG-7 Pctorally Enrched Ontologes for Vdeo Annotaton C. Grana, R.Vezzan, D. Bulgarell, R. Cucchara Dpartmento d Ingegnera dell Informazone Unverstà degl Stud d Modena e Reggo Emla Abstract. A system for

More information

CS 534: Computer Vision Model Fitting

CS 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 information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A Clustering Algorithm for Key Frame Extraction Based on Density Peak Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua 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 information

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The 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 information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An 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 information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-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

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES

PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES PYTHON IMPLEMENTATION OF VISUAL SECRET SHARING SCHEMES Ruxandra Olmd Faculty of Mathematcs and Computer Scence, Unversty of Bucharest Emal: ruxandra.olmd@fm.unbuc.ro Abstract Vsual secret sharng schemes

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On 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 information

A Novel Video Retrieval Method Based on Web Community Extraction Using Features of Video Materials

A Novel Video Retrieval Method Based on Web Community Extraction Using Features of Video Materials IEICE TRANS. FUNDAMENTALS, VOL.E92 A, NO.8 AUGUST 2009 1961 PAPER Specal Secton on Sgnal Processng A Novel Vdeo Retreval Method Based on Web Communty Extracton Usng Features of Vdeo Materals Yasutaka HATAKEYAMA

More information

Load-Balanced Anycast Routing

Load-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 information

Available online at Available online at Advanced in Control Engineering and Information Science

Available 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 information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE 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 information

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Complex 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. 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 information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

Study of Data Stream Clustering Based on Bio-inspired Model

Study 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 information

TOWARDS ADVANCED DATA RETRIEVAL FROM LEARNING OBJECTS REPOSITORIES

TOWARDS ADVANCED DATA RETRIEVAL FROM LEARNING OBJECTS REPOSITORIES The Fourth Internatonal Conference on e-learnng (elearnng-03), 6-7 September 03, Belgrade, Serba TOWARDS ADVANCED DATA RETRIEVAL FROM LEARNING OBJECTS REPOSITORIES VALENTINA PAUNOVIĆ Belgrade Metropoltan

More information

Wishing you all a Total Quality New Year!

Wishing 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 information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning 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 information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. 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 information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-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 information

11. HARMS How To: CSV Import

11. HARMS How To: CSV Import and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an

More information

Pruning Training Corpus to Speedup Text Classification 1

Pruning Training Corpus to Speedup Text Classification 1 Prunng Tranng Corpus to Speedup Text Classfcaton Jhong Guan and Shugeng Zhou School of Computer Scence, Wuhan Unversty, Wuhan, 430079, Chna hguan@wtusm.edu.cn State Key Lab of Software Engneerng, Wuhan

More information

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING James Moscola, Young H. Cho, John W. Lockwood Dept. of Computer Scence and Engneerng Washngton Unversty, St. Lous, MO {jmm5,

More information

Ranking Techniques for Cluster Based Search Results in a Textual Knowledge-base

Ranking Techniques for Cluster Based Search Results in a Textual Knowledge-base Rankng Technques for Cluster Based Search Results n a Textual Knowledge-base Shefal Sharma Fetch Technologes, Inc 841 Apollo St, El Segundo, CA 90254 +1 (310) 414-9849 ssharma@fetch.com Sofus A. Macskassy

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. 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 information

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential 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 information

Unsupervised Learning

Unsupervised 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 information