I propose the concept of a latent weblog community (LBC), as a means to promote the autonomous organization of knowledge on the Internet. Such communities can be illustrated in terms of bipartite graphs based on weblog update information, and they can effectively function to create meeting spaces for bloggers who write about similar or closely related topics but do not know each other. To extract these communities from blogspace, I developed a partitioning algorithm known as the Weakest Pair (WP) algorithm, which separates the weakest pairs of bloggers and webpages, respectively, using co-citation information. As a result of numerical evaluation, the WP algorithm is more effective than the Shortest Path Betweenness (SPB) algorithm in terms of information loss and completeness of bipartite graphs. I will provide three examples of LBC extracted using the WP algorithm and report its secondary effects, i.e. personae detection, the detection of a set of weblogs owned by a single blogger.

Local variables, the scope, and data flow from inputs of Web Services to outputs are introduced into the OWL-S 1.1 specification. However, these new features are not useful for agents to discover and compose Web Services. Agents must know the meanings of services through interpreting service parameters, i.e., inputs, outputs, preconditions, and effects (IOPEs). The subsumption of IOPEs helps agents to obtain the meanings, but understanding local variables and the scope is intricate for agents. The scope of variables and data flow is not what agents interpret but what agents generate as a result of web composing. Furthermore, it is very laborious for ones to describe tasks with the OWL-S expression. Therefore, based on Scheme and SWCLOS, a Semantic Web processor on top of CLOS, we design a task language that describes tasks and executed by agents. A task is captured as an ensemble of service, simple process, and complex process or atomic processes in OWL-S. Agents can obtain the meanings of services with subsumption of IOPEs of tasks, and composes them in order to accomplish given goals. Agents may perform those tasks directly, or may compile the task expressions into pieces of OWL-S code that includes descriptions of local variables and the scope.

Recently, network services have been increasing and we think it is very important to develop many OSSs (Operation Support Systems) to support these services. We think it will be possible to develop OSS efficiently by the reuse of the deliverables in the past developments. Using ontologies in the new OSS development, we could find models similar to new ones from the deliverables in the past developments. We propose how to calculate the similarity between ontologies.