Kuokka, D.R. and L.T. Harada, Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 1996. 5: p. 2-3.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the service actually does. The invocation related information is of limited value for search purposes because services with different goals (e.g. services that compute averages, medians, quartiles, etc. can share similar call signatures. Other approaches (such as deductive retrieval [16] 17] [18] or execution based retrieval [19] 20] 21] are usually only suitable for limited application domains, as they are, typically, to complex (both from a computational and a usability perspective) 3 Our Approach: Exploiting Process Ontologies Our challenge can thus be framed as being able to ....

Kuokka, D.R. and L.T. Harada, Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 1996. 5: p. 2-3.

....that compute averages, medians, quartiles, etc. can share similar call signatures. Precision can be increased, however, in technologies such as UDDI that allow services to be classified using pre defined taxonomies. A third important class of search technique is deductive retrieval [16] 17] [18] wherein service and query semantics are expressed formally using logic (Figure 3) Name: set insert Syntax: set insert(Elem, Old, New) Input types: Elem:Any) Old:SET) Output types: New: SET) Precond: Old Elem member Postcond: member(Elem,New) x (member(x,Old) member(x,New) ....

Kuokka, D.R. and L.T. Harada, Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 1996. 5: p. 2-3.

....for future use. Both approaches rely on the use of subscription and notification mechanisms. These range from simple ones such as defined within active databases [1, 3] to more complex techniques such as content based routing as defined within multiagent based approaches for result sharing [17, 18]. Support for the more advanced techniques require that a number of open issues and extensions are addressed [18] For the purpose of this paper we briefly highlight some of the relevant issues: generality of advertisements and request. For example, one could introduce a SQL construct such as ....

.... ones such as defined within active databases [1, 3] to more complex techniques such as content based routing as defined within multiagent based approaches for result sharing [17, 18] Support for the more advanced techniques require that a number of open issues and extensions are addressed [18]. For the purpose of this paper we briefly highlight some of the relevant issues: generality of advertisements and request. For example, one could introduce a SQL construct such as the where clause to prune the number of result notifications and subscriptions. error recovery. One of the ....

D.R. Kuokka and L.T. Harada. Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 5(2--3):251-- 274, 1996.

....Description a service to find the average of a list of integers Input integers Output real Execution Time number of inputs 0.1 msec Figure 2: A frame based description of an integer sorting service. The frame based approach is taken one step further in the deductive retrieval approach [15] [16] [17] wherein service properties (e.g. inputs, outputs, function, and performance) are expressed formally using logic (Figure 3) Name: set insert Syntax: set insert(Elem, Old, New) Input types: Elem:Any) Old:SET) Output types: New: SET) Semantics: Precond: Old Elem member ....

Kuokka, D.R. and L.T. Harada, Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 1996. 5: p. 2-3.

....challenges: first, they must be able to find each other (in an open environment, agents might appear and disappear unpredictably) and once they have done that, they must be able to inter operate. To address the issue of finding agents in an open environment like the Internet, middle agents [88] have been proposed. Each agent advertises it capability to some middle agent. A number of different agent types have been identified, including matchmakers or yellow page agents (that match advertisements to requests for advertised capabilities) blackboard agents (that collect requests) and ....

D. R. Kuokka and L. P. Harada. Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 5(2-3):251--274, 1996.

....by a given operation, or 2. specific results such as p(x) which we will refer to as context based subscription. Previous work on result sharing (information sharing) has suggested a SQL construct such as the where clause in order to prune the number of result notifications and subscriptions [21]. 2.3 Research Goals When considering ECA rules for result sharing, it is important that similar mechanisms are supported for pruning the number of result notifications and subscriptions. Currently, ECA rule subscriptions provide (indirect) support for the first category, i.e. the most general ....

D.R. Kuokka and L.T. Harada. Issues and extensions for information matchmaking protocols. International Journal of Cooperative Information Systems, 5(2--3):251--274, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC