@phdthesis{jul2004bbp, title = {{From Brains to Branch Points: Cognitive Constraints in Navigational Design}}, author = {S. Jul}, school = {The University of Michigan}, year = 2004, biburl = {http://www.bibsonomy.org/bibtex/2fac55b968016249370415f8ffd0f8b93/stefano}, keywords = {navigation spatial hci reasoning} } @article{tranel2004ncl, title = {{Neuroanatomical correlates of locative prepositions}}, author = {D. Tranel and D. Kemmerer}, journal = {Cognitive Neuropsychology}, number = 7, pages = {719--749}, publisher = {Psychology Press}, volume = 21, year = 2004, biburl = {http://www.bibsonomy.org/bibtex/284bddefef6a966d2b9e9f2b0ccf5fa12/stefano}, keywords = {nlp spatial reasoning neuroscience} } @article{eugenio2004, title = {The kappa statistic: a second look}, address = {Cambridge, MA, USA}, author = {B. Di Eugenio and M. Glass}, journal = {Computational Linguistics}, number = 1, pages = {95--101}, publisher = {MIT Press}, volume = 30, year = 2004, url = {http://portal.acm.org/citation.cfm?id=1005385&dl=#}, issn = {0891-2017}, doi = {http://dx.doi.org/10.1162/089120104773633402}, description = {The kappa statistic}, abstract = {In recent years, the kappa coefficient of agreement has become the de facto standard for evaluating intercoder agreement for tagging tasks. In this squib, we highlight issues that affect κ and that the community has largely neglected. First, we discuss the assumptions underlying different computations of the expected agreement component of κ. Second, we discuss how prevalence and bias affect the κ measure.}, biburl = {http://www.bibsonomy.org/bibtex/27f2f0f656b9fce77906c0857e15fee68/stefano}, keywords = {statistics nlp} } @article{Siorpaes:2008, title = {Games with a Purpose for the Semantic Web}, author = {Katharina Siorpaes and Martin Hepp}, booktitle = {Intelligent Systems, IEEE}, pages = {50-60}, volume = 23, year = 2008, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4525142}, issn = {1541-1672}, doi = {10.1109/MIS.2008.45}, description = {IEEEXplore# Games with a Purpose for the Semantic Web}, abstract = {Weaving the Semantic Web requires that humans contribute their labor and judgment for extending and updating formal knowledge structures. Key tasks in evolving the current Web to a Semantic Web include discovering and specifying semantic relationships between multiple ontologies and annotating textual or multimedia information. However, whereas the Web 2.0 movement is fueled by an unprecedented number of contributions from Web users, there's a substantial lack of user involvement in weaving the heavyweight Semantic Web. One cause of this lack of involvement is a lack of proper incentive structures. Hiding the tasks involved in weaving the Semantic Web behind online multiplayer games presents the tasks as fun and intellectually challenging entertainment. A series of OntoGame prototypes support the full life cycle of realizing the Semantic Web. These games adopt Luis von Ahn's "games with a purpose" concept—that is, presenting a task as an online game can motivate many people to work on this task, and for free. Preliminary results suggest that users are willing to spend substantial time playing the OntoGames. In addition, a setting in which users must propose a solution to a conceptual-modeling task such that it will most likely be consensual with an unknown game partner produces high-quality semantic data.}, biburl = {http://www.bibsonomy.org/bibtex/21543b32383133720ed69e96d6c1bc088/stefano}, keywords = {learning crowdsourcing semanticweb} } @article{10.1109/MCG.2008.44, title = {Automated Vascular Geometric Analysis of Aortic Aneurysms}, address = {Los Alamitos, CA, USA}, author = {Vikash Ravi Goel and Roy K. Greenberg and Donald P. Greenberg}, journal = {IEEE Computer Graphics and Applications}, number = 3, pages = {76-86}, publisher = {IEEE Computer Society}, volume = 28, year = 2008, issn = {0272-1716}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCG.2008.44}, biburl = {http://www.bibsonomy.org/bibtex/24f6312c170fb128edb1a60520a8fbe2d/stefano}, keywords = {3D analysis semantics} } @article{10.1109/MCG.2008.51, title = {Fast Simulation of Realistic Trees}, address = {Los Alamitos, CA, USA}, author = {Jason P. Weber}, journal = {IEEE Computer Graphics and Applications}, number = 3, pages = {67-75}, publisher = {IEEE Computer Society}, volume = 28, year = 2008, issn = {0272-1716}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCG.2008.51}, biburl = {http://www.bibsonomy.org/bibtex/2857e36e6ff715631442e10ad9780aa95/stefano}, keywords = {generative design} } @article{10.1109/MCG.2008.50, title = {Detailed Building Facades}, address = {Los Alamitos, CA, USA}, author = {Dieter Finkenzeller}, journal = {IEEE Computer Graphics and Applications}, number = 3, pages = {58-66}, publisher = {IEEE Computer Society}, volume = 28, year = 2008, issn = {0272-1716}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCG.2008.50}, biburl = {http://www.bibsonomy.org/bibtex/2a9ee3f9f94e1214b8ed0b344ea2950df/stefano}, keywords = {generative analysis architecture} } @article{10.1109/MCG.2008.53, title = {Generating Semantic 3D Models of Underground Infrastructure}, address = {Los Alamitos, CA, USA}, author = {Erick Mendez and Gerhard Schall and Sven Havemann and Sebastian Junghanns and Dieter Fellner and Dieter Schmalstieg}, journal = {IEEE Computer Graphics and Applications}, number = 3, pages = {48-57}, publisher = {IEEE Computer Society}, volume = 28, year = 2008, issn = {0272-1716}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCG.2008.53}, biburl = {http://www.bibsonomy.org/bibtex/208dc676939ff6d05efa4ad42814b753e/stefano}, keywords = {3D semanticweb} } @article{keyhere, title = {Geometry Expressions: A Constraint Based Interactive Symbolic Geometry System}, author = {Philip Todd}, journal = {Automated Deduction in Geometry}, pages = {189--202}, year = 2007, url = {http://dx.doi.org/10.1007/978-3-540-77356-6_12}, description = {SpringerLink - Book Chapter}, abstract = {Real Euclidean geometry is a basic mathematical dialect, not only of high school students, but also of mechanical engineers, graphics programmers, architects, surveyors, machinists, and many more. In this paper, we present ”Geometry Expressions”:an interactive symbolic geometry package. The aim of the software is to generate algebraic formulas from geometry. It is afurther intention of the software that the model should be entered interactively in a style which is convenient to both thegeometry consumer groups identified above.}, biburl = {http://www.bibsonomy.org/bibtex/22bec0e589a3137f4224a197b83e3a9d9/stefano}, keywords = {knowledge geometry conversion} } @article{Hobbs08, title = {Deep Lexical Semantics of Emotions}, author = {Jerry Hobbs & Andrew Gordon}, editor = {Ontology A. Workshop on Sentiment Analysis: Emotion and Terminology (EMOT-08)}, year = 2008, url = {http://ict.usc.edu/files/publications/EMOT08.PDF}, abstract = {We understand discourse so well because we know so much. If we are to have natural language understanding systems that are able to deal with texts with emotional content, we must encode knowledge of human emotions for use in the systems. In particular, we must equip the system with a formal version of people's implicit theory of how emotions mediate between what they experience and what they do, and rules that link the theory with words and phrases in the emotional lexicon.}, biburl = {http://www.bibsonomy.org/bibtex/265912140eb13fc39adf2b3b690f06c57/stefano}, keywords = {logic nlp knowledge emotions} } @incollection{1, title = {Privacy im Social Semantic Web}, author = {Michael Nagenborg}, booktitle = {Social Semantic Web}, editor = {Pellegrini Tassilo and Blumauer Andreas}, publisher = {Springer Verlag}, year = 2008, biburl = {http://www.bibsonomy.org/bibtex/222be0cdbc877ef0a971aefa4a257d6b4/stefano}, keywords = {semanticweb privacy} } @inproceedings{borgida05similarity, title = {Towards Measuring Similarity in Description Logics.}, author = {Alexander Borgida and Thomas Walsh and Haym Hirsh}, booktitle = {Proceedings of the 2005 International Workshop on Description Logics (DL2005), July 26-28, 2005, Edinburgh, Scotland, UK}, editor = {Ian Horrocks and Ulrike Sattler and Frank Wolter}, publisher = {CEUR-WS.org}, series = {CEUR Workshop Proceedings}, volume = 147, year = 2005, url = {http://www.ceur-ws.org/Vol-147/25-BorgidaEtAl.pdf}, biburl = {http://www.bibsonomy.org/bibtex/21bfb5f33156769d97d22bf8d5b4369dc/stefano}, keywords = {similarity metrics ontologies distance} } @article{keyhere, title = {Spatial Reasoning with a Hole}, author = {Max Egenhofer and Maria Vasardani}, journal = {Spatial Information Theory}, pages = {303--320}, year = 2007, url = {http://dx.doi.org/10.1007/978-3-540-74788-8_19}, description = {SpringerLink - Book Chapter}, abstract = {Cavities in spatial phenomena require geometric representations of regions with holes. Existing models for reasoning over topological relations either exclude such specialized regions (9-intersection) or treat them indistinguishably from regionswithout holes (RCC-8). This paper highlights that inferences over a region with a hole need to be made separately from, andin addition to, the inferences over regions without holes. First the set of 23 topological relations between a region anda region with a hole is derived systematically. Then these relations’ compositions over the region with the hole are calculatedso that the inferences can be compared with the compositions of the topological relations over regions without holes. For266 out of the 529 compositions the results over the region with the hole were more detailed than the corresponding resultsover regions without holes, with 95 of these refined cases providing even a unique result. In 27 cases, this refinement upto uniqueness compares with a completely undetermined inference for the relations over regions without holes.}, biburl = {http://www.bibsonomy.org/bibtex/2ed5a3f62e68f6cdf12826847ac008422/stefano}, keywords = {reasoning spatial mereology} } @article{rada89metric, title = {Development and application of a metric on semantic nets}, author = {R. Rada and H. Mili and E. Bicknell and M. Blettner}, booktitle = {IEEE Transactions on Systems, Man and Cybernetics}, pages = {17-30}, volume = 19, year = 1989, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=24528}, issn = {0018-9472}, doi = {10.1109/21.24528}, abstract = {Motivated by the properties of spreading activation and conceptual distance, the authors propose a metric, called distance, on the power set of nodes in a semantic net. Distance is the average minimum path length over all pairwise combinations of nodes between two subsets of nodes. Distance can be successfully used to assess the conceptual distance between sets of concepts when used on a semantic net of hierarchical relations. When other kinds of relationships, like `cause', are used, distance must be amended but then can again be effective. The judgements of distance significantly correlate with the distance judgements that people make and help to determine whether one semantic net is better or worse than another. The authors focus on the mathematical characteristics of distance that presents novel cases and interpretations. Experiments in which distance is applied to pairs of concepts and to sets of concepts in a hierarchical knowledge base show the power of hierarchical relations in representing information about the conceptual distance between concepts}, biburl = {http://www.bibsonomy.org/bibtex/27489a4e2594e6ec10048b740bcccb34c/stefano}, keywords = {metric ontologies distance} } @unpublished{Stewart_2006_Popularity, title = {Distributed Factors in the Development of Popularity (or 'Why Doesn't Anybody Like Me?')}, author = {Terry Stewart and Robert L. West and Robert Coplan}, year = 2006, abstract = {Individual factors by no means completely account for individual popularity within a group structure. To begin to explain the majority of the variance, we must investigate the hypothesis that popularity is strongly influenced by the dynamics of group interactions. Here, we present a computational model of peer interaction that allows us to investigate the influence of different distributed factors. In constructing the model, we discovered that certain elements are vital for the simulation to produce data that matches the observed patterns in real social groups. We found that the internal representation of how much agents like each other must be discrete, that judgements should be made relative to behavioural expectations, and that models do not require variation in the initial state of the agents to produce realistic individual differences in popularity. Our result is a set of models with psychologically realistic attributes. When simulated, these models result in popularity data that cannot be reliably distinguished from real life data. Since these models capture the essential dynamics of the social group interaction, they can form the basis for understanding how interaction within the group influences individuals to become popular or rejected. }, biburl = {http://www.bibsonomy.org/bibtex/2283b48fc45896ba27af6d3ad492128f8/stefano}, keywords = {cognition networks social} } @article{lu08, title = {Naming games in two-dimensional and small-world-connected random geometric networks}, author = {Q. Lu and G. Korniss and B. K. Szymanski}, journal = {Phys. Rev. E}, number = 1, pages = 016111, publisher = {APS}, volume = 77, year = 2008, collaboration = {}, numpages = {10}, eid = {016111}, doi = {10.1103/PhysRevE.77.016111}, biburl = {http://www.bibsonomy.org/bibtex/2d2c7248eebdb8ac8204c3f1bfa059df4/stefano}, keywords = {linguistics games coordination naming} } @article{keyhere, title = {The Intention Behind Web Queries}, author = {Ricardo Baeza-Yates and Liliana Calderón-Benavides and Cristina González-Caro}, journal = {String Processing and Information Retrieval}, pages = {98--109}, year = 2006, url = {http://dx.doi.org/10.1007/11880561_9}, description = {SpringerLink - Buchkapitel}, abstract = {The identification of the user’s intention or interest through queries that they submit to a search engine can be very useful to offer them more adequate results. In this work we present a framework for the identification of user’s interest in an automaticway, based on the analysis of query logs. This identification is made from two perspectives, the objectives or goals of auser and the categories in which these aims are situated. A manual classification of the queries was made in order to havea reference point and then we applied supervised and unsupervised learning techniques. The results obtained show that fora considerable amount of cases supervised learning is a good option, however through unsupervised learning we found relationshipsbetween users and behaviors that are not easy to detect just taking the query words. Also, through unsupervised learning weestablished that there are categories that we are not able to determine in contrast with other classes that were not consideredbut naturally appear after the clustering process. This allowed us to establish that the combination of supervised and unsupervisedlearning is a good alternative to find user’s goals. From supervised learning we can identify the user interest given certainestablished goals and categories; on the other hand, with unsupervised learning we can validate the goals and categories used,refine them and select the most appropriate to the user’s needs.}, biburl = {http://www.bibsonomy.org/bibtex/227c7357d3337d890fef53168dce9ed33/stefano}, keywords = {datamining search machine_learning} } @article{MR2016598, title = {Rigorous results for the {$NK$} model}, author = {Richard Durrett and Vlada Limic}, journal = {Ann. Probab.}, number = 4, pages = {1713--1753}, volume = 31, year = 2003, mrreviewer = {David R. Steinsaltz}, mrnumber = {MR2016598 (2005a:60067)}, issn = {0091-1798}, fjournal = {The Annals of Probability}, mrclass = {60G50 (60F05)}, coden = {APBYAE}, description = {MR: Selected Matches for: Citations of 907587}, biburl = {http://www.bibsonomy.org/bibtex/2da6eae2bd10d4f58596b6e81f484a5a0/stefano}, keywords = {search optima NK} } @article{MR2208086, title = {Global optima results for the {K}auffman {$NK$} model}, author = {Hemanshu Kaul and Sheldon H. Jacobson}, journal = {Math. Program.}, number = {2, Ser. A}, pages = {319--338}, volume = 106, year = 2006, mrreviewer = {Udrea P{\u{a}, mrnumber = {MR2208086 (2006k:90115)}, issn = {0025-5610}, mrclass = {90C27 (90B15 90C15 90C59)}, description = {MR: Selected Matches for: Citations of 907587}, biburl = {http://www.bibsonomy.org/bibtex/2267486ea961568d9b48e14accfc4dd5c/stefano}, keywords = {optima NK search} } @article{MR2238711, title = {New global optima results for the {K}auffman {$NK$} model: handling dependency}, author = {Hemanshu Kaul and Sheldon H. Jacobson}, journal = {Math. Program.}, number = {2-3, Ser. B}, pages = {475--494}, volume = 108, year = 2006, mrnumber = {MR2238711 (2007a:90051)}, issn = {0025-5610}, mrclass = {90C15 (90C27 90C90)}, description = {MR: Selected Matches for: Citations of 907587}, biburl = {http://www.bibsonomy.org/bibtex/24d5724ca0e8b1584ba0766262c13b848/stefano}, keywords = {optima NK search} }