                           www.ndsu.edu/arch www.ndsu.edu/bisonconnection www.ndsu.edu/cms www.ndsu.edu/diversityresources www.ndsu.edu/english www.ndsu.edu/hnes www.ndsu.edu/its www.ndsu.edu/itsecurity www.ndsu.edu/mu www.ndsu.edu/student_success www.ndsu.edu/recordsmanagement www.ndsu.edu/tfac www.ndsu.edu/univsenate www.ndsu.edu/vpit www.ndsu.edu/vpur www.ndsu.edu/weather connectnd.ndus.edu helpcenter.ndsu.edu sits.ndus.edu ag.ndsu.edu www.ndsu.edu/finearts www.ndsu.edu/gradschool www.ndsu.edu/international www.ndsu.edu/news www.ndsu.edu/physics www.ndsu.edu/registrar www.ndsu.edu/vpsa                            www.ndsu.edu/alcoholinfo www.ndsu.edu/bulletin www.ndsu.edu/carringtonrec www.ndsu.edu/cdfs www.ndsu.edu/commencement www.ndsu.edu/communication www.ndsu.edu/counseling www.ndsu.edu/disabilityservices www.ndsu.edu/dining_services www.ndsu.edu/eci www.ndsu.edu/education www.ndsu.edu/forestservice www.ndsu.edu/ime www.ndsu.edu/modernlanguages www.ndsu.edu/oira www.ndsu.edu/pesticide www.ndsu.edu/president www.ndsu.edu/pkp www.ndsu.edu/saem www.ndsu.edu/sheepandgoat www.ndsu.edu/staff_senate www.ndsu.edu/statistics www.ndsu.edu/trio www.ndsu.edu/vpaa www.ndsu.edu/web www.ndsu.edu/webmaster www.ndsu.edu/wellness
View full slide show




• Pastoralist: http://www.newint.org/issue378/pics/life-3.jpg • Camels: http://www.thisfabtrek.com/journey/africa/mauritania/20061106-nouakchott/camels-waterhole-4.jpg • Netsilik: http://www.dreamspeakers.org/2005/images/films/through_these_eyes.jpg • Inupiat: http://images.myareaguide.com/aps/op/inup.jpg • Inupiat sled: http://assets.espn.go.com/i/eticket/20061009/photos/eticket_u_histfam_310.jpg • Bushmen: http://www.gonomad.com/lodgings/0611/namgallery-images/bushman-familyb.jpg • Bushmen hunters: http://www.gudigwa.com/images/zoom/gudigwa-bushmen-hunting.jpg • Mbuti: http://kim.uing.net/files/post_file_3980.jpg • Andaman: http://www.andaman.org/BOOK/chapter13/pla13-5.jpg • Lakota: http://www.old-picture.com/old-west/pictures/Lakota-Sioux.jpg • Bororo: http://www.gutenberg.org/files/22483/22483-h/images/ill1-232a.jpg • Blackfoot: http://www.topfoto.co.uk/gallery/AlternativeHousing/images/prevs/photri1018798.jpg • Ariaal Warrior: http://photography.nationalgeographic.com/staticfiles/NGS/Shared/StaticFiles/Photography/Images/POD/a/ariaal-wa rrior-525467-sw.jpg • Chukchee: http://polarhusky.com/logistics/chukotka/people/chukchi.attachment/logisticschukotkapeoplechukchi020/LogisticsC hukotkaPeopleChukchi020.jpg • Kurds: http://i.infoplease.com/images/home/kurds-sheep.jpg • Pastoralists and camels: http://mediaglobal.org/admin/wp-content/uploads/2007/07/pastoralists.camels.jpg • Pastoralists: http://www.mursi.org/news-items/meeting-of-pastoralists-in-south-omo-zone-planned-for-8-12-november/image_m ini • Masaai: http://www.kitumusote.org/sites/kitumusote.org/files/images/history%20of%20maasai%20page%201.img_assist_cu stom.JPG • Saami: http://upload.wikimedia.org/wikipedia/commons/thumb/8/87/Saami_Family_1900.jpg/800px-Saami_Family_1900.jp g • Akan: http://crawfurd.dk/illu/weekly/akanking.jpg • Banyoro: http://www.ugpulse.com/images/articles/daily/20060921_100_8.jpg • Garifuna: http://www.allseasonsbelize.com/images/allgemein/garifuna.jpg • Shipibo: http://www.shamanic.net/pictures/Peru2007/carlos.jpg • Tikopia: http://www.tallshipstales.de/90s/imgs/EricMatson/boys-of-tikopia.jpg • Tzeltal: http://farm2.static.flickr.com/1092/1082248917_0e9805da6e.jpg • Yanomami: http://www.giemmegi.org/images/festa-yanomami-6.jpg • Amhara: http://en.kindernothilfe.org/en/Rubrik/Countries/Africa/Ethiopia/_Better+Future+for+children__Project.html • Bengali: http://picasaweb.google.com/dleclercq/TripMiddleEastAndTheBalkans/photo#5147508446831035218 • Thai: http://www.dkimages.com/discover/previews/806/50081622.JPG • Monguor: http://www.joshuaproject.net/profiles/photos/p114229.jpg • Santhal: http://farm1.static.flickr.com/20/71832446_4854285fe0_m.jpg • Lepcha: http://www.joshuaproject.net/profiles/photos/p105723.jpg • Shluh: http://farm1.static.flickr.com/37/92620708_6928efedf0.jpg • Sinhalese: http://www.joshuaproject.net/profiles/photos/p109305.jpg • Ifugao: http://www.madnomad.com/gregg/img/cordill_01.jpg • Dogon: http://saharanvibe.blogspot.com/2007/06/dogon-people-of-bandiangara.html Graphics Cited This lecture discusses how people get their food. Of all the cultural traits, this is the most important as it conditions virtually all other social institutions.
View full slide show




Syntatic Sugar - a bunch of static’s public static Tree leaf () { return new Tree(); } public static Tree node (Object val, Tree lt, Tree rt) { return new Tree(val, lt, rt); } public static boolean isLeaf (Tree t) { return t.isLeaf; } public static Object getValue(Tree t) { return t.getValue(); } public static Tree getLeft(Tree t) { return t.getLeft(); } public static Tree getRight(Tree t){ return t.getRight(); } public static void setValue (Tree t, Object newValue) { t.setValue(newValue); } public static void setLeft (Tree t, Tree newLeft) { t.setLeft(newLeft); } public static void setRight (Tree t, Tree newRight) { t.setRight(newRight); } // using the new notation: Tree T = leaf(); T = node("A", leaf(), leaf()); Tree tl = node("B", leaf(), leaf()); Tree tr = node("C", leaf(), leaf()); setLeft(T, tl); setRight(T, tr); setValue(getLeft(T),new Integer(5)); setRight(T, getRight(getRight(T)) ); 17 - 18
View full slide show




Syntatic Sugar public static Tree leaf () { return new Tree(); } public static Tree node (Object val, Tree lt, Tree rt) { return new Tree(val, lt, rt); } public static boolean isLeaf (Tree t) { return t.isLeaf; } public static Object getValue(Tree t) { return t.getValue(); } public static Tree getLeft(Tree t) { return t.getLeft(); } public static Tree getRight(Tree t){ return t.getRight(); } public static void setValue (Tree t, Object newValue) { t.setValue(newValue); } public static void setLeft (Tree t, Tree newLeft) { t.setLeft(newLeft); } public static void setRight (Tree t, Tree newRight) { t.setRight(newRight); } Tree T = leaf(); T = node("A", leaf(), leaf()); Tree tl = node("B", leaf(), leaf()); Tree tr = node("C", leaf(), leaf()); setLeft(T, tl); setRight(T, tr); setValue(getLeft(T),new Integer(5)); setRight(T, getRight(getRight(T)) );17 - 22
View full slide show




References [1] - Stoilos,Simou,Stamou,Kollias,“Uncertainty and the Semantic Web”, http://www.image.ece.ntua.gr/php/savepaper.php?id=445, http://www.image.ece.ntua.gr/php/savepaper.php?id=445, 2006, IEEE [2] – 2008 Conference, “Uncertainty Reasoning for the Semantic Web”, http://c4i.gmu.edu/ursw/2008/index.html [3] - 2007 Conference, “Uncertainty Reasoning for the Semantic Web”, http://c4i.gmu.edu/ursw/2007/index.html [4] - Stoilos,Stamou,Tzouvaras,Pan,Horrocks, “Fuzzy OWL: Uncertainty and the Semantic Web”, http://www.image.ntua.gr/papers/398.pdf [5] - Lassila, “Some Personal Thoughts on Semantic Web and “Non-symbolic” AI”, http://c4i.gmu.edu/ursw/2008/talks/URSW2008_Keynote_Lassila.pdf, http://c4i.gmu.edu/ursw/2008/talks/URSW2008_Keynote_Lassila.pdf, 2008, ISWC [6] – Williams,Bastin,Cornford,Ingram, “Describing and Communicating Uncertainty within the Semantic Web”, http://c4i.gmu.edu/ursw/2008/papers/URSW2008_F3_WilliamsEtAl.pdf [7] – Sanchez, “Fuzzy logic and semantic web”, http://books.google.com/books? id=Cidej8b4ESIC&pg=PA4&lpg=PA4&dq=monotonic+bivalent+language&source=bl&ots=mtbZcZfaO7&sig=VtGqKXurrzl5HOw36UBTeTpdoE&hl=en&ei=sBIASpuJFonItgeKnpyTBw&sa=X&oi=book_result&ct=result&resnum=1#PPP1,M1 [8] – Klinov, Parsia, “Demonstrating Pronto: a Non-monotonic Probabilistic OWL Reasoner”, http://www.webont.org/owled/2008dc/papers/owled2008dc_paper_2.pdf [9] – Klinov, “Introducing Pronto: Probabilistic DL Reasoning in Pellet“, http://clarkparsia.com/weblog/2007/09/27/introducing-pronto/ [10] – Wikipedia Fuzzy Set theory, http://en.wikipedia.org/wiki/Fuzzy_set [11] – Wikipedia Probability Theory, http://en.wikipedia.org/wiki/Probability_theory [12] – Straccia, “A Fuzzy Description Logic for the Semantic Web”, http://www.win.tue.nl/~aserebre/ks/Lit/Straccia2006.pdf [13] – Mazzieri, Dragoni, “A Fuzzy Semantics for Semantic Web Languages”, http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-173/paper2.pdf [14] – Wikipedia Description Logic, http://en.wikipedia.org/wiki/Description_logic [15] – Ding, Peng, Pan, “BayesOWL: Uncertainty Modeling in Semantic Web Ontologies”, http://ebiquity.umbc.edu/_file_directory_/papers/217.pdf [16] – Martin-recurerda1, Robertson2, “Discovery and Uncertainty in Semantic Web Services”, http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol173/paper4.pdf [17] – “Semantic Web Services Framework (SWSF) Overview”, http://www.w3.org/Submission/SWSF/ [18] – Nagy,Vargas-Vera,Motta, “Uncertain Reasoning for Creating Ontology Mapping on the Semantic Web”, http://c4i.gmu.edu/ursw/2007/files/papers/URSW2007_P2_NagyVeraMotta.pdf [19] – Ceravolo, Damiani,Leida, “Which Role for an Ontology of Uncertainty?”, http://c4i.gmu.edu/ursw/2008/papers/URSW2008_P6_CeravoloEtAl.pdf [20] – Laskey, Laskey, “Uncertainty Reasoning for the World Wide Web: Report on the URW3-XG Incubator Group”, http://c4i.gmu.edu/ursw/2008/papers/URSW2008_FX_LaskeyLaskey.pdf [21] – Costa, Laskey, “PR-OWL: A Framework for Probabilistic Ontologies”, http://volgenau.gmu.edu/~klaskey/papers/FOIS2006_CostaLaskey.pdf [22] – Wang, “Integrating Uncertainty Into Ontology Mapping”, http://iswc2007.semanticweb.org/papers/955.pdf
View full slide show




University Nursing Degree Program Websites  UTMB – Galveston School of Nursing: http://www.son.utmb.edu/programsofstudy/RN-BSN/entrancerequirements.cfm    UT Health Science Center – Houston: http://son.uth.tmc.edu/prospstudent/bsn/default.htm    UT – Arlington College of Nursing: http://www.uta.edu/nursing/RN-to-BSN/program.php    University of Phoenix: http://www.phoenix.edu/alliance/lonestar.html    UH – Victoria School of Nursing: http://lonestar.edu/departments/studentservices/UHVNursingArticulation12.8.2010_(2)_newest_agreement_without_signat ures.. pdf http://www.uhv.edu/nursing/    TWU – Houston College of Nursing: http://www.twu.edu/nursing/houston-center.asp    Texas A&M Health Science Center College of Nursing: http://nursing.tamhsc.edu/future/index.html    SFASU School of Nursing: http://www.fp.sfasu.edu/nursing/    SHSU Nursing Program: http://www.shsu.edu/~nursing/    PVAMU College of Nursing: http://www.pvamu.edu/pages/1029.asp  Lamar University: http://dept.lamar.edu/nursing/RNtoBSN.html    Chamberlain College of Nursing: http://www.chamberlain.edu/    Capella University: http://www.capella.edu/schools_programs/undergraduate_studies/bsn/rn_to_bsn_completion.aspx
View full slide show




Resources & Contacts Resources: Wire Transfer Packet: http://msudenver.edu/controller/accountspayableaptravel/ eMarket Information: https://www.msudenver.edu/cashier/emarket/ Tax Corner: http://msudenver.edu/controller/taxcorner/ Travel Document Information: http://msudenver.edu/controller/accountspayableaptravel/ Deposit forms: http://www.msudenver.edu/cashier/policiesandforms/ Contacts: Accounting Services: 303-615-0039  Travel Questions: [email protected]  Tax Form/Fund Creation Questions: [email protected]  Wire Information: [email protected]  Corporate Card: [email protected]  Grants: [email protected] Payment Request: http://msudenver.edu/controller/accountspayableaptravel/ Travel Checklist: http://msudenver.edu/controller/accountspayableaptravel/ Money in-Money Out Checklist: http://msudenver.edu/controller/accountspayableaptravel/ Banner Training: http://msudenver.edu/controller/training/ Banner Finance Security Request Form: http://msudenver.edu/controller/training/ Cashier’s Office: www.msudenver.edu/cashiers/ Signatory Authorization Form: http://msudenver.edu/controller/accountspayableaptravel/ Corporate Card Handbook: http://msudenver.edu/controller/corporatecards/ Office of Cashiering: 303-615-0071, [email protected]
View full slide show




Schreiber, Schwöbbermeyer [12] proposed flexible pattern finder (FPF) in a system Mavisto.[23] It exploits downward closure , applicable for frequency concepts F2 and F3. The downward closure property asserts that the frequency for sub-graphs decrease monotonically by increasing the size of sub-graphs; but it does not hold necessarily for frequency concept F1. FPF is based on a pattern tree (see figure) consisting of nodes that represents different graphs (or patterns), where the parent is a sub-graph of its children nodes; i.e., corresp. graph of each pattern tree’s node is expanded by adding a new edge of its parent node. At first, FPF enumerates and maintains info of all matches of a sub-graph at the root of the pattern tree. Then builds child nodes of previous node by adding 1 edge supported by a matching edge in target graph, tries to expand all of previous info about matches to the new sub-graph (child node).[In next step, it decides whether the frequency of the current pattern is lower than a predefined threshold or not. If it is lower and if downward closure holds, FPF can abandon that path and not traverse further in this part of the tree; as a result, unnecessary computation is avoided. This procedure is continued until there is no remaining path to traverse. It does not consider infrequent sub-graphs and tries to finish the enumeration process as soon as possible; therefore, it only spends time for promising nodes in the pattern tree and discards all other nodes. As an added bonus, the pattern tree notion permits FPF to be implemented and executed in a parallel manner since it is possible to traverse each path of the pattern tree independently. But, FPF is most useful for frequency concepts F2 and F3, because downward closure is not applicable to F1. Still the pattern tree is still practical for F1 if the algorithm runs in parallel. It has no limitation on motif size, which makes it more amenable to improvements. ESU (FANMOD) Sampling bias of Kashtan et al. [9] provided great impetus for designing better algs for NM discovery, Even after weighting scheme, this method imposed an undesired overhead on the running time as well a more complicated impl. It supports visual options and is time efficient. But it doesn’t allow searching for motifs of size 9. Wernicke [10] RAND-ESU is better than jfinder, based on the exact enumeration algorithm ESU, has been implemented as an app called FANMOD.[10] Rand-esu is a discovery alg applicable for both directed and undirected networks. It effectively exploits an unbiased node sampling, and prevents overcounting sub-graphs. RAND-ESU uses DIRECT for determining sub-graph significance instead of an ensemble of random networks as a Null-model. DIRECT estimates sub-graph # w/oexplicitly generating random networks.[10] Empirically, DIRECT is more efficient than random network ensemble for sub-graphs with a very low concentration. But classical Null-model is faster than DIRECT for highly concentrated sub-graphs.[3][10] ESU alg: We show how this exact algorithm can be modified efficiently to RAND-ESU that estimates sub-graphs concentrations. The algorithms ESU and RAND-ESU are fairly simple, and hence easy to implement. ESU first finds the set of all induced sub-graphs of size k, let Sk be this set. ESU can be implemented as a recursive function; the running of this function can be displayed as a tree-like structure of depth k, called the ESU-Tree (see figure). Each of the ESU-Tree nodes indicate the status of the recursive function that entails two consecutive sets SUB and EXT. SUB refers to nodes in the target network that are adjacent and establish a partial sub-graph of size |SUB|≤k. If |SUB|=k, alg has found induced complete sub-graph, Sk=SUB ∪Sk. If |SUB|v} graphs of size 3 in the target graph. call ExtendSubgraph({v}, VExtension, v) endfor Leaves: set S3 or all of size-3 induced sub-graphs of the target graph (a). ESUtree nodes incl 2 adjoining sets: adjacent ExtendSubgraph(VSubgraph, VExtension, v) nodes called SUB and EXT=all adjacent if |VSubG|=k output G[VSubG] return 1 SUB node and where their numerical While VExt≠∅ do Remove arbitrary vertex w from VExt labels > SUB nodes labels. EXT set is VExtension′←VExtension∪{u∈Nexcl(w,VSubgraph)|u>v} utilized by the alg to expand a SUB set call ExtendSubgraph(VSubgraph ∪ {w}, VExtension′, v) until it reaches a desired size placed at return lowest level of ESU-Tree (or its leaves).
View full slide show




Title IX Coordinators, Public Safety Directors, Chief Student Affairs Officers Chief Student Affairs Title IX Coordinators Kieran Batts Morrow (646) 312-4542 kieran.morrow@baruch.cuny.edu Angela Sales (212) 220-1237 asales@bmcc.cuny.edu Jesenia Minier-Delgado (718) 289-5288 jesenia.minier-delgado@bcc.cuny.edu Natalie Mason-Kinsey (718) 951-4128 nmasonkinsey@brooklyn.cuny.edu Michele Baptiste, Esq. (212) 650-6310 mbaptiste@ccny.cuny.edu Danille Dimitrov, Esq. (718) 982-2250 danielle.dimitrov@csi.cuny.edu Edith Rivera (212) 817-7410 erivera@gc.cuny.edu Amy Dunkin (646) 758-7826 amy.dunkin@journalism.cuny.edu Raquel Gabriel (718) 340-4249 raquel.gabriel@law.cuny.edu Public Safety Directors Baruch Henry J. McLaughlin (646) 660-6010 henry_mclaughlin@baruch.cuny.edu BMCC Mike Korn (212) 220-8135 mkorn@bmcc.cuny.edu Bronx CC James Verdicchio (718) 289-5922 / (718) 289-5390 james.verdicchio@bcc.cuny.edu Brooklyn College Donald Wenz (718) 951-5511 / (718) 951-5444 donald@brooklyn.cuny.edu City College Pasquale Morena (212) 650-7997 / (212) 650-6911 pmorena@ccny.cuny.edu College of Staten Island Robert Wilson (718) 982-2113 robert.wilson@csi.cuny.edu Graduate Center John Flaherty (212) 817-7761 / (212) 817-7777 jflaherty@gc.cuny.edu School of Journalism Pamela Drayton (646) 758-7834 pamela.drayton@journalism.cuny.edu School of Law Steve A. Katz (718) 340-4271 / (718) 340-4270 katz@mail.law.cuny.edu 72 Officers Art King (646) 312-4570 art.king@baruch.cuny.edu Marva Craig (212) 220-8130 mcraig@bmcc.cuny.edu Athos Brewer (718) 289-5869 athos.brewer@bcc.cuny.edu Milga Morales (718) 951-5352 milga@brooklyn.cuny.edu Juana Reina (212) 650-5426 Jreina@ccny.cuny.edu Ramona Brown (718) 982-2335 Aramona.Brown@csi.cuny.edu Matthew Schoengood (212) 817-7400 mschoengood@gc.cuny.edu Christa Noelle (646) 758-7703 Christa.noelle@journalism.cuny.edu Cheryl Howard (718) 340-4487 Howard@mail.law.cuny.edu
View full slide show