Probabilistic inference
|
|
- Julianna Palmer
- 6 years ago
- Views:
Transcription
1 robabilistic infrnc Suppos th agnt has to mak a dcision about th valu of an unobsrvd qury variabl X givn som obsrvd vidnc E = artially obsrvabl, stochastic, pisodic nvironmnt Eampls: X = {spam, not spam}, = mail mssag X = {zbra, giraff, hippo}, = imag faturs Bays dcision thory: Th agnt has a loss function, which is 0 if th valu of Xi is gussd corrctly and d1 othrwis Th stimat of X that minimizs pctd loss is th on that has th gratst postrior probability X = This is th Maimum a ostriori MA dcision
2 MA dcision Valu of that has th highst postrior probability givn th vidnc arg ma * = = arg ma
3 MA dcision Valu of that has th highst postrior probability givn th vidnc arg ma * = = arg ma liklihood prior postrior
4 MA dcision Valu of that has th highst postrior probability givn th vidnc arg ma * = = arg ma Maimum liklihood ML dcision: liklihood prior postrior arg ma * =
5 Eampl: Naïv Bays modl Suppos w hav many diffrnt typs of obsrvations symptoms, y faturs F 1,, F n that w want to us to obtain vidnc about an undrlying hypothsis H MA dcision involvs stimating H 1 F1, K, Fn F, K, Fn H H If ach fatur can tak on k valus, how many ntris ar in th joint probability tabl?
6 Eampl: Naïv Bays modl Suppos w hav many diffrnt typs of obsrvations symptoms, y faturs F 1,, F n that w want to us to obtain vidnc about an undrlying hypothsis H MA dcision involvs stimating H 1 F1, K, Fn F, K, Fn H H W can mak th simplifying assumption that th diffrnt faturs ar conditionally indpndnt givn th hypothsis: n F K 1,, Fn H = Fi H i= 1 If ach fatur can tak on k valus, what is th complity of storing th rsulting distributions?
7 Naïv Bays Spam Filtr MA dcision: to minimiz th probability of rror, w should classify a mssag as spam if spam mssag > spam mssag
8 Naïv Bays Spam Filtr MA dcision: to minimiz th probability of rror, w should classify a mssag as spam if spam mssag > spam mssag W hav spam mssag mssag spamspam W hav spam mssag mssag spamspam and spam mssag mssag spam spam
9 Naïv Bays Spam Filtr W nd to find mssag spam spam and mssag spam spam Th mssag is a squnc of words w 1,, w n Bag of words rprsntation Th ordr of th words in th mssag is not important Each word is conditionally indpndnt of th othrs givn mssag class spam or not spam
10 Naïv Bays Spam Filtr W nd to find mssag spam spam and mssag spam spam Th mssag is a squnc of words w 1,, w n Bag of words rprsntation Th ordr of th words in th mssag is not important Each word is conditionally indpndnt of th othrs givn mssag class spam or not spam mssag spam = w K n 1,, wn spam = wi spam i= 1 Our filtr will classify th mssag as spam if n spam wi spam > spam i= 1 n i= 1 w i spam
11 Bag of words illustration US rsidntial Spchs Tag Cloud
12 Bag of words illustration US rsidntial Spchs Tag Cloud
13 Bag of words illustration US rsidntial Spchs Tag Cloud
14 Naïv Bays Spam Filtr spam w w K spam 1,, n w i spam n i= 1 postrior prior liklihood
15 aramtr stimation In ordr to classify a mssag, w nd to know th prior spam and th liklihoods word spam and word spam Ths ar th paramtrs of th probabilistic modl How do w obtain th valus of ths paramtrs? prior spam: 0.33 spam: 0.67 word spam word spam
16 aramtr stimation How do w obtain th prior spam and th liklihoods word spam and word spam? Empirically: us training data word spam = # of word occurrncs in spam mssags total # of words in spam mssags This is th maimum liklihood lih ML stimat, t or stimat t that maimizs th liklihood of th training data: D n d d = 1 i= 1 w d, i classd, i d: ind of training documnt, i: ind of a word
17 aramtr stimation How do w obtain th prior spam and th liklihoods word spam and word spam? Empirically: us training data word spam = # of word occurrncs in spam mssags total # of words in spam mssags aramtr smoothing: daling with words that wr nvr sn or sn too fw tims Laplacian smoothing: prtnd you hav sn vry vocabulary word on mor tim than you actually did
18 Summary of modl and paramtrs Naïv Bays modl: n spam mssag spam spam mssag spam Modl paramtrs: i= 1 n w i= 1 i spam w i spam prior spam spam Liklihood of spam w 1 spam w 2 spam w n spam Liklihood of spam w 1 spam w 2 spam w n spam
19 Bag-of-word modls for imags Csurka t al. 2004, Willamowski t al. 2005, Grauman & Darrll 2005, Sivic t al. 2003, 2005
20 Bag-of-word modls for imags 1. Etract imag faturs
21 Bag-of-word modls for imags 1. Etract imag faturs
22 Bag-of-word modls for imags 1. Etract imag faturs 2. Larn visual vocabulary
23 Bag-of-word modls for imags 1. Etract imag faturs 2. Larn visual vocabulary 3. Map imag faturs to visual words
24 Baysian dcision making: Summary Suppos th agnt has to mak dcisions about th valu of an unobsrvd qury variabl X basd on th valus of an obsrvd vidnc variabl E Infrnc problm: givn som vidnc E =, what is X? Larning problm: stimat th paramtrs of th probabilistic bili i modl X E givn a training i sampl { 1, 1,, n, n }
CSE 272 Assignment 1
CSE 7 Assignmnt 1 Kui-Chun Hsu Task 1: Comput th irradianc at A analytically (point light) For point light, first th nrgy rachd A was calculatd, thn th nrgy was rducd by a factor according to th angl btwn
More informationDO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J'''
DO NOW Gomtry Rgnts Lomac 2014-2015 Dat. du. Similar by Transformation 6.1 (DN) Nam th thr rigid transformations and sktch an xampl that illustrats ach on. Nam Pr LO: I can dscrib a similarity transformation,
More informationSpectral sensitivity and color formats
FirWir camras Spctral snsitivity and color formats At th "input" of a camra, w hav a CCD chip. It transforms photons into lctrons. Th spctral snsitivity of this transformation is an important charactristic
More informationType & Media Page 1. January 2014 Libby Clarke
Nam: 1 In ordr to hlp you s your progrss at th nd of this ntir xrcis, you nd to provid som vidnc of your starting point. To start, draw th a on th lft into th box to th right, dpicting th sam siz and placmnt.
More informationSystems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point.
3-5 Systms in Thr Variabls TEKS FOCUS VOCABULARY TEKS (3)(B) Solv systms of thr linar quations in thr variabls by using Gaussian limination, tchnology with matrics, and substitution. Rprsntation a way
More information8.3 INTEGRATION BY PARTS
8.3 Intgration By Parts Contmporary Calculus 8.3 INTEGRATION BY PARTS Intgration by parts is an intgration mthod which nabls us to find antidrivativs of som nw functions such as ln(x) and arctan(x) as
More informationThe Size of the 3D Visibility Skeleton: Analysis and Application
Th Siz of th 3D Visibility Sklton: Analysis and Application Ph.D. thsis proposal Linqiao Zhang lzhang15@cs.mcgill.ca School of Computr Scinc, McGill Univrsity March 20, 2008 thsis proposal: Th Siz of th
More informationFALSE DYNAMIC EIV MODEL IDENTIFICATION IN THE PRESENCE OF NON-PARAMETRIC DYNAMIC UNCERTAINTY
Intrnational Journal of Application or Innovation in Enginring & Managmnt (IJAIEM) Wb Sit: www.ijaim.org Email: ditor@ijaim.org Volum 3, Issu, May 4 ISSN 39-4847 FALSE DYNAMIC EIV MODEL IDENTIFICATION
More informationThe semantic WEB Roles of XML & RDF
Th smantic WEB Rols of XML & RDF STEFAN DECKER AND SERGEY MELNIK FRANK VAN HARMELEN, DIETER FENSEL, AND MICHEL KLEIN JEEN BROEKSTRA MICHAEL ERDMANN IAN HORROCKS Prsntd by: Iniyai Thiruvalluvan CSCI586
More informationShift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8.
Rviw: Shift-Rduc Parsing Bottom-up parsing uss two actions: Bottom-Up Parsing II Lctur 8 Shift ABC xyz ABCx yz Rduc Cbxy ijk CbA ijk Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2 Rcall: h Stack
More informationDynamic modelling of multi-physical domain system by bond graph approach and its control using flatness based controller with MATLAB Simulink
Dnamic modlling of multi-phsical domain sstm b bond graph approach and its control using flatnss basd controllr with MATLAB Simulink Sauma Ranjan Sahoo Rsarch Scholar Robotics Lab Dr. Shital S. Chiddarwar
More informationSummary: Semantic Analysis
Summary: Smantic Analysis Chck rrors not dtctd by lxical or syntax analysis Intrmdiat Cod Scop rrors: Variabls not dfind Multipl dclarations Typ rrors: Assignmnt of valus of diffrnt typs Invocation of
More informationProblem Set 1 (Due: Friday, Sept. 29, 2017)
Elctrical and Computr Enginring Mmorial Univrsity of Nwfoundland ENGI 9876 - Advancd Data Ntworks Fall 2017 Problm St 1 (Du: Friday, Spt. 29, 2017) Qustion 1 Considr a communications path through a packt
More informationTo Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1
Advancd Computr Graphics (Fall 200) CS 283, Lctur 5: Msh Data Structurs Ravi Ramamoorthi http://inst.cs.brkly.du/~cs283/fa0 To Do Assignmnt, Du Oct 7. Start rading and working on it now. Som parts you
More informationUnderstanding Patterns of TCP Connection Usage with Statistical Clustering
Th UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Undrstanding Pattrns of TCP Connction Usag with Statistical Clustring Félix Hrnándz-Campos Kvin Jffay Don Smith Dpartmnt of Computr Scinc Andrw Nobl Dpartmnt
More information1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table
1. Trac th array for Bubbl sort 34, 8, 64, 51, 3, 1. And fill in th following tabl bubbl(intgr Array x, Intgr n) Stp 1: Intgr hold, j, pass; Stp : Boolan switchd = TRUE; Stp 3: for pass = 0 to (n - 1 &&
More informationThe Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline
PS 6 Ntwork Programming Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du http://www.cs.clmson.du/~mwigl/courss/cpsc6 Th Ntwork Layr: Routing & ddrssing
More informationS (surface mount) Issue date Manufacturer package code
1. Packag summary Tabl 1. Packag summary plastic, dual in-lin compatibl thrmal nhancd vry thin quad flat packag; 16 trminals; 0.5 mm pitch; 3.5 mm x 2.5 mm x 0.85 mm body 30 January 2017 Packag information
More informationCPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy
PS Intrntworking Th Ntwork Layr: Routing & ddrssing Outlin Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du Novmbr, Ntwork layr functions Routr architctur
More informationRobust and Fault Tolerant Clock Synchronization Nikolaus Kerö, Oregano Systems Aneeq Mahmood, ZISS Thomas Kernen, Cisco Felix Ring, ZISS Tobias
Robust and Fault Tolrant Clock Synchronization Nikolaus Krö, Organo Systms Anq Mahmood, ZISS Thomas Krnn, Cisco Flix Ring, ZISS Tobias Müllr, Organo Systms Thomas Biglr, ZISS Rational Common notion of
More informationSPECKLE NOISE REDUCTION IN SAR IMAGING USING 2-D LATTICE FILTERS BASED SUBBAND DECOMPOSITION
7th Europan Signal Procssing Confrnc EUSIPCO 9 Glasgow Scotland August 4-8 9 SPECKLE REDUCTION IN SAR IMAGING USING -D LATTICE FILTERS ASED SUAND DECOMPOSITION Göhan Karasaal N.. Kaplan I. Err Informatics
More informationAbout Notes And Symbols
About Nots And Symbols by Batric Wildr Contnts Sht 1 Sht 2 Sht 3 Sht 4 Sht 5 Sht 6 Sht 7 Sht 8 Sht 9 Sht 10 Sht 11 Sht 12 Sht 13 Sht 14 Sht 15 Sht 16 Sht 17 Sht 18 Sht 19 Sht 20 Sht 21 Sht 22 Sht 23 Sht
More informationCombining Intra- and Multi-sentential Rhetorical Parsing for Document-level Discourse Analysis
Combining Intra- and Multi-sntntial htorical Parsing for Documnt-lvl Discours Analysis hafiq Joty Giuspp Carnini, aymond T. Ng, Yashar Mhdad sjoty@qf.org.qa {carnini, rng, mhdad}@cs.ubc.ca Qatar Computing
More informationTo Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1
Advancd Computr Graphics CSE 63 [Spring 207], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 28 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2
More informationTCP Congestion Control. Congestion Avoidance
TCP Congstion Control TCP sourcs chang th snding rat by modifying th window siz: Window = min {Advrtisd window, Congstion Window} Rcivr Transmittr ( cwnd ) In othr words, snd at th rat of th slowst componnt:
More informationMidterm 2 - Solutions 1
COS 26 Gnral Computr Scinc Spring 999 Midtrm 2 - Solutions. Writ a C function int count(char s[ ]) that taks as input a \ trminatd string and outputs th numbr of charactrs in th string (not including th
More informationManaging Trust Relationships in Peer 2 Peer Systems
Managing Trust Rlationships in Pr 2 Pr Systms R.S.SINJU PG STUDENT, DEPARTMENT OF COMPUTER SCIENCE, PONJESLY COLLEGE OF ENGINEERING NAGERCOIL, TAMILNADU, INDIA C.FELSY ASST.PROF, DEPARTMENT OF COMPUTER
More informationPrinciples of Programming Languages Topic: Formal Languages II
Principls of Programming Languags Topic: Formal Languags II CS 34,LS, LTM, BR: Formal Languags II Rviw A grammar can b ambiguous i.. mor than on pars tr for sam string of trminals in a PL w want to bas
More informationTo Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1
Advancd Computr Graphics CSE 63 [Spring 208], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 27 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2
More informationAN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES
AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES 1 Bassm HAIDAR, 2 Bilal CHEBARO, 3 Hassan WEHBI 1 Asstt Prof., Dpartmnt of Computr Scincs, Faculty
More informationFLASHING CHRISTMAS TREE KIT
R4 FLASHING CHRISTMAS TREE KIT 9 10 8 7 11 6 R3 12 T4 C4 5 T3 R5 R7 13 C3 C2 4 14 R1 T2 R6 3 OWNER S MANUAL T1 R8 15 2 C1 R2 1 16 Cat. No. 277-8001 CUSTOM MANUFACTURED FOR TANDY CORPORATION LTD ASSEMBLY
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University.
CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 11/26/2010 Jur Lskovc, Stanford C246: Mining Massiv Datasts 2 Givn a st of points, wit a notion of distanc btwn points,
More informationClustering Algorithms
Clustring Algoritms Applications Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 T Problm of Clustring Givn a st of points, wit a notion of distanc btwn points, group t points into som numbr of
More informationPresentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Directed Graphs BOS SFO
Prsntation for us with th txtbook, Algorithm Dsign and Applications, by M. T. Goodrich and R. Tamassia, Wily, 2015 Dirctd Graphs BOS ORD JFK SFO LAX DFW MIA 2015 Goodrich and Tamassia Dirctd Graphs 1 Digraphs
More information2 Mega Pixel. HD-SDI Bullet Camera. User Manual
2 Mga Pixl HD-SDI Bullt Camra Usr Manual Thank you for purchasing our product. This manual is only applicabl to SDI bullt camras. Thr may b svral tchnically incorrct placs or printing rrors in this manual.
More informationA Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 )
A Brif Summary of Draw Tools in MS Word with Exampls! ( Pag 1 ) Click Viw command at top of pag thn Click Toolbars thn Click Drawing! A chckmark appars in front of Drawing! A toolbar appars at bottom of
More informationIntroduction to Data Mining
Introduction to Data Mining Lctur #15: Clustring-2 Soul National Univrsity 1 In Tis Lctur Larn t motivation and advantag of BFR, an xtnsion of K-mans to vry larg data Larn t motivation and advantag of
More informationGreedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works.
Algorithm Grdy Algorithm 5- Grdy Algorithm Grd i good. Grd i right. Grd work. Wall Strt Data Structur and Algorithm Andri Bulatov Algorithm Grdy Algorithm 5- Algorithm Grdy Algorithm 5- Intrval Schduling
More informationCC-RANSAC: Fitting Planes in the Presence of Multiple Surfaces in Range Data
CC-RANSAC: Fitting Plans in th Prsnc of Multipl Surfacs in Rang Data Orazio Gallo, Robrto Manduchi Univrsity of California, Santa Cruz Abbas Rafii Cansta, Inc. Abstract Rang snsors, in particular tim-of-flight
More informationEvolutionary Clustering and Analysis of Bibliographic Networks
Evolutionary Clustring and Analysis of Bibliographic Ntworks Manish Gupta Univrsity of Illinois at Urbana-Champaign gupta58@illinois.du Charu C. Aggarwal IBM T. J. Watson Rsarch Cntr charu@us.ibm.com Jiawi
More informationTillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde
Tillförlitlig dimnsionring mot utmattning UTMIS Vårmöt 2018 på Högskolan i Skövd Rami Mansour & Mårtn Olsson KTH Hållfasthtslära mart@kth.s ramimans@kth.s Introduction Ovrviw of rliabl dsign Traditional
More informationi e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S
isto C o C or Co r op ra p a py ag yr g ri g g gh ht S S S V V K r V K r M K v M r v M rn v MW n W S r W Sa r W K af r: W K f : a H a M r T H r M rn w T H r Mo ns w T i o S ww c ig on a w c g nd af ww
More informationTerrain Mapping and Analysis
Trrain Mapping and Analysis Data for Trrain Mapping and Analysis Digital Trrain Modl (DEM) DEM rprsnts an array of lvation points. Th quality of DEM influncs th accuracy of trrain masurs such as slop and
More informationKENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION
KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION 03-4 Sub : Informatics Practics (065) Tim allowd : 3 hours Maximum Marks : 70 Instruction : (i) All qustions ar compulsory
More informationA New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight
Availabl at http://pvamudu/aam Appl Appl Math ISSN: 193-9466 Vol 6, Issu (Dcmbr 011), pp 60 619 Applications and Applid Mathmatics: An Intrnational Journal (AAM) A Nw Algorithm for Solving Shortst Path
More informationThis module calculates the motor speed based on a rotor position measurement when the direction information is available.
SPEED_FRQ Spd Calulator Basd on Rotor Angl With Dirtion Information Dsription This modul alulats th motor spd basd on a rotor position masurmnt whn th dirtion information is availabl. thta_l dir_qep SPEED_FRQ
More informationAn Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU
An Auto-tund Mthod for Solving Larg Tridiagonal Systms on th GPU Andrw Davidson Univrsity of California, Davis aaldavidson@ucdavis.du Yao Zhang Univrsity of California, Davis yaozhang@ucdavis.du John D.
More informationMultihop MIMO Relay Networks with ARQ
Multihop MIMO Rlay Ntworks with ARQ Yao Xi Dniz Gündüz Andra Goldsmith Dpartmnt of Elctrical Enginring Stanford Univrsity Stanford CA Dpartmnt of Elctrical Enginring Princton Univrsity Princton NJ Email:
More informationRegister Allocation. Register Allocation
Rgistr Allocation Jingk Li Portlan Stat Univrsity Jingk Li (Portlan Stat Univrsity) CS322 Rgistr Allocation 1 / 28 Rgistr Allocation Assign an unboun numbr of tmporaris to a fix numbr of rgistrs. Exampl:
More informationImpact & Analysis of FHE on nanoscopic TEM Images
Impact & Analysis of FHE on nanoscopic TEM Imags ABSTRACT: TEM imags ar rapidly gaining prominnc in various sctors lik lif scincs, pathology, mdical scinc, smiconductors, fornsics, tc. Hnc, thr is a critical
More informationClustering Belief Functions using Extended Agglomerative Algorithm
IJ Imag Graphics and Signal Procssing 0 - Publishd Onlin Fbruary 0 in MECS (http://wwwmcs-prssorg/ ing Blif Functions using Extndd Agglomrativ Algorithm Ying Png Postgraduat Collg Acadmy of Equipmnt Command
More informationPerformance Comparison of Data Mining Algorithms for the Predictive Accuracy of Credit Card Defaulters
178 IJCSNS Intrnational Journal of Computr Scinc and Ntwork Scurity, VOL.17 No.3, March 2017 Prformanc Comparison of Data Mining Algorithms for th Prdictiv Accuracy of Crdit Card Dfaultrs Dr. Maruf Pasha,
More informationDifferent shells (e.g. bash, ksh, tcsh, ash, sh) => different commands/scripts
Shll Programming Diffrnt hll (.g. bah, kh, tch, ah, h) => diffrnt command/cript Why a hll cript? impl way to tring togthr a bunch of UNIX-command cript ar uually fat to gt going portabl acro th whol UNIX
More informationComment (justification for change) by the MB
Editor's disposition s CD2 19763-12 as at 2013-11-03 Srial Annx (.g. 3.1) Figur/ Tabl/t (.g. Tabl 1) 001 CA 00 All All - G Canada disapprovs th draft for th rasons blow. 002 GB 01 Gnral d numbring has
More informationUsage of Ontology-Based Semantic Analysis of Complex Information Objects in Virtual Research Environments
Usag of Ontology-Basd Smantic Analysis of Complx Information Objcts in Virtual Rsarch Environmnts Julia Rogushina 1, Anatoly Gladun 2, Abdl-Badh M. Salm 3 1 Institut of Softwar Systms of National Acadmy
More informationI - Pre Board Examination
Cod No: S-080 () Total Pags: 06 KENDRIYA VIDYALAYA SANGATHAN,GUWHATI REGION I - Pr Board Examination - 04-5 Subjct Informatics Practics (Thory) Class - XII Tim: 3 hours Maximum Marks : 70 Instruction :
More informationLesson Focus: Finding Equivalent Fractions
Lsson Plans: Wk of 1-26-15 M o n Bindrs: /Math;; complt on own, thn chck togthr Basic Fact Practic Topic #10 Lsson #5 Lsson Focus: Finding Equivalnt Fractions *Intractiv Larning/Guidd Practic-togthr in
More informationWorkbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O.
Workbook for Dsigning Distributd Control Applications using Rockwll Automation s HOLOBLOC Prototyping Softwar John Fischr and Thomas O. Bouchr Working Papr No. 05-017 Introduction A nw paradigm for crating
More informationArchitecture of the ATLAS High Level Trigger Event Selection Software
Architctur of th ATLAS High Lvl Triggr Evnt Slction Softwar S. Armstrong, K.A. Assamagan, J.T. Bains, C.P. B, M. Biglitti, A. Bogarts, V. Boisvrt, M. Bosman, S. Brandt, B. Caron, P. Casado, G. Cataldi,
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 1/22/18 Jur Lskovc, Stanford CS246: Mining Massiv Datasts 2 Hig dim. data Grap data Infinit data Macin larning Apps Locality
More informationCLASSIFICATION OF C4.5 AND CART ALGORITHMS USING DECISION TREE METHOD
CLASSIFICATION OF C4.5 AND CART ALGORITHMS USING DECISION TREE METHOD Khin Lay Myint 1, Aye Aye Cho 2, Aye Mon Win 3 1 Lecturer, Faculty of Information Science, University of Computer Studies, Hinthada,
More informationA Vision-based Navigation System of Mobile Tracking Robot
A Vision-basd Navigation Systm of Mobil Tracking Robot Ji Wu Vac1av Snasl Dpt. Computr Scinc FCS VSB - Tchnical Univrsity of Ostrava Ostrava Czch Rpublic dfrmat2008 @hotmail.com vaclav. snasl @vsb.cz Ajith
More informationTowards Fractal Approach in Healthcare Information Systems: A Review
t 2 L E P U T PER J O R TI D I OCI IC 2011 O E I UIV UDET E T R I TI I K E E B DO G I M L Y I l a n o i t a rn In c i n tif i c C o n IC 2011 f r n c 0 1 Procding of th Intrnational Confrnc on dvancd cinc,
More informationVignette to package samplingdatacrt
Vigntt to packag samplingdatacrt Diana Trutschl Contnts 1 Introduction 1 11 Objctiv 1 1 Diffrnt study typs 1 Multivariat normal distributd data for multilvl data 1 Fixd ffcts part Random part 9 3 Manual
More informationLinked Data meet Sensor Networks
Digital Entrpris Rsarch Institut www.dri.i Linkd Data mt Snsor Ntworks Myriam Lggiri DERI NUI Galway, Irland Copyright 2008 Digital Entrpris Rsarch Institut. All rights rsrvd. Linkd Data mt Snsor Ntworks
More informationRFC Java Class Library (BC-FES-AIT)
RFC Java Class Library (BC-FES-AIT) HELP.BCFESDEG Rlas 4.6C SAP AG Copyright Copyright 2001 SAP AG. All Rcht vorbhaltn. Witrgab und Vrvilfältigung disr Publikation odr von Tiln daraus sind, zu wlchm Zwck
More informationFormal Foundation, Approach, and Smart Tool for Software Models Comparison
Formal Foundation, Approach, and Smart Tool for Softwar Modls Comparison Olna V. Chbanyuk, Abdl-Badh M. Salm Softwar Enginring Dpartmnt, National Aviation Univrsity, Kyiv, Ukrain Computr Scinc, Faculty
More informationPolygonal Models. Overview. Simple Data Structures. David Carr Fundamentals of Computer Graphics Spring 2004 Based on Slides by E.
INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Polygonal Modls David Carr Fundamntals of Computr Graphics Spring 200 Basd on Slids by E. Angl Fb-3-0 SMD159, Polygonal Modls 1 L Ovrviw Simpl
More informationEDI Specifications Guide. 850 Supplier Purchase Order Last Updated February 2017
EDI Spcifications Guid 850 Supplir Purchas Ordr Last Updatd Fbruary 2017 EDI Spcifications Guid 850 Purchas Ordr - Functional Group=PO VER. 4010 FISHER SCIENTIFIC This Standard contains th format and stablishs
More informationEnergy-Efficient Method to Improve TCP Performance for MANETs
nrgy-fficint Mthod to Improv TCP Prformanc for MANTs Chaoyu Xiong, Jagol Yim, Jason Ligh and Tadao Murata Computr Scinc Dpartmnt, Univrsity of Illinois at Chicago Chicago, IL 60607, USA ABSTRACT Th currnt
More informationNon Fourier Encoding For Accelerated MRI. Arjun Arunachalam Assistant Professor Electrical engineering dept IIT-Bombay
Non Fourir Encoding For Acclratd MRI Arjun Arunachalam Assistant Profssor Elctrical nginring dpt IIT-Bombay Outlin of th Prsntation An introduction to Magntic Rsonanc Imaging (MRI Th nd for spd in MRI
More informationMutual Learning to Adapt for Joint Human Parsing and Pose Estimation
Mutual Larning to Adapt for oint Human Parsing and Pos Estimation Xuchng Ni 1[0000 0003 2433 5983], iashi Fng 1, and huichng Yan 1,2 1 ECE Dpartmnt, National Univrsity of ingapor, ingapor nixuchng@u.nus.du,
More informationAUGMENTED ROBUST PCA FOR FOREGROUND-BACKGROUND SEPARATION ON NOISY, MOVING CAMERA VIDEO. Chen Gao, Brian E. Moore, and Raj Rao Nadakuditi
AUGMENTED ROBUST PCA FOR FOREGROUND-BACKGROUND SEPARATION ON NOISY, MOVING CAMERA VIDEO Chn Gao, Brian E. Moor, and Raj Rao Nadakuditi Dpartmnt of EECS, Univrsity of Michigan, Ann Arbor, MI, 4809 ABSTRACT
More informationarxiv: v1 [cs.cv] 7 Aug 2017
Larning for Activ 3D Mapping arl Zimmrmann, Tomáš Ptříčk, Vojtěch Šalanský, and Tomáš Svoboda Czch Tchnical Univrsity in Pragu, Faculty of Elctrical Enginring zimmrk@fl.cvut.cz arxiv:708.02074v [cs.cv]
More informationPortable Test Instruments Battery Operated Systems Panel Meters DESCRIPTION. Cathode (K) 1.235V. Anode (A)
Micropowr Voltag Rfrnc FATURS Low Output Voltag... 1.5V ynamic Impdanc...1Ω max 1 8 CATHO Low Tmpratur Cofficint...0ppm/ C (typ) Oprating Currnt... 10µA to 0mA 8 Pin nsoic xtndd Tmpratur Rang.. 0 C to
More informationInternet Technology 3/21/2016
Intrnt Tchnolog //6 Roting algorithm goal st hop rotr = sorc rotr last hop rotr = dstination rotr rotr Intrnt Tchnolog 8. Roting sitch rotr LAN Pal Kranoski Rtgrs Unirsit Spring 6 LAN Roting algorithm:
More informationLightweight Polymorphic Effects
Lightwight Polymorphic Effcts Lukas Rytz, Martin Odrsky, and Philipp Hallr EPFL, Switzrland, {first.last}@pfl.ch Abstract. Typ-and-ffct systms ar a wll-studid approach for rasoning about th computational
More informationA Comparison of the Radar Ray Path Equations and Approximations for Use in. Radar Data Assimilation
A Comparison of th Radar Ray Path Equations and Approximations for Us in Radar Data Assimilation Jidong Gao 1, Kith Brwstr 1 and Ming Xu 1, 1 Cntr for Analysis and Prdiction of Storms School of Mtorology,
More information1999 honda xr100r shop manual Get file honda xr100r shop manual
Download1999 honda xr100r shop. PDF ich such nn trir fur Crativ las SB0350. 1999 honda xr100r shop Gt fil - 1999 honda xr100r shop sony ricsson k300i drivr Dirct control of minions S author dtails at th
More informationArtificial Intelligence Naïve Bayes
Artificial Intelligence Naïve Bayes Instructors: David Suter and Qince Li Course Delivered @ Harbin Institute of Technology [M any slides adapted from those created by Dan Klein and Pieter Abbeel for CS188
More information: Mesh Processing. Chapter 6
600.657: Msh Procssing Chaptr 6 Quad-Dominant Rmshing Goal: Gnrat a rmshing of th surfac that consists mostly of quads whos dgs align with th principal curvatur dirctions. [Marinov t al. 04] [Alliz t al.
More informationVideo Representation. Luminance and Chrominance. Television - NTSC
Vido Rprsntation Chaptr 2: Rprsntation of Multimdia Data Audio Tchnology mags and Graphics Vido Tchnology Chaptr 3: Multimdia Systms Communication Aspcts and Srvics Chaptr 4: Multimdia Systms Storag Aspcts
More informationBuilding a Scanner, Part I
COMP 506 Ric Univrsity Spring 2018 Building a Scannr, Part I sourc cod IR Front End Optimizr Back End IR targt cod Copyright 2018, Kith D. Coopr & Linda Torczon, all rights rsrvd. Studnts nrolld in Comp
More informationA Decision Procedure for a Class of Set Constraints
A Dcision Procdur for a Class of St Constraints (Extndd A bst rad) Nvin Hintz School of Conputr Scinc Carngi Mllon Univrsity Pittsburgh, PA 15213 (nch @cs.cmu.du) Joxan Jaffar IBM T. J. Watson Rsarch Cntr
More informationBag of Words Models. CS4670 / 5670: Computer Vision Noah Snavely. Bag-of-words models 11/26/2013
CS4670 / 5670: Computer Vision Noah Snavely Bag-of-words models Object Bag of words Bag of Words Models Adapted from slides by Rob Fergus and Svetlana Lazebnik 1 Object Bag of words Origin 1: Texture Recognition
More informationOutline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops
Ercis 6 -- Loopig March 9, 6 Laboratory VI Program Cotrol Usig Loops Larry Cartto Computr Scic 6 Computig i Egirig ad Scic Outli Ercis si goals Outli tasks for rcis si Itroduc ida of std loops ad tabl
More informationFuzzy Intersection and Difference Model for Topological Relations
IFS-EUSFLT 009 Fuzzy Intrsction and Diffrnc Modl for Topological Rlations hd LOODY Flornc SEDES Jordi INGLD 3 Univrsité Paul Sabatir (UPS) Toulous, 8 Rout d Narbonn, F-306-CEDEX 9, Franc Institut d Rchrchn
More informationHeading-determination using the sensor-fusion based maritime PNT Unit
Hading-dtrmination using th snsor-fusion basd maritim PN Unit Zhn Dai, Ralf Zibold, Alxandr Born, Evlin Englr Grman Arospac Cntr (DLR) Nustrlitz, Grmany Abstract his papr prsnts th hading dtrmination tchniqu
More informationA Comparison of the Radar Ray Path Equations and Approximations for Use in Radar Data Assimilation
A Comparison of th Radar Ray Path Equations and Approximations for Us in Radar Data Assimilation Jidong Gao, Kith Brwstr and Ming Xu, Cntr for Analysis and Prdiction of Storms School of Mtorology, Univrsity
More informationLAB1: DMVPN Theory. DMVPN Theory. Disclaimer. Pag e
LAB1: DMVPN Thory Disclaimr This Configuration Guid is dsignd to assist mmbrs to nhanc thir skills in rspctiv tchnology ara. Whil vry ffort has bn mad to nsur that all matrial is as complt and accurat
More informationIntersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis
Intrsction-fr Dual Contouring on Uniform Grids: An Approach Basd on Convx/Concav Analysis Charli C. L. Wang Dpartmnt of Mchanical and Automation Enginring, Th Chins Univrsity of Hong Kong E-mail: cwang@ma.cuhk.du.hk
More informationPreviously. Part-based and local feature models for generic object recognition. Bag-of-words model 4/20/2011
Previously Part-based and local feature models for generic object recognition Wed, April 20 UT-Austin Discriminative classifiers Boosting Nearest neighbors Support vector machines Useful for object recognition
More informationAnalysis of Influence AS Path Prepending to the Instability of BGP Routing Protocol.
ISSN : 2355-9365 -Procding of Enginring : Vol.5, No.1 Mart 2018 Pag 1112 Analysis of Influnc AS Path Prpnding to th Instability of BGP Routing Protocol. Hirwandi Agusnam 1, Rndy Munadi 2, Istikmal 3 1,2,3,
More informationLearning Enhancement Team
Larning Enhanmnt Tam Modl Answrs: Intgration y Parts Ths ar th modl answrs for th worksht that has qstions on intgration y parts. Intgration y Parts stdy gid is sital for intgration y parts with a. d.
More informationElectronic Supplementary Materials. Contents. Tag Data
Elctronic Supplmntary Matrials For th manuscript: Titl: First dirct masurmnts of bhavioural rsponss by Cuvir s bakd whals to mid-frquncy activ (MFA) sonar [Short Titl: Ziphius rspons to MFA sonar] Authors:
More information2018 How to Apply. Application Guide. BrandAdvantage
2018 How to Apply Application Guid BrandAdvantag Contnts Accssing th Grant Sit... 3 Wlcom pag... 3 Logging in To Pub Charity... 4 Rgistration for Nw Applicants ( rgistr now )... 5 Organisation Rgistration...
More informationTransaction processing in real-time database systems
Rtrospctiv Thss and Dissrtations Iowa Stat Univrsity Capstons, Thss and Dissrtations 1993 Transaction procssing in ral-tim databas systms Waqar ul Haqu Iowa Stat Univrsity Follow this and additional works
More informationOn Some Maximum Area Problems I
On Som Maximum Ara Problms I 1. Introdution Whn th lngths of th thr sids of a triangl ar givn as I 1, I and I 3, thn its ara A is uniquly dtrmind, and A=s(s-I 1 )(s-i )(s-i 3 ), whr sis th smi-primtr t{i
More informationThroughput Parameter Optimization of Adaptive ARQ/HARQ Scheme
89 Throughput Paramtr Optimization of Adaptiv ARQ/HARQ Schm Ján Poctavk, Kvtoslava Kotuliaková, Jaroslav Polc, Michal Osadský, Sandra Ondrušová Dpt. of Tlcommunications, Slovak Univrsity of Tchnology Bratislava,
More informationWhere we are. Exploratory Graph Analysis (40 min) Focused Graph Mining (40 min) Refinement of Query Results (40 min)
Where we are Background (15 min) Graph models, subgraph isomorphism, subgraph mining, graph clustering Eploratory Graph Analysis (40 min) Focused Graph Mining (40 min) Refinement of Query Results (40 min)
More information