61 |
KO, KR, KM: Integrating the organization of information resources and knowledgeColeman, Anita Sundaram 11 1900 (has links)
This presentation was made at the 30th Anniversary Celebrations of the Dept. of Management Information Science, Eller College, University of Arizona, held at the Hilton El Conquistador, Tucson, AZ, Nov. 3-5, 2004.
Knowledge organization (KO), knowledge representation (KR) and knowledge management (KM) are described and methods used in the models classsification research project from these disciplines are described.
|
62 |
Knowledge structures and the vocabulary of engineering novices. Presented at the Eighth International ISKO Conference, London, July 13-16, 2004.Coleman, Anita Sundaram 07 1900 (has links)
This presentation is based on the refereed paper published in the ISKO 8 proceedings (see References for citation). It describes a study of the language used by undergraduate engineering students engaged in a civil engineering laboratory. Learnerâ s concepts and relationships in the area of soil consolidation were elicited in order to provide an understanding of the structural knowledge of novices and compare it with the knowledge structures of a human expert and a thesaurus tool. Concept maps and pathfinder networks were used to visualize and analyze the resultant knowledge structures of novice learners, expert, and tool. Results show that there is little similarity between the knowledge structures of the novice, the expert, and the tool. There is preliminary evidence that students with complex knowledge structures earn better grades thereby, encouraging collaborative research between instructional evaluation and knowledge organization in order to measure the educational impact of digital libraries (DL); for example, cause-effect relationships could be studied between the vocabularies used in browsing and other navigational systems in a DL and the educational outcomes achieved.
|
63 |
Structure and form of folksonomy tags: The road to the public library catalogueSpiteri, Louise 06 1900 (has links)
Folksonomies have the potential to add much value to public library catalogues by enabling clients to: store, maintain, and organize items of interest in the catalogue using their own tags. The purpose of this paper is to examine how the tags that constitute folksonomies are structured. Tags were acquired over a thirty-day period from the daily tag logs of three folksonomy sites, Del.icio.us, Furl, and Technorati. The tags were evaluated against section 6 (choice and form of terms) of the National Information Standards Organization (NISO) guidelines for the construction of controlled vocabularies. This evaluation revealed that the folksonomy tags correspond closely to the NISO guidelines that pertain to the types of concepts expressed by the tags, the predominance of single tags, the predominance of nouns, and the use of recognized spelling. Potential problem areas in the structure of the tags pertain to the inconsistent use of the singular and plural form of count nouns, and the incidence of ambiguous tags in the form of homographs and unqualified abbreviations or acronyms. Should library catalogues decide to incorporate folksonomies, they could provide clear guidelines to address these noted weaknesses, as well as links to external dictionaries and references sources such as Wikipedia to help clients disambiguate homographs and to determine if the full or abbreviated forms of tags would be preferable.
|
64 |
Application of the Cantor Set Theory in making Decisions about the Collections DevelopmentPérez-López, Ana, Moneda-Corrochano, Mercedes, Moros-Ramirez, Angel January 2002 (has links)
[English abstract]
The procedures by which library collections can be evaluated are quite diverse, and some are rather complex. The Cantor Set Theory is applied with a structuralist approach as a methodological aid to decision-making about the collections development. The methodology suggested here makes use of local holdings information based on an evaluative study of the Spanish university library collections.
|
65 |
Knowledge selection, mapping and transfer in artificial neural networksThivierge, Jean-Philippe. January 2005 (has links)
Knowledge-based Cascade-correlation is a neural network algorithm that combines inductive learning and knowledge transfer (Shultz & Rivest, 2001). In the present thesis, this algorithm is tested on several real-world and artificial problems, and extended in several ways. The first extension consists in the incorporation of the Knowledge-based Artificial Neural Network (KBANN; Shavlik, 1994) technique for generating rule-based (RBCC) networks. The second extension consists of the adaptation of the Optimal Brain Damage (OBD; LeCun, Denker, & Solla, 1990) pruning technique to remove superfluous connection weights. Finally, the third extension consists in a new objective function based on information theory for controlling the distribution of knowledge attributed to subnetworks. A simulation of lexical ambiguity resolution is proposed. In this study, the use of RBCC networks is motivated from a cognitive and neurophysiological perspective.
|
66 |
REVISION PROGRAMMING: A KNOWLEDGE REPRESENTATION FORMALISMPivkina, Inna Valentinovna 01 January 2001 (has links)
The topic of the dissertation is revision programming. It is a knowledge representation formalismfor describing constraints on databases, knowledge bases, and belief sets, and providing acomputational mechanism to enforce them. Constraints are represented by sets of revision rules.Revision rules could be quite complex and are usually in a form of conditions (for instance, ifthese elements are present and those elements are absent, then this element must be absent). Inaddition to being a logical constraint, a revision rule specify a preferred way to satisfy the constraint.Justified revisions semantics assigns to any database a set (possibly empty) of revisions.Each revision satisfies the constraints, and all deletions and additions of elements in a transitionfrom initial database to the revision are derived from revision rules.Revision programming and logic programming are closely related. We established an elegantembedding of revision programs into logic programs, which does not increase the size of a program.Initial database is used in transformation of a revision program into the corresponding logicprogram, but it is not represented in the logic program.The connection naturally led to extensions of revision programming formalism which correspondto existing extensions of logic programming. More specific, a disjunctive and a nestedversions of revision programming were introduced.Also, we studied annotated revision programs, which allow annotations like confidence factors,multiple experts, etc. Annotations were assumed to be elements of a complete infinitely distributivelattice. We proposed a justified revisions semantics for annotated revision programs which agreedwith intuitions.Next, we introduced definitions of well-founded semantics for revision programming. It assignsto a revision problem a single "intended" model which is computable in polynomial time.Finally, we extended syntax of revision problems by allowing variables and implemented translatorsof revision programs into logic programs and a grounder for revision programs. The implementationallows us to compute justified revisions using existing implementations of the stablemodel semantics for logic programs.
|
67 |
A generic architecture for interactive intelligent tutoring systemsAtolagbe, Tajudeen Abayomi January 2001 (has links)
This research is focused on developing a generic intelligent architecture for an interactive tutoring system. A review of the literature in the areas of instructional theories, cognitive and social views of learning, intelligent tutoring systems development methodologies, and knowledge representation methods was conducted. As a result, a generic ITS development architecture (GeNisa) has been proposed, which combines the features of knowledge base systems (KBS) with object-oriented methodology. The GeNisa architecture consists of the following components: a tutorial events communication module, which encapsulates the interactive processes and other independent computations between different components; a software design toolkit; and an autonomous knowledge acquisition from a probabilistic knowledge base. A graphical application development environment includes tools to support application development, and learning environments and which use a case scenario as a basis for instruction. The generic architecture is designed to support client-side execution in a Web browser environment, and further testing will show that it can disseminate applications over the World Wide Web. Such an architecture can be adapted to different teaching styles and domains, and reusing instructional materials automatically can reduce the effort of the courseware developer (hence cost and time) in authoring new materials. GeNisa was implemented using Java scripts, and subsequently evaluated at various commercial and academic organisations. Parameters chosen for the evaluation include quality of courseware, relevancy of case scenarios, portability to other platforms, ease of use, content, user-friendliness, screen display, clarity, topic interest, and overall satisfaction with GeNisa. In general, the evaluation focused on the novel characteristics and performances of the GeNisa architecture in comparison with other ITS and the results obtained are discussed and analysed. On the basis of the experience gained during the literature research and GeNisa development and evaluation. a generic methodology for ITS development is proposed as well as the requirements for the further development of ITS tools. Finally, conclusions are drawn and areas for further research are identified.
|
68 |
Implementing conceptual graph processess /Benn, David Unknown Date (has links)
Thesis (MSc(Comp & InfoSc))--University of South Australia, 2001
|
69 |
Syntactic characterization of propositional satisfiabilityBelov, Anton. January 2005 (has links)
Thesis (M. Sc.)--York University, 2005. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 90-94). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004 & res_dat=xri:pqdiss & rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation & rft_dat=xri:pqdiss:MR11752.
|
70 |
A learning framework for zero-knowledge game playing agentsDuminy, Willem H. January 2006 (has links)
Thesis (M.Sc.)(Computer Science)--University of Pretoria, 2006. / Includes summary. Includes bibliographical references (leaves 151-152). Available on the Internet via the World Wide Web.
|
Page generated in 0.128 seconds