Filters








3,118 Hits in 4.2 sec

Negotiation Protocol Characterisation and Mechanisms for Virtual Markets and Enterprises [chapter]

Yigal Hoffner, Andreas Schade, Simon Field, Christian Facciorusso
2002 IFIP Advances in Information and Communication Technology  
This paper demonstrates how an extension of the ODPICORBA Trading Service can be exploited to provide a mechanism for automatic negotiations.  ...  The resulting IBM Dynamic MatchMaking Engine can be used to carry out both single and multi-attribute negotiations.  ...  (provider.PayRequest (Real) and customer.PayO.ffer(Real)) Information exchange: this includes the negotiation attributes and any other information necessary for the parties to make a decision.  ... 
doi:10.1007/978-0-387-35585-6_15 fatcat:riblqryxczgvpp6mg2uoak7ih4

An Approach to Grid Scheduling by Using Condor-G Matchmaking Mechanism

Emir Imamagic, Branimir Radic, Dobrisa Dobrenic
2006 Journal of Computing and Information Technology  
In this paper, we give an overview of issues related to grid scheduling. We describe in details one of the most mature solutions -Condor-G Matchmaking mechanism.  ...  Grid is a distributed environment that integrates computing, storage and other resources in order to enable execution of applications that cannot be run on a single resource.  ...  Next, we do not need to implement mechanisms and protocols for controlling sensors that collect information on individual resources.  ... 
doi:10.2498/cit.2006.04.09 fatcat:owalrwtpzbgcrbaol4nowge6z4

An approach to grid scheduling by using condor-G matchmaking mechanism

E. Imamagic, B. Radic, D. Dobrenic
2006 28th International Conference on Information Technology Interfaces, 2006.  
In this paper, we give an overview of issues related to grid scheduling. We describe in details one of the most mature solutions -Condor-G Matchmaking mechanism.  ...  Grid is a distributed environment that integrates computing, storage and other resources in order to enable execution of applications that cannot be run on a single resource.  ...  Next, we do not need to implement mechanisms and protocols for controlling sensors that collect information on individual resources.  ... 
doi:10.1109/iti.2006.1708553 fatcat:v22unxv46fg7zj77k3etaol5su

Matchmaking multi-party interactions using historical performance data

David Lambert, David Robertson
2005 Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05  
This is a vital mechanism for conducting matchmaking, but ignores the likelihood that in practice, and for various reasons, capability descriptions will not fully characterise the interaction behaviour  ...  Matchmaking will be an important component of future agent and agent-like systems, such as the semantic web.  ...  AKT is funded by the United Kingdom's Engineering and Physical Sciences Research Council.  ... 
doi:10.1145/1082473.1082566 dblp:conf/atal/LambertR05 fatcat:zljbgprm3vhlnmpll4jdcbgfxi

Engineering Ab Initio Dynamic Interoperability and Composability Via Agent-Mediated Introspective Simulation

Levent Yilmaz, Andreas Tolk
2006 Proceedings of the 2006 Winter Simulation Conference  
Hence, dynamic extensibility and adaptability is a significant concern in an application domain.  ...  Simulations that are dynamically extensible, while being interoperable require principled designs that facilitate engineering extensibility, interoperability, and composability in the first place.  ...  Using this approach information providers actively publish their capabilities and services to the matchmaker, and the consumers send requests for their desired information to the matchmaker.  ... 
doi:10.1109/wsc.2006.323197 dblp:conf/wsc/YilmazT06 fatcat:nbo5cqu3mvc7foxfijgengxdzm

Adding security and trust to multiagent systems

H. Chi Wong, Katia Sycara
2000 Applied Artificial Intelligence  
Our design addresses both security threats and trust issues. In our design, we h a ve mechanisms for ensuring secure communication among agents and secure naming and resource location services.  ...  When deployed in an open network such as the Internet, MASs face some trust and security issues. Agents come and go, and interact with strangers.  ...  The lookup protocol is shown in Fig. 6 . Note that since agent ids do not identify agents uniquely, the matchmaker returns both the agent id and the agent certi cate for each agent. A !  ... 
doi:10.1080/08839510050144886 fatcat:j75qv3pg5raxzo3zobmgoi5isu

Selecting Web Services Statistically [chapter]

David Lambert, David Robertson
2006 Lecture Notes in Computer Science  
To be useful for large and diverse sets of problems, eective service selection and composition is crucial.  ...  While current frameworks offer tools and methods for selecting services based on various user-dened criteria, little attention has been paid to how such services act and interact.  ...  Rewrite rules governing matchmaking for an LCC protocol These rewrite rules constitute an extension to those described in [10] .  ... 
doi:10.1007/11839354_12 fatcat:z2spkt57mbba5h2h2joltgdfkq

Matchmaking for Information Agents

Daniel Kuokka, Larry Harada
1995 International Joint Conference on Artificial Intelligence  
Factors such as the massive increase in information available via electronic networks and the advent of virtual distributed workgroups for commerce are placing severe burdens on traditional methods of  ...  Matchmaking proposes an intelligent facilitation agent that accepts machinereadable requests and advertisements from information consumers and providers, and determines potential information sharing paths  ...  Acknowledgments The initial concept of matchmaking and the KQML formalization stemmed from efforts by the entire SHADE team, including Jim McGuire, Jay Weber, Greg Olsen, Rich Pelavin, Tom Gruber, and  ... 
dblp:conf/ijcai/KuokkaH95 fatcat:e2ze337pcvgplbqb4ntc7koyaq

Privacy-preserving matchmaking For mobile social networking secure against malicious users

Qi Xie, U. Hengartner
2011 2011 Ninth Annual International Conference on Privacy, Security and Trust  
Namely, the server knows the interests and current location of each user and performs matchmaking based on this information. This approach allows the server to track users.  ...  This paper proposes a privacy-preserving matchmaking protocol for mobile social networking that lets a potentially malicious user learn only the interests (or some other traits) that he has in common with  ...  ACKNOWLEDGEMENTS We thank the anonymous reviewers for their helpful comments. This work is supported by a Google Research Award and by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1109/pst.2011.5971991 dblp:conf/pst/XieH11 fatcat:iofpszkuhrerlks6zeskf3vaey

Aida Efficient Algorithm For Anonymous Sharing Of Private Data In Distributed Networks

MRS. A.V.BANSOD
2018 Zenodo  
This paper addresses the issue of anonymous ID assignment to nodes in a distributed network and how it can be integrated with secure mining algorithms to allow nodes that have privacy concerns, a capability  ...  In this paper anonymous ID used for hiding the data sharing, also allows multiple partied on a network to jointly carry out a global computation that depends on data from each party while the data held  ...  Security issues for integrated and collaborative sharing of computing resources across heterogeneous administrative domains are principal concern.  ... 
doi:10.5281/zenodo.1410200 fatcat:3lqg46s2trgkxc7xmh7qf3clbm

Knowledge Representation Methods for Smart Devices in Intelligent Buildings

Giuseppe Loseto, Michele Ruta
2012 International Conference of the Italian Association for Artificial Intelligence  
The integration of knowledge representation features and reasoning techniques (originally devised for the Semantic Web) into standard home automation protocols can offer high-level services to users.  ...  Home and building automation aims at improving features and capabilities of household systems and appliances. Nevertheless, current solutions poorly support dynamic scenarios and context-awareness.  ...  A crucial issue for feasible and effective AmI solutions lies in efficient resource/service discovery.  ... 
dblp:conf/aiia/LosetoR12 fatcat:ymkdospjaneotiscksjhbciufq

mRDP: An HTTP-based lightweight semantic discovery protocol

Juan Ignacio Vazquez, Diego López-de-Ipiña
2007 Computer Networks  
Most of these protocols are designed for one concrete purpose: network nodes discovery, service discovery, search of specific information stored through the network, and so forth.  ...  Moreover, these data structures possess some underlaying meanings and relationships that are usually hidden from traditional discovery protocols that use simple text-based matchmaking.  ...  If the client needs to find more information for a concrete resource, it requests the mRDP client module to issue a description location request to the network.  ... 
doi:10.1016/j.comnet.2007.06.017 fatcat:e436kjgdq5bd3fcj6sxahi25ei

Security for DAML Web Services: Annotation and Matchmaking [chapter]

Grit Denker, Lalana Kagal, Tim Finin, Massimo Paolucci, Katia Sycara
2003 Lecture Notes in Computer Science  
The security reasoner is integrated with the Semantic Matchmaker from CMU giving it the ability to provide security brokering between agents and services.  ...  The focus of this paper is to develop security annotations for web services that are represented in DAML-S and used by agents.  ...  We thank the anonymous reviewers for their comments that helped to improve the paper.  ... 
doi:10.1007/978-3-540-39718-2_22 fatcat:36ehvxlom5eo5iq4ognb26v2ae

Integrating Information via Matchmaking [chapter]

Daniel Kuokka, Larry Harada
1996 Intelligent Integration of Information  
In addition, several applications are described to illustrate the utility of matchmaking for information retrieval.  ...  Matchmaking proposes an intelligent facilitation agent that accepts machine-readable requests and advertisements from information consumers and providers, and determines potential information sharing paths  ...  Acknowledgments The initial concept of matchmaking and the KQML formalization stemmed from efforts by the entire SHADE team, including Jim McGuire, Jay Weber, Greg Olsen, Rich Pelavin, Tom Gruber, and  ... 
doi:10.1007/978-1-4613-0467-8_8 fatcat:it4fxd72pvax3eeyh5ozgu33xa

FSP and FLTL framework for specification and verification of middle-agents

Amelia Bădică, Costin Bădică
2011 International Journal of Applied Mathematics and Computer Science  
FSP and FLTL framework for specification and verification of middle-agents Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing  ...  The main results of this work include (i) precise specification of interaction protocols depending on the type of middle-agent (this can also be a basis for characterizing types of middle-agents), (ii)  ...  Nalepa, for the effort made to prepare this special section and also the anonymous reviewers for their very useful feedback to improve the preliminary version of this paper.  ... 
doi:10.2478/v10006-011-0001-6 fatcat:fajecbr6x5eaxckkvbkwdkxkja
« Previous Showing results 1 — 15 out of 3,118 results