Saturday, October 02, 2004
(OWLLogic release 1.0)
(OWLLogic release 1.0): "Author: Guido Naudts. E-mail: naudts_vannoten@yahoo.com
This is a very early release. This release has two main parts:
1) OWL.py: this module permits to check the consistency and correctness of OWL files in N3 syntax for all three OWL systems: Lite, DL and Full. I do not claim detection of all errors at this stage. The module, when started presents a menu that I think will be sufficiently clear. Full querying is not yet implemented but some basic queries can already be done via the menu command 9)."
This is a very early release. This release has two main parts:
1) OWL.py: this module permits to check the consistency and correctness of OWL files in N3 syntax for all three OWL systems: Lite, DL and Full. I do not claim detection of all errors at this stage. The module, when started presents a menu that I think will be sufficiently clear. Full querying is not yet implemented but some basic queries can already be done via the menu command 9)."
Google Search: Knot filetype:gif
Requirements for a Scalable Mobility Architecture
Requirements for a Scalable Mobility Architecture
"1 Introduction
An effective architecture for mobile software:
At the time of this writing, no universally accepted mobility architecture has yet emerged; however, the requirements for such an architecture are becoming fairly well known (for example, see Intel’s at [1]).
This document attempts to collect the requirements for such an architecture and identifies the features and qualities that it needs to have. We hope it is useful when evaluating various proposed mobility architectures and technologies (such as mobile software from the OS to middleware).
This document goes beyond the sometimes narrow technical focus on particular technical challenges that need to be addressed (e.g. synchronization between a mobile device and information on a server, PC or other mobile or stationary device). It also considers requirements arising from the development process employed to construct mobile systems and the operation of mobile systems.
Further, it considers technical requirements that arise from the increasingly recognized need by the participants in the mobile business ecosystem to gain agreement around a core architecture that catalyzes rapid growth and innovation."
"1 Introduction
An effective architecture for mobile software:
- addresses the technical challenges of mobile computing. For example, it enables the mobile user to be productive even when temporarily disconnected from the network.
- offers a software usage model to the mobile user that is compelling and that leverages the unique advantages of the mobile device, while sidestepping or avoiding its disadvantages (e.g. the lack of a full-size keyboard, but the availability of location-related information through technologies such as GPS, Bluetooth, or RFID)
- encourages the growth of a mobile software business ecosystem consisting of infrastructure, application, content and service providers that can effectively address the mobile software market opportunity represented by 1.5 billion mobile devices in use already.
At the time of this writing, no universally accepted mobility architecture has yet emerged; however, the requirements for such an architecture are becoming fairly well known (for example, see Intel’s at [1]).
This document attempts to collect the requirements for such an architecture and identifies the features and qualities that it needs to have. We hope it is useful when evaluating various proposed mobility architectures and technologies (such as mobile software from the OS to middleware).
This document goes beyond the sometimes narrow technical focus on particular technical challenges that need to be addressed (e.g. synchronization between a mobile device and information on a server, PC or other mobile or stationary device). It also considers requirements arising from the development process employed to construct mobile systems and the operation of mobile systems.
Further, it considers technical requirements that arise from the increasingly recognized need by the participants in the mobile business ecosystem to gain agreement around a core architecture that catalyzes rapid growth and innovation."
Friday, October 01, 2004
Ned Batchelder: Python Parsing Tools
Ned Batchelder: Python Parsing Tools
"Recently I went looking for Python parsing tools. I spent a long time researching the various options. When I was done, I had a cheat sheet on the different alternatives. This is that cheat sheet, cleaned up a bit. It is very spotty. If you have updates to the information here, let me know."
"Recently I went looking for Python parsing tools. I spent a long time researching the various options. When I was done, I had a cheat sheet on the different alternatives. This is that cheat sheet, cleaned up a bit. It is very spotty. If you have updates to the information here, let me know."
Toward widely deployable Semantic Web P2P: tools, definitions and the RDFGrowth algorithm
Toward widely deployable Semantic Web P2P: tools, definitions and the RDFGrowth algorithm
"Abstract
There are a number of reasons why user scalability is inherently difficult for Semantic Web P2P scenarios. Approaches distributing queries or data can easily allow any user to consume arbitrary amounts of common resources in terms of computational burden and network traffic respectively. In this paper we illustrate these shortcomings and introduce RDFGrowth, an incremental RDF annotation exchange model and algorithm in an effort to overcome them. RDFGrowth is based on growing the local peer database using only basic direct P2P queries. As these require only minimal and bounded remote computational resources and as information is highly replicated, the algorithm opens the way to real world “napster like” P2P SW applications. In describing RDFGrowth, we furthermore provide formal definitions of general applicability when RDF subgraphs are exchanged or signed."
"Abstract
There are a number of reasons why user scalability is inherently difficult for Semantic Web P2P scenarios. Approaches distributing queries or data can easily allow any user to consume arbitrary amounts of common resources in terms of computational burden and network traffic respectively. In this paper we illustrate these shortcomings and introduce RDFGrowth, an incremental RDF annotation exchange model and algorithm in an effort to overcome them. RDFGrowth is based on growing the local peer database using only basic direct P2P queries. As these require only minimal and bounded remote computational resources and as information is highly replicated, the algorithm opens the way to real world “napster like” P2P SW applications. In describing RDFGrowth, we furthermore provide formal definitions of general applicability when RDF subgraphs are exchanged or signed."
Thursday, September 30, 2004
Agent model yields leadership
Agent model yields leadership
Agent model yields leadership. By Kimberly Patch. Technology Research News (September 22/29, 2004). "Complicated systems that involve many agents making independent decisions -- like the stock market -- are difficult to predict. ... One way to gain at least a moderate ability to predict is to start in the middle -- construct a system using quantitative representations for agent-level behavior and interactions observed from real life, let the simulation evolve according to a set of rules, then compare the system to qualitative observations from real life to see how close the model has come to representing the behavior of a real system. Researchers from Los Alamos National Laboratory, the University of Houston, and Rensselaer Polytechnic Institute have developed a quantitative model of software agents competing for limited resources that is representative of more complex systems. The model is a simple, expandable framework that accounts for social behavior in agent-based markets, said Marion Anghel, a technical research staff member at Los Alamos National Laboratory. It could eventually be used to study financial markets, behavioral economics, and quantitative sociology, and to optimize agent communications networks, including robot collectives, said Anghel. The researchers based their system on an existing multi-agent-competition model dubbed the minority game.... The researchers added a network of acquaintances that give advice to each other based on the agents' predictions about the best move in the game at any given moment. ... The researchers are aiming to eventually produce artificial agent systems that perform optimally as a collective, said [Zoltan] Toroczkai."
Agent model yields leadership. By Kimberly Patch. Technology Research News (September 22/29, 2004). "Complicated systems that involve many agents making independent decisions -- like the stock market -- are difficult to predict. ... One way to gain at least a moderate ability to predict is to start in the middle -- construct a system using quantitative representations for agent-level behavior and interactions observed from real life, let the simulation evolve according to a set of rules, then compare the system to qualitative observations from real life to see how close the model has come to representing the behavior of a real system. Researchers from Los Alamos National Laboratory, the University of Houston, and Rensselaer Polytechnic Institute have developed a quantitative model of software agents competing for limited resources that is representative of more complex systems. The model is a simple, expandable framework that accounts for social behavior in agent-based markets, said Marion Anghel, a technical research staff member at Los Alamos National Laboratory. It could eventually be used to study financial markets, behavioral economics, and quantitative sociology, and to optimize agent communications networks, including robot collectives, said Anghel. The researchers based their system on an existing multi-agent-competition model dubbed the minority game.... The researchers added a network of acquaintances that give advice to each other based on the agents' predictions about the best move in the game at any given moment. ... The researchers are aiming to eventually produce artificial agent systems that perform optimally as a collective, said [Zoltan] Toroczkai."
PyQLogger 1.0 PyQT Client for Blogger.com using Atom
DesktopLinux.com -- using Linux on enterprise and end user desktops
Topicmapping.com
Topicmapping.com
Seems to be the home page of "Jan Algermissen, Programmer and Software Architect", but it also has a lot of information about topic maps: "My primary area of interest and expertise is data models (such as the Relational Model but also new data models such as RDF or Topic Maps) and their suitability for data integration.
Topic Maps have originally been developed to solve data integration problems when merging electronic indexes and I believe that they will be the prevailing data model for data integration intensive environments.
I also focus on making XML Topic Maps more naturally integrate with the Architecture of the Web and to use them for developing application integration solutions."
Seems to be the home page of "Jan Algermissen, Programmer and Software Architect", but it also has a lot of information about topic maps: "My primary area of interest and expertise is data models (such as the Relational Model but also new data models such as RDF or Topic Maps) and their suitability for data integration.
Topic Maps have originally been developed to solve data integration problems when merging electronic indexes and I believe that they will be the prevailing data model for data integration intensive environments.
I also focus on making XML Topic Maps more naturally integrate with the Architecture of the Web and to use them for developing application integration solutions."
Wednesday, September 29, 2004
Situational Software Blog
JUNG - Java Universal Network/Graph Framework
JUNG - Java Universal Network/Graph Framework
"JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. It is written in Java, which allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries."
"JUNG — the Java Universal Network/Graph Framework--is a software library that provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. It is written in Java, which allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries."
Virtual Travelog | Judging the likely Success of an Ontology
FW: [Swoogle]: Swoogle Web Services Available
From: Swoogle
Dear Swoogle users,
We are happy to annonounce that Swoogle now provides Web service interfaces at
http://taga.umbc.edu:8338/swoogle/ws.
Currently, we provide three services:
searchDocument: return a set of documents
searchTerm: return a set of terms with URI
digestTerm: return sevearl sets of documents which either defined or populated a given term.
The query syntax the the first two servies are the same as "Document Search" and "Lookup term"(in Ontology dictionary). The third one takes query string as the full URI of a term.
The result is encoded in RDF using swoogle ontology
(http://swoogle.umbc.edu/webservice/swoogle.owl )
To use these webservies, you may use the Swoogle service client, which can be downloaded at
http://swoogle.umbc.edu/webservice/swoogleclient1.0.zip.
The web services are still under testing on a fairly slow machine, please don't put too much traffic on it. Also, please share us your experience and let us know your suggestions.
Regards,
swoogle developers
- Swoogle Staff
Dear Swoogle users,
We are happy to annonounce that Swoogle now provides Web service interfaces at
http://taga.umbc.edu:8338/swoogle/ws.
Currently, we provide three services:
searchDocument: return a set of documents
searchTerm: return a set of terms with URI
digestTerm: return sevearl sets of documents which either defined or populated a given term.
The query syntax the the first two servies are the same as "Document Search" and "Lookup term"(in Ontology dictionary). The third one takes query string as the full URI of a term.
The result is encoded in RDF using swoogle ontology
(http://swoogle.umbc.edu/webservice/swoogle.owl )
To use these webservies, you may use the Swoogle service client, which can be downloaded at
http://swoogle.umbc.edu/webservice/swoogleclient1.0.zip.
The web services are still under testing on a fairly slow machine, please don't put too much traffic on it. Also, please share us your experience and let us know your suggestions.
Regards,
swoogle developers
- Swoogle Staff
Web Semantics: Special Issue on Rules for the SW from Grigoris Antoniou on 2004-09-29 (www-rdf-interest@w3.org from September 2004)
Web Semantics: Special Issue on Rules for the SW from Grigoris Antoniou on 2004-09-29 (www-rdf-interest@w3.org from September 2004)
"Description
The Semantic Web is a major world-wide endeavour to advance the Web by enriching its content with semantic meta-information that can be processed by inference-enabled Web applications. Ontologies and automated reasoning are key techniques in the Semantic Web initiative.
Rules are considered to be a major issue in the further development of the Semantic Web. On one hand, they can be used in ontology languages, either in conjunction with, or as an alternative to, description logics. On the other hand, they are acting as a means to draw inferences, to express constraints, to specify policies, to react to events/changes, to transform data, etc.
Finally, rule markup languages will allow to enrich web ontologies by adding definitions of derived concepts, to publish rules on the Web, to exchange rules between different systems and tools, etc.
This special issue of the journal (http://www.semanticwebjournal.org/) is soliciting highest-quality submissions on all topics related to rule systems and rule markup languages for the Semantic Web."
"Description
The Semantic Web is a major world-wide endeavour to advance the Web by enriching its content with semantic meta-information that can be processed by inference-enabled Web applications. Ontologies and automated reasoning are key techniques in the Semantic Web initiative.
Rules are considered to be a major issue in the further development of the Semantic Web. On one hand, they can be used in ontology languages, either in conjunction with, or as an alternative to, description logics. On the other hand, they are acting as a means to draw inferences, to express constraints, to specify policies, to react to events/changes, to transform data, etc.
Finally, rule markup languages will allow to enrich web ontologies by adding definitions of derived concepts, to publish rules on the Web, to exchange rules between different systems and tools, etc.
This special issue of the journal (http://www.semanticwebjournal.org/) is soliciting highest-quality submissions on all topics related to rule systems and rule markup languages for the Semantic Web."
Tuesday, September 28, 2004
A Semantics for the Knowledge Interchange Format
A Semantics for the Knowledge Interchange Format
"Abstract
We give a precise semantics for a proposed revised version of the Knowledge Interchange Format. We show that quantification over relations is possible in a first-order logic, but sequence variables take the language beyond first-order."
"Abstract
We give a precise semantics for a proposed revised version of the Knowledge Interchange Format. We show that quantification over relations is possible in a first-order logic, but sequence variables take the language beyond first-order."
ASPN : Python Cookbook : Quicken QIF file class and conversion
ASPN : Python Cookbook : Quicken QIF file class and conversion
"Description:
A simple class to represent a Quicken (QIF) file, and a parser to load a QIF file into a sequence of those classes. It's enough to be useful for writing conversions."
"Description:
A simple class to represent a Quicken (QIF) file, and a parser to load a QIF file into a sequence of those classes. It's enough to be useful for writing conversions."
plone.org - Plone: A user friendly and powerful Content Management System
plone.org - Plone: A user friendly and powerful Content Management System: "Plone: A user friendly and powerful Content Management System This is the development and community site for Plone. Here, you'll find news about Plone and its related products, documentation"
Start-up banks on Java hardware boost | CNET News.com
Start-up banks on Java hardware boost | CNET News.com
"A Silicon Valley start-up called Azul Systems plans to start selling hardware next year designed to make it faster and more efficient to run Java programs"
"A Silicon Valley start-up called Azul Systems plans to start selling hardware next year designed to make it faster and more efficient to run Java programs"
Programming Language Popularity
On the Relative Expressiveness of Description Logics and Predicate Logics
On the Relative Expressiveness of Description Logics and Predicate Logics
"It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in ¨L3, the subset of First Order Predicate Calculus with monadic and dyadic predicates which allows only three variable symbols. In order to handle \number bounds", we allow numeric quantifiers, and for transitive closure of roles we use in nitary disjunction. Using previous results in the literature concerning languages with limited numbers of variables, we get as corollaries the existence of formulae of FOPC which cannot be expressed as descriptions. We also show that by omitting role composition, descriptions express exactly the formulae in ¨L2, which is known to be decidable."
"It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in ¨L3, the subset of First Order Predicate Calculus with monadic and dyadic predicates which allows only three variable symbols. In order to handle \number bounds", we allow numeric quantifiers, and for transitive closure of roles we use in nitary disjunction. Using previous results in the literature concerning languages with limited numbers of variables, we get as corollaries the existence of formulae of FOPC which cannot be expressed as descriptions. We also show that by omitting role composition, descriptions express exactly the formulae in ¨L2, which is known to be decidable."
Gnowsis - gnowsis
Gnowsis - gnowsis
"Welcome to gnowsis, the Semantic Desktop environment published by the Knowledge Management Lab of the DFKI. Gnowsis can be used in research projects or by interested individuals to benefit from Semantic Web technologies."
"Welcome to gnowsis, the Semantic Desktop environment published by the Knowledge Management Lab of the DFKI. Gnowsis can be used in research projects or by interested individuals to benefit from Semantic Web technologies."
The JACOB Project
Catching the Dreams
Catching the Dreams
"If the semantic web needed a symbol, a good one to use would be a Navaho dream-catcher: a small web, lovingly hand-crafted, ely to look at, and rumored to catch dreams; but really more of a symbol than a reality.
There are many visions of the semantic web, some of them more interesting, some more likely to make money, some more likely to happen in the near future. The excitement of these visions has attracted many people to the concept from a variety of different intellectual backgrounds - databases, logic programming, AI knowledge representation, description logics and programming languages, among others. The result is that there have been many different forces pulling the language designs in different directions.
On the whole, the description logics seem to be winning. OIL - arguably the first proposed web-based standard - and DAML are essentially the same language written in different syntactic forms, and they are both quintessential description logics. Now, description logics - DLs - have some very fine features. They can be seen as a kind of hybrid of industrial-strength data modelling tools with a limited form of conventional logics, located at a particularly nice place on the trade-off curve slung between the extremes of a highly expressive - but computationally intractable - full logic, and a highly efficient - but almost autistic - database notation. DLs have become a standard tool for professional ontology builders in industrial and commercial settings."
"If the semantic web needed a symbol, a good one to use would be a Navaho dream-catcher: a small web, lovingly hand-crafted, ely to look at, and rumored to catch dreams; but really more of a symbol than a reality.
There are many visions of the semantic web, some of them more interesting, some more likely to make money, some more likely to happen in the near future. The excitement of these visions has attracted many people to the concept from a variety of different intellectual backgrounds - databases, logic programming, AI knowledge representation, description logics and programming languages, among others. The result is that there have been many different forces pulling the language designs in different directions.
On the whole, the description logics seem to be winning. OIL - arguably the first proposed web-based standard - and DAML are essentially the same language written in different syntactic forms, and they are both quintessential description logics. Now, description logics - DLs - have some very fine features. They can be seen as a kind of hybrid of industrial-strength data modelling tools with a limited form of conventional logics, located at a particularly nice place on the trade-off curve slung between the extremes of a highly expressive - but computationally intractable - full logic, and a highly efficient - but almost autistic - database notation. DLs have become a standard tool for professional ontology builders in industrial and commercial settings."
Monday, September 27, 2004
ElementTree Overview ::: www.effbot.org
Swift Kick - The Semantic Argument Web - - Darwin Archive - Darwin Magazine
Swift Kick - The Semantic Argument Web - - Darwin Archive - Darwin Magazine is an article by David Weinberger questioning the plan for the semantic web.
SemTag and Seeker: Bootstrapping the Semantic Web via Automated Semantic Annotation
SemTag and Seeker: Bootstrapping the Semantic Web via Automated Semantic Annotation
"Abstract
This paper describes Seeker, a platform for large-scale text analytics, and SemTag, an application written on the platform to perform automated semantic tagging of large corpora. We apply SemTag to a collection of approximately 264 million web pages, and generate approximately 434 million automatically disambiguated semantic tags, published to the web as a label bureau providing metadata regarding the 434 million annotations. To our knowledge, this is the largest scale semantic tagging effort to date.
We describe the Seeker platform, discuss the architecture of the SemTag application, describe a new disambiguation algorithm specialized to support ontological disambiguation of large-scale data, evaluate the algorithm, and present our final results with information about acquiring and making use of the semantic tags. We argue that automated large scale semantic tagging of ambiguous content can bootstrap and accelerate the creation of the semantic web."
"Abstract
This paper describes Seeker, a platform for large-scale text analytics, and SemTag, an application written on the platform to perform automated semantic tagging of large corpora. We apply SemTag to a collection of approximately 264 million web pages, and generate approximately 434 million automatically disambiguated semantic tags, published to the web as a label bureau providing metadata regarding the 434 million annotations. To our knowledge, this is the largest scale semantic tagging effort to date.
We describe the Seeker platform, discuss the architecture of the SemTag application, describe a new disambiguation algorithm specialized to support ontological disambiguation of large-scale data, evaluate the algorithm, and present our final results with information about acquiring and making use of the semantic tags. We argue that automated large scale semantic tagging of ambiguous content can bootstrap and accelerate the creation of the semantic web."
FrontPage - PythonInfo Wiki
FrontPage - PythonInfo Wiki A WikiWikiWeb about Python.
Inside application assessments: Pen testing vs. code review
Inside application assessments: Pen testing vs. code review: "Nikto (an open source Web server scanner)" is just one tip in this article that compares penetration testing versus code review as a strategy for testing applications for security vulnerabilities.
Sunday, September 26, 2004
Semantic Wiki Wiki Web
pOWL - RDFS/OWL Ontology Browser
Building Interactive Libraries of Formal Algorithmic Knowledge
PRL Automated Reasoning Project at Cornell
PRL Automated Reasoning Project at Cornell "The project focuses on implementing computational mathematics and on providing logic-based tools that help automate programming"
Verity, Inc. : Intellectual Capital Management
Verity, Inc. : Intellectual Capital Management is a company selling applications of applied metadata. There is also a whitepaper (PDF) about Social Networks.
Entopia - solutions for information discovery
Entopia - solutions for information discovery is a company selling "Business Knowledge Applications". In particular see what they have to say about applications of Social Networks.
Descriptions of Social Relations
Descriptions of Social Relations is a paper with disussion of applications of social relations ontologies to enterprises. See this section:
"Social networks in enterprise Knowledge Management.
In the domain of KM, the categories of Enterprise Document Management and Collaboration software are rapidly merging into integrated solutions where metadata regarding the personal profiles and social networks of experts is combined with metadata about the documents and other content of the enterprise. Social network analysis packages from vendors such Entopia and Verity build on this metadata to provide overview and analysis of the human capital of the enterprise. (The rapid emergence of the new category of social software prompted Business 2.0 magazine to elect Social Network Applications as the software category of the year in 2003.) "
"Social networks in enterprise Knowledge Management.
In the domain of KM, the categories of Enterprise Document Management and Collaboration software are rapidly merging into integrated solutions where metadata regarding the personal profiles and social networks of experts is combined with metadata about the documents and other content of the enterprise. Social network analysis packages from vendors such Entopia and Verity build on this metadata to provide overview and analysis of the human capital of the enterprise. (The rapid emergence of the new category of social software prompted Business 2.0 magazine to elect Social Network Applications as the software category of the year in 2003.) "
Storymill Network
Storymill Network
"Tidepool™ remembers where you put your photos, no matter which computer, no matter which directory. It makes it easy to transfer stuff to a new computer. It finds photos on your camera or plug-in memory card. It can look in your email or on any website you choose. Use Tidepool to keep track of your calendar and contacts, synchronizing them easily between your mobile phone, PDA, email software, or favorite PIM (it even speaks FOAF and iCal.) Tidepool uses Storymill™ as a central hub, allowing you to share memories with small groups or entire communities. Tidepool let's you do off-peak replication between other Tidepool users and Storymill accounts. "
"Tidepool™ remembers where you put your photos, no matter which computer, no matter which directory. It makes it easy to transfer stuff to a new computer. It finds photos on your camera or plug-in memory card. It can look in your email or on any website you choose. Use Tidepool to keep track of your calendar and contacts, synchronizing them easily between your mobile phone, PDA, email software, or favorite PIM (it even speaks FOAF and iCal.) Tidepool uses Storymill™ as a central hub, allowing you to share memories with small groups or entire communities. Tidepool let's you do off-peak replication between other Tidepool users and Storymill accounts. "
