Search (1215 results, page 1 of 61)

0.2427543 = product of:
  0.9710172 = sum of:
    0.9710172 = weight(_text_:hashing in 4510) [ClassicSimilarity], result of:
      0.9710172 = score(doc=4510,freq=8.0), product of:
        0.57086754 = queryWeight, product of:
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.059329245 = queryNorm
        1.70095 = fieldWeight in 4510, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.0625 = fieldNorm(doc=4510)
  0.25 = coord(1/4)

Abstract

Discusses hashing, an information storage and retrieval technique useful for implementing many of the other structures in this book. The concepts underlying hashing are presented, along with 2 implementation strategies. The chapter also contains an extensive discussion of perfect hashing, an important optimization in information retrieval, and an O(n) algorithm to find minimal perfect hash functions for a set of keys

0.20542563 = product of:
  0.82170254 = sum of:
    0.82170254 = weight(_text_:java in 6858) [ClassicSimilarity], result of:
      0.82170254 = score(doc=6858,freq=26.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.965216 = fieldWeight in 6858, product of:
          5.0990195 = tf(freq=26.0), with freq of:
            26.0 = termFreq=26.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=6858)
  0.25 = coord(1/4)

Content

Why use Java? Object oriented primer. Java applets. The Java language. Branching and looping. Graphics. Animation and multithreading. Handling exceptions. The Java.awt package. Handling events. Windows, dialogs and menus. Input and output streams. Modifiers and packages. Java and C++

LCSH

Java (Computer program language)

Object

Java

RSWK

Java <Programmiersprache>
World wide web / Seite / Gestaltung / Java <Programmiersprache> (2134) (4231)

Subject

Java (Computer program language)
Java <Programmiersprache>
World wide web / Seite / Gestaltung / Java <Programmiersprache> (2134) (4231)

0.15949626 = product of:
  0.63798505 = sum of:
    0.63798505 = weight(_text_:java in 5740) [ClassicSimilarity], result of:
      0.63798505 = score(doc=5740,freq=12.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.52583 = fieldWeight in 5740, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=5740)
  0.25 = coord(1/4)

Abstract

The Ovid Java interface is compared with the Ovid Web Gateway and Ovid Windows Client, focusing on functionality from the user's perspective. The Java version draws upon both earlier Web and Windows versions, thus combining the worlds of the Web and application programs. It is concluded that Ovid Java offers enhanced functionality and requires high-end hardware and browser software to run well. Additional enhancements are forthcoming, some dependent upon the further development of Sun Microsystems' Java programming language

Object

Java

0.15019655 = product of:
  0.6007862 = sum of:
    0.6007862 = weight(_text_:hashing in 1495) [ClassicSimilarity], result of:
      0.6007862 = score(doc=1495,freq=4.0), product of:
        0.57086754 = queryWeight, product of:
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.059329245 = queryNorm
        1.0524092 = fieldWeight in 1495, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1495)
  0.25 = coord(1/4)

Abstract

A prefix trie index is applied to the problem of providing fast search times, fast load times and fast update properties in a bibliographic or full text retrieval system. For all but the largest dictionaries a single key search in the dictionary under trie hashing takes exactly 1 disk read. Front compression of search keys is used to enhance performance. Analyzes partial combining of the postings into the dictionary as a method to give both faster retrieval and improved update properties for the trie hashing inverted file. Gives statistics for a test database consisting of an online catalogue at the Graduate School of Library and Information Science Library of the University of Western Ontario, Canada. Tests the effect of changing various parameters of prefix tries in this application

0.14380857 = product of:
  0.28761715 = sum of:
    0.22789927 = weight(_text_:java in 2393) [ClassicSimilarity], result of:
      0.22789927 = score(doc=2393,freq=2.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        0.5450528 = fieldWeight in 2393, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2393)
    0.059717894 = weight(_text_:und in 2393) [ClassicSimilarity], result of:
      0.059717894 = score(doc=2393,freq=14.0), product of:
        0.13158628 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.059329245 = queryNorm
        0.4538307 = fieldWeight in 2393, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2393)
  0.5 = coord(2/4)

Abstract

Komplexe Aufgaben und Probleme werden heute üblicherweise im Team bearbeitet und gelöst. Das gilt insbesondere für Softwareprojekte, denn die Entwicklung komplexer Softwaresysteme findet heutzutage meistens arbeitsteilig in - zunehmend räumlich verteilten - Teams statt. Vor diesem Hintergrund wird zum einen ein rollenbasiertes Konzept vorgestellt, das virtuellen Lernteams bei der Zusammenarbeit einen virtuellen Tutor zur Seite stellt, der dem Team im Rahmen von Rollendefiziten adaptierte Hilfestellung bietet und so die Lerneffektivität unterstützt. Zum anderen wird gezeigt, wie das Zusammenspiel zweier spezialisierter Systeme (VitaminL und K3) im Kontext des Blended Learning echte Mehrwerte in E-Learning-Szenarien bringen kann. Die in Benutzertests und einer Lehrveranstaltung ermittelten Evaluierungsergebnisse lassen auf die Tragfähigkeit des rollenbasierten, tutoriellen Konzepts schließen und decken gleichzeitig großes Weiterentwicklungpotenzial auf.

Source

Information - Wissenschaft und Praxis. 59(2008) H.1, S.37-40

0.13812782 = product of:
  0.5525113 = sum of:
    0.5525113 = weight(_text_:java in 2051) [ClassicSimilarity], result of:
      0.5525113 = score(doc=2051,freq=4.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.3214076 = fieldWeight in 2051, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.09375 = fieldNorm(doc=2051)
  0.25 = coord(1/4)

Object

Java

0.13652088 = product of:
  0.27304175 = sum of:
    0.22789927 = weight(_text_:java in 3593) [ClassicSimilarity], result of:
      0.22789927 = score(doc=3593,freq=2.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        0.5450528 = fieldWeight in 3593, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3593)
    0.045142483 = weight(_text_:und in 3593) [ClassicSimilarity], result of:
      0.045142483 = score(doc=3593,freq=8.0), product of:
        0.13158628 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.059329245 = queryNorm
        0.34306374 = fieldWeight in 3593, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3593)
  0.5 = coord(2/4)

Abstract

Internet verändert die Software-Szene / Java macht Dampf / PC bekommt Konkurrenz / Aufgeweckte Riesen gegen innovative Zwerge / Intranet heißt der neue Renner

Content

Das Internet boomt. Rund um den Globus basteln etablierte EDV-Konzerne und Branchenneulinge an Hard- und Software für das Netz der Netze. Glaubt man den Auguren, läutet seine Beliebtheit eine Revolution in der Informationstechnik ein. Der Ära der Großrechner und der Personalcomputer soll ein Zeitalter folgen, in dem 'das Netz der Computer' ist. Wer dann die Fäden ziehen wird, ist längst nicht ausgemacht. Ob herkömmliche PC mit ihren Programmen die Spinne im Netz bleiben oder neue Geräte und Software sich breitmachen, darüber wird derzeit lebhaft diskutiert

0.13022816 = product of:
  0.52091265 = sum of:
    0.52091265 = weight(_text_:java in 6015) [ClassicSimilarity], result of:
      0.52091265 = score(doc=6015,freq=2.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.2458351 = fieldWeight in 6015, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.125 = fieldNorm(doc=6015)
  0.25 = coord(1/4)

Object

JAVA

0.13022816 = product of:
  0.52091265 = sum of:
    0.52091265 = weight(_text_:java in 45) [ClassicSimilarity], result of:
      0.52091265 = score(doc=45,freq=8.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.2458351 = fieldWeight in 45, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=45)
  0.25 = coord(1/4)

Abstract

Ovid Technologies is launching its Java search client to enable users to access Ovid's scientific databases on the Web with full search capabilities irrespective of the type of computer used. Explains the differences between Java and HTML. The Java client increases search speed by several orders of magnitude. The Ovid client does not need to wait for individual pages to load and incorporates multi-tasking. The interface includes tree displays; thesauri; mapping; explode/implode; search fields and context sensitive help. Display; save; and e-mail are available from the client

0.12873991 = product of:
  0.51495963 = sum of:
    0.51495963 = weight(_text_:hashing in 1303) [ClassicSimilarity], result of:
      0.51495963 = score(doc=1303,freq=4.0), product of:
        0.57086754 = queryWeight, product of:
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.059329245 = queryNorm
        0.902065 = fieldWeight in 1303, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.046875 = fieldNorm(doc=1303)
  0.25 = coord(1/4)

Abstract

In this article we investigate the use of signature files in Chinese information retrieval system and propose a new partitioning method for Chinese signature file based on the characteristic of Chinese words. Our partitioning method, called Partitioned Signature File for Chinese (PSFC), offers faster search efficiency than the traditional single signature file approach. We devise a general scheme for controlling the trade-off between the false drop and storage overhead while maintaining the search space reduction in PSFC. An analytical study is presented to support the claims of our method. We also propose two new hashing methods for Chinese signature files so that the signature file will be more suitable for dynamic environment while the retrieval performance is maintained. Furthermore, we have implemented PSFC and the new hashing methods, and we evaluated them using a large-scale real-world Chinese document corpus, namely, the TREC-5 (Text REtrieval Conference) Chinese collection. The experimental results confirm the features of PSFC and demonstrate its superiority over the traditional single signature file method

0.12523526 = product of:
  0.25047052 = sum of:
    0.22789927 = weight(_text_:java in 1604) [ClassicSimilarity], result of:
      0.22789927 = score(doc=1604,freq=2.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        0.5450528 = fieldWeight in 1604, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1604)
    0.022571241 = weight(_text_:und in 1604) [ClassicSimilarity], result of:
      0.022571241 = score(doc=1604,freq=2.0), product of:
        0.13158628 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.059329245 = queryNorm
        0.17153187 = fieldWeight in 1604, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1604)
  0.5 = coord(2/4)

Abstract

iQvoc is a new open source SKOS-XL vocabulary management tool developed by the Federal Environment Agency, Germany, and innoQ Deutschland GmbH. Its immediate purpose is maintaining and publishing reference vocabularies in the upcoming Linked Data cloud of environmental information, but it may be easily adapted to host any SKOS- XL compliant vocabulary. iQvoc is implemented as a Ruby on Rails application running on top of JRuby - the Java implementation of the Ruby Programming Language. To increase the user experience when editing content, iQvoc uses heavily the JavaScript library jQuery.

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.12137715 = product of:
  0.4855086 = sum of:
    0.4855086 = weight(_text_:hashing in 4509) [ClassicSimilarity], result of:
      0.4855086 = score(doc=4509,freq=2.0), product of:
        0.57086754 = queryWeight, product of:
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.059329245 = queryNorm
        0.850475 = fieldWeight in 4509, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.0625 = fieldNorm(doc=4509)
  0.25 = coord(1/4)

Abstract

Presents an overview of Boolean operations, which are one means of expressing queries in information retrieval systems. The concepts of Boolean operations are introduced, and 2 implementations based on sets are given. One implementation uses bit vectors; the other, hashing. The relative performance characteristics of the approaches are shown

0.113949634 = product of:
  0.45579854 = sum of:
    0.45579854 = weight(_text_:java in 5463) [ClassicSimilarity], result of:
      0.45579854 = score(doc=5463,freq=8.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.0901057 = fieldWeight in 5463, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=5463)
  0.25 = coord(1/4)

Abstract

A spell book for mastering the WWW. Step by step, readers are taught how to use the Internet efficiently, and, in particular, how to publish information on the Web. After completing this book, the reader will be able, for example, to create stunning Web home pages and even take the first steps in Java programming. There are many books on the net bound to either one product, e.g. Mosaic, or to one topic, HTML. Mesaric, on the other hand, covers all WWW-related topics and all products which are in popular use. The magic revealed includes common data formats (HTML, PDF, JPEG, GIF), an introduction to Java and Java Srcipt, emerging technologies such as Hyper-G, hypermedia authoring with Haemony and Amadeus, information about ATM, TeleScript, and much more

Object

JAVA

0.113949634 = product of:
  0.45579854 = sum of:
    0.45579854 = weight(_text_:java in 86) [ClassicSimilarity], result of:
      0.45579854 = score(doc=86,freq=2.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.0901057 = fieldWeight in 86, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.109375 = fieldNorm(doc=86)
  0.25 = coord(1/4)

0.10919962 = product of:
  0.43679848 = sum of:
    0.43679848 = weight(_text_:java in 6217) [ClassicSimilarity], result of:
      0.43679848 = score(doc=6217,freq=10.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        1.0446644 = fieldWeight in 6217, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=6217)
  0.25 = coord(1/4)

Abstract

A detailed description of how to use Java applets and Common Gateway Interface (CGI)/Dynamic Link Library (DLL) programs for Web publication of textual databases. The advantages of Java applets include low cost, flexible and visually appealing search interfaces, and the ability to be embedded in HTML pages, eliminating the need for Internet service provider permissions for their use. Highlights the FindIt family of Java applets from DoubleOLogic as one of the best product lines in the category. CGI programs may be written in Perl, Java, or some other language, and like DLL programs, must be installed on the server side. Notes that small-scale CGI and DLL applications cost from $150 to $8,000. Highlights Insight from Enigma Inc. as an excellent program at the high end of the cost range

0.10728325 = product of:
  0.429133 = sum of:
    0.429133 = weight(_text_:hashing in 159) [ClassicSimilarity], result of:
      0.429133 = score(doc=159,freq=4.0), product of:
        0.57086754 = queryWeight, product of:
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.059329245 = queryNorm
        0.7517208 = fieldWeight in 159, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.0390625 = fieldNorm(doc=159)
  0.25 = coord(1/4)

Abstract

Hoad and Zobel term documents that originate from the same source, whether versions or plagiarisms, co-derivatives. Identification of co-derivatives is normally by a technique called fingerprinting, which uses hashing to generate surrogates in the form of integer strings derived from substrings of text, for comparison purposes, or by ranking using a similarity measure as in information retrieval. Hoad and Zobel derive several variants of what they term an identity measure, where documents with similar numbers of occurrences of words benefit and those with dissimilar numbers are penalized, for use in a ranking technique. They then review fingerprinting strategies, and characterize them by the substring size utilized, i.e. granularity, character of the hashing function, the size of the document fingerprint, i.e. resolution, and the substring selection strategy. In their experiments highest false match, HFM, the highest percentage score given an incorrect result, and separation, the difference between the lowest correct result and HFM were the measures utilized in two collections, one of 3,300 documents, and the other of 80,000 with 53 query documents. The new identity measure demonstrates superior performance to the alternatives. Only one fingerprinting strategy was able to identify all human identified similar documents, the anchor strategy. The key parameter in fingerprinting appears to be granularity, with three to five words producing the best results.

0.106205 = product of:
  0.42482 = sum of:
    0.42482 = weight(_text_:hashing in 4501) [ClassicSimilarity], result of:
      0.42482 = score(doc=4501,freq=2.0), product of:
        0.57086754 = queryWeight, product of:
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.059329245 = queryNorm
        0.74416566 = fieldWeight in 4501, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.622026 = idf(docFreq=7, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4501)
  0.25 = coord(1/4)

Abstract

Optical disk technology (CD-ROM etc.) is a new and secondary storage technology. Optical disks have immense capacities and very fast retrieval performance; they are also rugged and have very long storage lifetimes. These characteristics are making them a serious threat to the traditional dominance of magnetic disks. It is important to understand and study this young and significant technology and to design retrieval structures that best utilize characteristics. Presents 6 file systems (Write-Once B-Tree; Time Split B-Tree; Compact Disk File System; Optical File Cabinet; Buffered Hashing; BIM Trees

0.09868329 = product of:
  0.39473316 = sum of:
    0.39473316 = weight(_text_:java in 6014) [ClassicSimilarity], result of:
      0.39473316 = score(doc=6014,freq=6.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        0.94405925 = fieldWeight in 6014, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=6014)
  0.25 = coord(1/4)

Abstract

Most books on the Internet describe it from the user's end. This one, however, is unique in its focus on serving information on the WWW. It presents everything from the basics to advanced techniques and will thus prove invaluable to site administrators and developers. The author - an expert developer and researcher at UCSD - covers such topics as HTML 3.0, serving documents, interfaces, WWW utilities and browsers such as Netscape. Fisher also includes an introduction to programming with JAVA and JAVA sript, as well as the complete VRML 1.0 specification

Object

JAVA

0.09868329 = product of:
  0.39473316 = sum of:
    0.39473316 = weight(_text_:java in 4612) [ClassicSimilarity], result of:
      0.39473316 = score(doc=4612,freq=6.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        0.94405925 = fieldWeight in 4612, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4612)
  0.25 = coord(1/4)

Abstract

Discusses drawbacks of the Java programming language, and proposes some potential improvements for concurrent object-oriented software development. Java's passive object model does not provide an effective means for building distributed applications, critical for the future of Web-based next-generation information systems. Suggests improvements to Java's existing mechanisms for maintaining consistency across multiple threads, sending asynchronous messages and controlling resources. Drives the discussion with examples and suggestions from work on the Actor model of computation

Object

Java

0.09868329 = product of:
  0.39473316 = sum of:
    0.39473316 = weight(_text_:java in 6896) [ClassicSimilarity], result of:
      0.39473316 = score(doc=6896,freq=6.0), product of:
        0.41812328 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059329245 = queryNorm
        0.94405925 = fieldWeight in 6896, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=6896)
  0.25 = coord(1/4)

Abstract

This paper proposes the use of the Unified Modeling Language (UML) as a language for modelling ontologies for Web resources and the knowledge contained within them. To provide a mechanism for serialising and processing object diagrams representing knowledge, a pair of XSI-T stylesheets have been developed to map from XML Metadata Interchange (XMI) encodings of class diagrams to corresponding RDF schemas and to Java classes representing the concepts in the ontologies. The Java code includes methods for marshalling and unmarshalling object-oriented information between in-memory data structures and RDF serialisations of that information. This provides a convenient mechanism for Java applications to share knowledge on the Web