Friday, July 18, 2008
A Survey of Metadata Registries
Characteristics of Metadata Registries
Standards and APIs
Registry Standards
Schema Languages and Formats
Access Standards and APIs
Registries
IEMSR
SchemaWeb
DCMI Registry
Metadata Online Registry (METeOR)
NSDL Metadata Registry
XML.org Registry
DoD Metadata Registry and Clearinghouse
Other Registries
Commercial Tools
http://dart.edu.au/workpackages/da/registries.html
Standards and APIs
Registry Standards
Schema Languages and Formats
Access Standards and APIs
Registries
IEMSR
SchemaWeb
DCMI Registry
Metadata Online Registry (METeOR)
NSDL Metadata Registry
XML.org Registry
DoD Metadata Registry and Clearinghouse
Other Registries
Commercial Tools
http://dart.edu.au/workpackages/da/registries.html
XMark - An XML Benchmark Project
xmlgen produces XML documents modeling an auction website, a typical e-commerce application. The high-lights of the data generation are:
Generation of well-formed, valid, and meaningful XML data.
Efficient, scalable generation of XML documents the size of several GBytes.
Observing of referential constraints concerning ID/IDREF pairs.
Low, constant memory requirements, independent of the size of the generated document.
http://monetdb.cwi.nl/xml/generator.html
Generation of well-formed, valid, and meaningful XML data.
Efficient, scalable generation of XML documents the size of several GBytes.
Observing of referential constraints concerning ID/IDREF pairs.
Low, constant memory requirements, independent of the size of the generated document.
http://monetdb.cwi.nl/xml/generator.html
Friday, July 04, 2008
SPARQL as an expression language for OWL-S
http://www.ai.sri.com/OWL-S-2007/final-versions/OWL-S-2007-Sbodio-Final.pdf
Wednesday, February 06, 2008
OWL Test Results - OWL Implementations
http://www.w3.org/2003/08/owl-systems/test-results-out#systems
http://www.w3.org/2001/sw/WebOnt/impls
http://www.w3.org/2001/sw/WebOnt/impls
Developers Guide to Semantic Web Toolkits
This guide collects links to Semantic Web toolkits for different programming languages and gives an overview about the features of each toolkit, the strength of the development effort and the toolkit's user community.
http://www.wiwiss.fu-berlin.de/suhl/bizer/toolkits/
http://www.wiwiss.fu-berlin.de/suhl/bizer/toolkits/
Friday, February 01, 2008
Myths in Using OWL as Schema-language
Nice overview of misconceptions while considering OWL as schema-language
http://esw.w3.org/mt/esw/archives/000048.html
http://esw.w3.org/mt/esw/archives/000048.html
Validation of RDF against RDFS
Hints on validating RDF against RDFS
http://esw.w3.org/mt/esw/archives/000051.html
http://esw.w3.org/mt/esw/archives/000051.html
Mark-up Languages comparsion
Nice comparsion between XML-Schema, RDF, RDFS and OWL.
http://www.isi.edu/expect/web/semanticweb/comparison.html
http://www.daml.org/language/features.html
http://www.isi.edu/expect/web/semanticweb/comparison.html
http://www.daml.org/language/features.html
Tuesday, August 07, 2007
A nice example of RESTful Web Service for Delicious by Paul James
This is a very nice example, explaining best practices to design and implement REST services.
http://www.peej.co.uk/articles/restfully-delicious.html
http://www.peej.co.uk/articles/rest.html
http://www.peej.co.uk/articles/restfully-delicious.html
http://www.peej.co.uk/articles/rest.html
Tuesday, May 29, 2007
A Comparison between ebXML registry and UDDI
A very detailed comparison between ebXML and UDDI registries can be found on the link below.
http://www.sun.com/products/soa/registry/soa_registry_wp.pdf
http://www.sun.com/products/soa/registry/soa_registry_wp.pdf
A good tutorial on Regular Expression in Python
The re module was added in Python 1.5, and provides Perl-style regular expression patterns. Earlier versions of Python came with the regex module, which provides Emacs-style patterns. Emacs-style patterns are slightly less readable and don't provide as many features, so there's not much reason to use the regex module when writing new code, though you might encounter old code that uses it.
Regular expressions (or REs) are essentially a tiny, highly specialized programming language embedded inside Python and made available through the re module. Using this little language, you specify the rules for the set of possible strings that you want to match; this set might contain English sentences, or e-mail addresses, or TeX commands, or anything you like. You can then ask questions such as ``Does this string match the pattern?'', or ``Is there a match for the pattern anywhere in this string?''. You can also use REs to modify a string or to split it apart in various ways.
Regular expression patterns are compiled into a series of bytecodes which are then executed by a matching engine written in C. For advanced use, it may be necessary to pay careful attention to how the engine will execute a given RE, and write the RE in a certain way in order to produce bytecode that runs faster. Optimization isn't covered in this document, because it requires that you have a good understanding of the matching engine's internals.
The regular expression language is relatively small and restricted, so not all possible string processing tasks can be done using regular expressions. There are also tasks that can be done with regular expressions, but the expressions turn out to be very complicated. In these cases, you may be better off writing Python code to do the processing; while Python code will be slower than an elaborate regular expression, it will also probably be more understandable.
http://www.amk.ca/python/howto/regex/regex.html
Regular expressions (or REs) are essentially a tiny, highly specialized programming language embedded inside Python and made available through the re module. Using this little language, you specify the rules for the set of possible strings that you want to match; this set might contain English sentences, or e-mail addresses, or TeX commands, or anything you like. You can then ask questions such as ``Does this string match the pattern?'', or ``Is there a match for the pattern anywhere in this string?''. You can also use REs to modify a string or to split it apart in various ways.
Regular expression patterns are compiled into a series of bytecodes which are then executed by a matching engine written in C. For advanced use, it may be necessary to pay careful attention to how the engine will execute a given RE, and write the RE in a certain way in order to produce bytecode that runs faster. Optimization isn't covered in this document, because it requires that you have a good understanding of the matching engine's internals.
The regular expression language is relatively small and restricted, so not all possible string processing tasks can be done using regular expressions. There are also tasks that can be done with regular expressions, but the expressions turn out to be very complicated. In these cases, you may be better off writing Python code to do the processing; while Python code will be slower than an elaborate regular expression, it will also probably be more understandable.
http://www.amk.ca/python/howto/regex/regex.html