<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/tag/learning"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /tag/learning</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/203f74a32e09a85175c4c08e49d434405/yish"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/203f74a32e09a85175c4c08e49d434405/yish"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://cloudworks.ac.uk/cloud/view/2536"/><swrc:date>Mon Feb 13 17:04:22 CET 2012</swrc:date><swrc:title>Learning Design vs. Instructional Design</swrc:title><swrc:type>Cloudworks discussion</swrc:type><swrc:year>2009</swrc:year><swrc:keywords>cloudworks design education instructional learning </swrc:keywords><swrc:abstract>What are the differences between learning design and instructional design?  Is it the approach?  The breadth?  The focus?  The audience?  Or is a just a new term for the same thing?</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Kathy Siedlaczek"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gráinne Conole"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Linda Castañeda"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Rebecca Galley"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Rosario Passos"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Martin Owen"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Thomas Ryberg"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Alfred Low"/></rdf:_8><rdf:_9><swrc:Person swrc:name="LeRoy Hill"/></rdf:_9><rdf:_10><swrc:Person swrc:name="Simon Cross"/></rdf:_10></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/217899f3317b5b73aa321066da55b17e8/schmidt2"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/217899f3317b5b73aa321066da55b17e8/schmidt2"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="/brokenurl#www.inference.phy.cam.ac.uk/mackay/exams.pdf"/><swrc:date>Thu Feb 09 23:09:32 CET 2012</swrc:date><swrc:title>Everyone Should Get an A</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>exams higher_education learning teaching </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="David MacKay"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/203cdf152fb5df8a2196983b6bcb16ef9/schmidt2"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/203cdf152fb5df8a2196983b6bcb16ef9/schmidt2"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://doi.acm.org/10.1145/1404520.1404523"/><swrc:date>Thu Feb 09 22:47:33 CET 2012</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>Proceedings of the Fourth international Workshop on Computing Education Research</swrc:booktitle><swrc:pages>15--26</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:series>ICER &#039;08</swrc:series><swrc:title>Abstraction ability as an indicator of success for learning computing science?</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>ability abstraction indicator learning programming toread </swrc:keywords><swrc:abstract>Computing scientists generally agree that abstract thinking is a crucial component for practicing computer science.&lt;/p&gt; &lt;p&gt;We report on a three-year longitudinal study to confirm the hypothesis that general abstraction ability has a positive impact on performance in computing science.&lt;/p&gt; &lt;p&gt;Abstraction ability is operationalized as stages of cognitive development for which validated tests exist. Performance in computing science is operationalized as grade in the final assessment of ten courses of a bachelor&#039;s degree programme in computing science. The validity of the operationalizations is discussed.&lt;/p&gt; &lt;p&gt;We have investigated the positive impact overall, for two groupings of courses (a content-based grouping and a grouping based on SOLO levels of the courses&#039; intended learning outcome), and for each individual course.&lt;/p&gt; &lt;p&gt;Surprisingly, our study shows that there is hardly any correlation between stage of cognitive development (abstraction ability) and final grades in standard CS courses, neither for the various group-ings, nor for the individual courses. Possible explanations are discussed.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1404523" swrc:key="acmid"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Sydney, Australia" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-1-60558-216-0" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="12" swrc:key="numpages"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1145/1404520.1404523" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Jens Bennedssen"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Michael E. Caspersen"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2658dcf8a86184ac2f70317f04828763a/sidyr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2658dcf8a86184ac2f70317f04828763a/sidyr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/nips/nips2007.html#ChechetkaG07"/><swrc:date>Thu Feb 09 06:41:59 CET 2012</swrc:date><swrc:booktitle>NIPS</swrc:booktitle><swrc:crossref>conf/nips/2007</swrc:crossref><swrc:publisher><swrc:Organization swrc:name="Curran Associates, Inc."/></swrc:publisher><swrc:title>Efficient Principled Learning of Thin Junction Trees.</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>bayesian learning tree-width </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://books.nips.cc/papers/files/nips20/NIPS2007_1021.pdf" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Anton Chechetka"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Carlos Guestrin"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="John C. Platt"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Daphne Koller"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Yoram Singer"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Sam T. Roweis"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21bacff4727755b0d74610da3b373a30e/sidyr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21bacff4727755b0d74610da3b373a30e/sidyr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://cocosci.berkeley.edu/tom/papers/probmodelsofcognition.pdf"/><swrc:date>Wed Feb 08 12:50:45 CET 2012</swrc:date><swrc:journal>Trends in Cognitive Sciences</swrc:journal><swrc:month>June</swrc:month><swrc:number>8</swrc:number><swrc:pages>357-364</swrc:pages><swrc:title>Probabilistic models of cognition: exploring representations and inductive biases</swrc:title><swrc:volume>14</swrc:volume><swrc:year>2010</swrc:year><swrc:keywords>cognition learning models probabilistic </swrc:keywords><swrc:day>23</swrc:day><swrc:abstract>Cognitive science aims to reverse-engineer the mind, and many of the engineering challenges the mind faces involve induction. The probabilistic approach to modeling cognition begins by identifying ideal solutions to these inductive problems. Mental processes are then modeled using algorithms for approximating these solutions, and neural processes are viewed as mechanisms for implementing these algorithms, with the result being a top-down analysis of cognition starting with the function of cognitive processes. Typical connectionist models, by contrast, follow a bottom-up approach, beginning with a characterization of neural mechanisms and exploring what macro-level functional phenomena might emerge. We argue that the top-down approach yields greater flexibility for exploring the representations and inductive biases that underlie human cognition.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thomas L. Griffiths"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nick Chater"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Charles Kemp"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Amy Perfors"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Joshua B. Tenenbaum"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2019b90333189d1f4729b03df53c848dc/sidyr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2019b90333189d1f4729b03df53c848dc/sidyr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/acl/acl2004.html#KleinM04"/><swrc:date>Wed Feb 08 09:50:37 CET 2012</swrc:date><swrc:booktitle>ACL</swrc:booktitle><swrc:crossref>conf/acl/2004</swrc:crossref><swrc:pages>478-485</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACL"/></swrc:publisher><swrc:title>Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency.</swrc:title><swrc:year>2004</swrc:year><swrc:keywords>dependency grammar learning unsupervised </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://acl.ldc.upenn.edu/acl2004/main/pdf/341_pdf_2-col.pdf" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dan Klein"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Christopher D. Manning"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Donia Scott"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Walter Daelemans"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Marilyn A. Walker"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2873c1a387c202cecd2567b26fe9d0402/sidyr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2873c1a387c202cecd2567b26fe9d0402/sidyr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1017/S0022226707004628"/><swrc:date>Wed Feb 08 09:22:36 CET 2012</swrc:date><swrc:journal>Journal of Linguistics</swrc:journal><swrc:number>02</swrc:number><swrc:pages>393--427</swrc:pages><swrc:title>Machine learning theory and practice as a source of insight into universal grammar</swrc:title><swrc:volume>43</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>grammar language learning machine universal </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2008-05-22 12:51:42" swrc:key="posted-at"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="5" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2330287" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1017/S0022226707004628" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Shalom Lappin"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Stuart M. Shieber"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2fef51a34106d013137eabb1c566cfd88/sidyr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2fef51a34106d013137eabb1c566cfd88/sidyr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1187953/"/><swrc:date>Wed Feb 08 06:59:37 CET 2012</swrc:date><swrc:journal>Proc Natl Acad Sci U S A</swrc:journal><swrc:month>aug</swrc:month><swrc:number>33</swrc:number><swrc:pages>11629-11634</swrc:pages><swrc:title>Unsupervised learning of natural languages</swrc:title><swrc:volume>102</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>language learning model unsupervised </swrc:keywords><swrc:abstract>We address the problem, fundamental to linguistics, bioinformatics, and certain other disciplines, of using corpora of raw symbolic sequential data to infer underlying rules that govern their production. Given a corpus of strings (such as text, transcribed speech, chromosome or protein sequence data, sheet music, etc.), our unsupervised algorithm recursively distills from it hierarchically structured patterns. The adios (automatic distillation of structure) algorithm relies on a statistical method for pattern extraction and on structured generalization, two processes that have been implicated in language acquisition. It has been evaluated on artificial context-free grammars with thousands of rules, on natural languages as diverse as English and Chinese, and on protein data correlating sequence with function. This unsupervised algorithm is capable of learning complex syntax, generating grammatical novel sentences, and proving useful in other fields that call for structure discovery from raw data, such as bioinformatics.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="16087885" swrc:key="pmid"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1073/pnas.0409746102" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name=" Solan"/></rdf:_1><rdf:_2><swrc:Person swrc:name="D Horn"/></rdf:_2><rdf:_3><swrc:Person swrc:name="E Ruppin"/></rdf:_3><rdf:_4><swrc:Person swrc:name="S Edelman"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25ef80c896354d96906b6a50b5d40e57e/yish"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25ef80c896354d96906b6a50b5d40e57e/yish"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://idoroll.org/proceedings/files/Roll_ITS10.pdf"/><swrc:date>Sun Feb 05 23:35:21 CET 2012</swrc:date><swrc:booktitle>Intelligent Tutoring Systems</swrc:booktitle><swrc:organization><swrc:Organization swrc:name="Springer"/></swrc:organization><swrc:pages>115--124</swrc:pages><swrc:title>The invention lab: Using a hybrid of model tracing and constraint-based modeling to offer intelligent support in inquiry environments</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>aied inquiry intelligent its learning support tutoring </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="I. Roll"/></rdf:_1><rdf:_2><swrc:Person swrc:name="V. Aleven"/></rdf:_2><rdf:_3><swrc:Person swrc:name="K. Koedinger"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/26ff3520f5e5ca958c8c5ea1fbe1d7a22/sidyr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/26ff3520f5e5ca958c8c5ea1fbe1d7a22/sidyr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Sat Feb 04 10:41:58 CET 2012</swrc:date><swrc:journal>Annals of Statistics</swrc:journal><swrc:number>3</swrc:number><swrc:pages>1171--1220</swrc:pages><swrc:title>Kernel methods in machine learning</swrc:title><swrc:volume>36</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>kernel-methods learning machine </swrc:keywords><swrc:abstract>We review machine learning methods employing positive definite kernels. These methods formulate learning and estimation problems in a reproducing kernel Hilbert space (RKHS) of functions defined on the data domain, expanded in terms of a kernel. Working in linear spaces of function has the benefit of facilitating the construction and analysis of learning algorithms while at the same time allowing large classes of functions. The latter include nonlinear functions as well as functions defined on nonvectorial data.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2009-04-10 21:44:11" swrc:key="posted-at"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="5" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thomas Hofmann"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Bernhard Sch\&#034;{o}lkopf"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Alexander J. Smola"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/216d03a0e8ac507ce0f08605d713885f3/yish"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/216d03a0e8ac507ce0f08605d713885f3/yish"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1007/s11858-010-0290-5"/><swrc:date>Wed Feb 01 13:07:34 CET 2012</swrc:date><swrc:journal>ZDM</swrc:journal><swrc:note>10.1007/s11858-010-0290-5</swrc:note><swrc:pages>91-103</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer Berlin / Heidelberg"/></swrc:publisher><swrc:title>Using comics-based representations of teaching, and technology, to bring practice to teacher education courses</swrc:title><swrc:volume>43</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>LDG design education learning mathematics practice representation representations teaching </swrc:keywords><swrc:abstract>This article situates comic-based representations of teaching in the long history of tensions between theory and practice in teacher education. The article argues that comics can be semiotic resources in learning to teach and suggests how information technologies can support experiences with comics in university mathematics methods courses that (a) help learners see the mathematical work of teaching in lessons they observe, (b) allow candidates to explore tactical decision-making in teaching, and (c) support preservice teachers in rehearsing classroom interactions.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1863-9690" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1" swrc:key="issue"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Humanities, Social Sciences and Law" swrc:key="keyword"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="University of Michigan, Ann Arbor, MI USA" swrc:key="affiliation"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Patricio Herbst"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Daniel Chazan"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Chia-Ling Chen"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Vu-Minh Chieu"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Michael Weiss"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/236ee6b8d66d8c0673dd0de67ac3e4bb2/muhe"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/236ee6b8d66d8c0673dd0de67ac3e4bb2/muhe"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Fri Jan 27 14:10:42 CET 2012</swrc:date><swrc:journal>Hearing Research</swrc:journal><swrc:pages>142-154</swrc:pages><swrc:title>Individual differences and left-right asymmetries in auditory space
	perception --Localization of low frequency sounds in free field</swrc:title><swrc:volume>255</swrc:volume><swrc:year>2009</swrc:year><swrc:keywords>Auditory Binaural Hearing; Individual Learning cues; differences; localization; </swrc:keywords><swrc:abstract>The number of subjects in studies on human spatial hearing is generally
	small. Therefore, individual differences and the factors underlying
	variability are unknown. In this study, we investigated across-listener
	variability in auditory localization abilities in a group of 50 naïve
	adults with normal hearing. Targets were trains of low-frequency
	noise bursts presented to 1 of 12 hidden speakers in the azimuthal
	plane. We observed less across-listener variability in the variance
	of individual responses but more in the root-mean-square and signed
	errors, which tended to increase with target angle. One third of
	the listeners demonstrated systematically smaller signed errors with
	left-sided targets than with right-sided ones. These asymmetries
	were observed less frequently in left-handers and females than in
	right-handers and males. Performance was not correlated with age.
	About 4 of 6 listeners trained with sensory feedback showed no reduction
	of asymmetries with training but rather showed a reduction in errors
	on their “best” side. Across-listener variability in the asymmetry
	of brain organization, notably linked to handedness or gender, is
	discussed.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="Individual differences and left-right asymmetries in auditory space perception --Localization of low frequency sounds in free field.pdf:2009\\Individual differences and left-right asymmetries in auditory space perception --Localization of low frequency sounds in free field.pdf:PDF" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Mu" swrc:key="owner"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sophie Savel"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24521f8dd6573972a5a37f0589d4018d0/muhe"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24521f8dd6573972a5a37f0589d4018d0/muhe"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Fri Jan 27 14:10:42 CET 2012</swrc:date><swrc:journal>United States Department of Agriculture</swrc:journal><swrc:title>An Enquiry Into the Method of Paired Comparison- Reliability, Scaling,
	and Thurstones Law of Comparative Judgment</swrc:title><swrc:year>2009</swrc:year><swrc:keywords>Public consistency, judgments, learning preference random reliability, response scaling, time, utility, </swrc:keywords><swrc:abstract>The method of paired comparisons is used to measure individuals’ preference
	orderings of items presented to them as discrete binary choices.
	This paper reviews the theory and application of the paired comparison
	method, describes a new computer program available for eliciting
	the choices, and presents an analysis of methods for scaling paired
	choice data to estimate an interval scale measure of preference.
	A new procedure for isolating an individual’s inconsistent choices
	is described. Using data from five empirical studies, the reliability
	of respondents’ paired choices is assessed using measures of internal
	reliability, choice consistency, and test-retest reliability.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="An Enquiry Into the Method of Paired Comparison- Reliability, Scaling, and Thurstones Law of Comparative Judgment.pdf:2009\\An Enquiry Into the Method of Paired Comparison- Reliability, Scaling, and Thurstones Law of Comparative Judgment.pdf:PDF" swrc:key="file"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2009\An Enquiry Into the Method of Paired Comparison- Reliability, Scaling, and Thurstones Law of Comparative Judgment.pdf" swrc:key="pdf"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Mu" swrc:key="owner"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thomas C. Brown"/></rdf:_1><rdf:_2><swrc:Person swrc:name="George L. Peterson"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f01a78e5a23ace2e7a88c2bbe1253a81/khilgenberg"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f01a78e5a23ace2e7a88c2bbe1253a81/khilgenberg"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1145/1835449.1835522"/><swrc:date>Thu Jan 26 13:12:53 CET 2012</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>{Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval}</swrc:booktitle><swrc:pages>435--442</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:series>SIGIR &#039;10</swrc:series><swrc:title>{Uncovering Social Spammers: Social Honeypots + Machine Learning.}</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>2011 classifier honeypots kde learning machine myspace seminar social spam twitter </swrc:keywords><swrc:abstract>{Web-based social systems enable new community-based opportunities for participants to engage, share, and interact. This community value and related services like search and advertising are threatened by spammers, content polluters, and malware disseminators. In an effort to preserve community value and ensure longterm success, we propose and evaluate a honeypot-based approach for uncovering social spammers in online social systems. Two of the key components of the proposed approach are: (1) The deployment of social honeypots for harvesting deceptive spam profiles from social networking communities; and (2) Statistical analysis of the properties of these spam profiles for creating spam classifiers to actively filter out existing and new spammers. We describe the conceptual framework and design considerations of the proposed approach, and we present concrete observations from the deployment of social honeypots in MySpace and Twitter. We find that the deployed social honeypots identify social spammers with low false positive rates and that the harvested spam data contains signals that are strongly correlated with observable profile features (e.g., content, friend information, posting patterns, etc.). Based on these profile features, we develop machine learning based classifiers for identifying previously unknown spammers with high precision and a low rate of false positives.}</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2011-09-09 19:02:50" swrc:key="posted-at"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Geneva, Switzerland" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-1-4503-0153-4" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="7532510" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1145/1835449.1835522" swrc:key="citeulike-linkout-1"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://portal.acm.org/citation.cfm?id=1835449.1835522" swrc:key="citeulike-linkout-0"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1145/1835449.1835522" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Kyumin Lee"/></rdf:_1><rdf:_2><swrc:Person swrc:name="James Caverlee"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Steve Webb"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/278b3de25f9dfe7ac03e9fb7c245114aa/khilgenberg"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/278b3de25f9dfe7ac03e9fb7c245114aa/khilgenberg"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><swrc:date>Thu Jan 26 13:12:53 CET 2012</swrc:date><swrc:publisher><swrc:Organization swrc:name="{Prentice-Hall}"/></swrc:publisher><swrc:title>Artificial {I}ntelligence: {A} {M}odern {A}pproach</swrc:title><swrc:year>1995</swrc:year><swrc:keywords>2011 artificial intelligence kde learning machine seminar twitter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0-13-360124-2" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Stuart Russell"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Peter Norvig"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23a5dce655efa6172d4ef01bc4ea0d412/khilgenberg"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23a5dce655efa6172d4ef01bc4ea0d412/khilgenberg"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Thu Jan 26 13:12:53 CET 2012</swrc:date><swrc:booktitle>{Proceedings of the Seventh Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference (CEAS)}</swrc:booktitle><swrc:month>jul</swrc:month><swrc:title>{Detecting Spammers on {Twitter}.}</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>2011 SVM analysis attribute classifier kde learning machine seminar spam twitter </swrc:keywords><swrc:abstract>{With millions of users tweeting around the world, real
time search systems and diﬀerent types of mining tools are
emerging to allow people tracking the repercussion of events
and news on Twitter. However, although appealing as mechanisms to ease the spread of news and allow users to discuss
events and post their status, these services open opportunities for new forms of spam. Trending topics, the most
talked about items on Twitter at a given point in time, have
been seen as an opportunity to generate traﬃc and revenue.
Spammers post tweets containing typical words of a trending topic and URLs, usually obfuscated by URL shorteners,
that lead users to completely unrelated websites. This kind
of spam can contribute to de-value real time search services
unless mechanisms to ﬁght and stop spammers can be found.
In this paper we consider the problem of detecting spammers on Twitter. We ﬁrst collected a large dataset of Twitter that includes more than 54 million users, 1.9 billion links,
and almost 1.8 billion tweets. Using tweets related to three
famous trending topics from 2009, we construct a large labeled collection of users, manually classiﬁed into spammers
and non-spammers. We then identify a number of characteristics related to tweet content and user social behavior,
which could potentially be used to detect spammers. We
used these characteristics as attributes of machine learning process for classifying users as either spammers or nonspammers. Our strategy succeeds at detecting much of the
spammers while only a small percentage of non-spammers
are misclassiﬁed. Approximately 70\% of spammers and 96\%
of non-spammers were correctly classiﬁed. Our results also
highlight the most important attributes for spam detection
on Twitter.}</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="2011-09-09 18:58:57" swrc:key="posted-at"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Washington, DC, USA" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="3" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="8510242" swrc:key="citeulike-article-id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://ceas.cc/2010/papers/Paper\%2021.pdf" swrc:key="citeulike-linkout-0"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Fabricio Benevenuto"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gabriel Magno"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Tiago Rodrigues"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Virgilio Almeida"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e50bafe278b8194bd4b74c2bdf84150c/khilgenberg"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e50bafe278b8194bd4b74c2bdf84150c/khilgenberg"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InCollection"/><swrc:date>Thu Jan 26 13:12:53 CET 2012</swrc:date><swrc:address>Berlin, Heidelberg</swrc:address><swrc:booktitle>{Data and Applications Security and Privacy XXIV}</swrc:booktitle><swrc:chapter>25</swrc:chapter><swrc:pages>335--342</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer Berlin / Heidelberg"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>{Detecting Spam Bots in Online Social Networking Sites: A Machine Learning Approach.}</swrc:title><swrc:volume>6166</swrc:volume><swrc:year>2010</swrc:year><swrc:keywords>2011 bayes classifier kde learning machine seminar spam twitter </swrc:keywords><swrc:abstract>{As online social networking sites become more and more popular, they have also attracted the attentions of the spammers. In this paper, Twitter, a popular micro-blogging service, is studied as an example of spam bots detection in online social networking sites. A machine learning approach is proposed to distinguish the spam bots from normal ones. To facilitate the spam bots detection, three graph-based features, such as the number of friends and the number of followers, are extracted to explore the unique follower and friend relationships among users on Twitter. Three content-based features are also extracted from user&#039;s most recent 20 tweets. A real data set is collected from Twitter&#039;s public available information using two different methods. Evaluation experiments show that the detection system is efficient and accurate to identify spam bots in Twitter.}</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Alex Wang"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sara Foresti"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Sushil Jajodia"/></rdf:_2></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/205925336706e338174509256ef4c1eae/khilgenberg"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/205925336706e338174509256ef4c1eae/khilgenberg"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Thu Jan 26 13:12:53 CET 2012</swrc:date><swrc:booktitle>{Proceedings of the International Conference on Security and Cryptography (SECRYPT)}</swrc:booktitle><swrc:month>jul</swrc:month><swrc:title>{Dont&#039;t Follow me: Spam Detection in Twitter.}</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>2011 bayes classifier kde learning machine seminar spam twitter </swrc:keywords><swrc:abstract>{The rapidly growing social network Twitter has been infiltrated by large amount of spam. In this paper, a spam detection prototype system is proposed to identify suspicious users on Twitter. A directed social graph model is proposed to explore the  ” follower” and  ” friend” relationships among Twitter. Based on Twitter&#039;s spam policy, novel content-based features and graph-based features are also proposed to facilitate spam detection. A Web crawler is developed relying on API methods provided by Twitter. Around 25K users, 500K tweets, and 49M follower/friend relationships in total are collected from public available data on Twitter. Bayesian classification algorithm is applied to distinguish the suspicious behaviors from normal ones. I analyze the data set and evaluate the performance of the detection system. Classic evaluation metrics are used to compare the performance of various traditional classification methods. Experiment results show that the Bayesian classifier has the best overall performance in term of F-measure. The trained classifier is also applied to the entire data set. The result shows that the spam detection system can achieve 89\% precision.}</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Alex H. Wang"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20060d548e2366ef6e264791425b1cd86/khilgenberg"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20060d548e2366ef6e264791425b1cd86/khilgenberg"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/www/www2010.html#LeeCW10"/><swrc:date>Thu Jan 26 13:12:53 CET 2012</swrc:date><swrc:booktitle>WWW</swrc:booktitle><swrc:pages>1139-1140</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>{The Social Honeypot Project: Protecting Online Communities from Spammers.}</swrc:title><swrc:year>2010</swrc:year><swrc:keywords>2011 classifier honeypots kde learning machine myspace seminar social spam twitter </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1772690.1772843" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="978-1-60558-799-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Kyumin Lee"/></rdf:_1><rdf:_2><swrc:Person swrc:name="James Caverlee"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Steve Webb"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael Rappa"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Paul Jones"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Juliana Freire"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Soumen Chakrabarti"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24f04297e0777557fd6064fd49d8c3c4e/enitsirhc"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24f04297e0777557fd6064fd49d8c3c4e/enitsirhc"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://doi.ieeecomputersociety.org/10.1109/WMUTE.2008.37"/><swrc:date>Thu Jan 19 16:07:53 CET 2012</swrc:date><swrc:booktitle>Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education</swrc:booktitle><swrc:organization><swrc:Organization swrc:name="IEEE"/></swrc:organization><swrc:pages>31-38</swrc:pages><swrc:title>Combining physical activities and mobile games to promote novel learning practices</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>games learning education research technologies social outdoors constructivism haifa-games-course informal ubiquitous based design mobile </swrc:keywords><swrc:abstract>Mobile outdoor games can be seen as fertile ground for conducting novel learning activities that involve children in different tasks including physical motion, problem solving, inquiry and collaboration; all those are activities that support different cognitive and social aspects of learning. Co-design and human centric design practices have been the focus of current research efforts in the field of educational technologies but not as prevalent in mobile games to support learning. In our current research we are exploring which design methods are appropriate for developing innovative ways of learning supported by mobile games. This paper presents all those aspects related to the design and implementation of a mobile game called Skattjakt (Treasure Hunt in Swedish). The outcome of our activities has provided us with valuable results that can help us to bridge the gap between learning in informal and formal settings. Moreover, we believe that involving children in the design process of mobile games may give us new insights regarding the nature of their learning practices while learning with games.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Daniel Spikol"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Marcelo Milrad"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><foaf:Group rdf:about="http://www.bibsonomy.org/tag/learning"><foaf:name>learning</foaf:name><description>Community for tag(s) learning</description></foaf:Group></rdf:RDF>
