Data processing: artificial intelligence – Miscellaneous
Reexamination Certificate
2002-10-24
2008-11-18
Holmes, Michael B (Department: 2129)
Data processing: artificial intelligence
Miscellaneous
Reexamination Certificate
active
07454400
ABSTRACT:
A plurality of components are specified to perform a negotiation, where each component is a participant, a coordinator, or both. Each component is provided with a conversion table that maps a set of parameters between invocation patterns instantiated by the participants. Each coordinator is provided with a negotiation graph that it modifies to coordinate its neighborhood of negotiation graphs, and each participant is provided with a negotiation graph that it modifies for each invocation pattern it instantiates. Two message types are sent between components that communicate directly with each other in each neighborhood of negotiation graphs. The two message types are sent between the components to collaboratively mirror their negotiation graphs using their conversion tables in each neighborhood of negotiation graphs so that each participant only views information concerning those aspects in its negotiation graph that relate to the parameters of the invocation patterns it instantiated.
REFERENCES:
patent: 4907274 (1990-03-01), Nomura et al.
patent: 5303078 (1994-04-01), Brackett et al.
patent: 5586021 (1996-12-01), Fargher et al.
patent: 5659740 (1997-08-01), Ezaki et al.
patent: 5801695 (1998-09-01), Townshend
patent: 5809075 (1998-09-01), Townshend
patent: 5826040 (1998-10-01), Fargher et al.
patent: 5826239 (1998-10-01), Du et al.
patent: 5826244 (1998-10-01), Huberman
patent: 5835538 (1998-11-01), Townshend
patent: 5847692 (1998-12-01), Ono
patent: 5859872 (1999-01-01), Townshend
patent: 5924082 (1999-07-01), Silverman et al.
patent: 5953707 (1999-09-01), Huang et al.
patent: 5970103 (1999-10-01), Townshend
patent: 6043909 (2000-03-01), Holub
patent: 6088659 (2000-07-01), Kelley et al.
patent: 6112189 (2000-08-01), Rickard et al.
patent: 6128773 (2000-10-01), Snider
patent: 6151582 (2000-11-01), Huang et al.
patent: 6157735 (2000-12-01), Holub
patent: 6182055 (2001-01-01), Kase et al.
patent: 6195794 (2001-02-01), Buxton
patent: 6233275 (2001-05-01), Townshend
patent: 6233284 (2001-05-01), Townshend
patent: 6246975 (2001-06-01), Rivonelli et al.
patent: 6321133 (2001-11-01), Smirnov et al.
patent: 6400770 (2002-06-01), Townshend
patent: 6459425 (2002-10-01), Holub et al.
patent: 6594773 (2003-07-01), Lasitsa et al.
patent: 6690749 (2004-02-01), Townshend
patent: 6750992 (2004-06-01), Holub
patent: 6792615 (2004-09-01), Rowe et al.
patent: 6801937 (2004-10-01), Novaes et al.
patent: 6823068 (2004-11-01), Samid
patent: 6842899 (2005-01-01), Moody et al.
patent: 6859927 (2005-02-01), Moody et al.
patent: 6882988 (2005-04-01), Subbu et al.
patent: 6934684 (2005-08-01), Alpdemir et al.
patent: 6961943 (2005-11-01), Miller et al.
patent: 6978244 (2005-12-01), Rovinelli et al.
patent: 6985722 (2006-01-01), Snelgrove et al.
patent: 6995870 (2006-02-01), Holub
patent: 6996843 (2006-02-01), Moran
patent: 7016882 (2006-03-01), Afeyan et al.
patent: 7024399 (2006-04-01), Sumner et al.
patent: 7024589 (2006-04-01), Hartman et al.
patent: 7065588 (2006-06-01), Konda et al.
patent: 7075643 (2006-07-01), Holub
patent: 7085329 (2006-08-01), Townshend
patent: 7089534 (2006-08-01), Hartman et al.
patent: 7107253 (2006-09-01), Sumner et al.
patent: 7120646 (2006-10-01), Streepy, Jr. et al.
patent: 7170993 (2007-01-01), Anderson et al.
patent: 7206805 (2007-04-01), McLaughlin, Jr. et al.
patent: 7277874 (2007-10-01), Sumner et al.
patent: 7290056 (2007-10-01), McLaughlin, Jr. et al.
patent: 7312897 (2007-12-01), Holub
patent: 2002/0052824 (2002-05-01), Mahanti et al.
patent: 2002/0111922 (2002-08-01), Young et al.
patent: 2002/0116349 (2002-08-01), Batachia et al.
patent: 2002/0147726 (2002-10-01), Yehia et al.
patent: 2003/0069736 (2003-04-01), Koubenski et al.
patent: 2003/0069737 (2003-04-01), Koubenski et al.
patent: 2004/0034848 (2004-02-01), Moore et al.
patent: 2004/0083186 (2004-04-01), Andreoli et al.
patent: 2005/0027495 (2005-02-01), Matichuk
patent: 2005/0108036 (2005-05-01), Andreoli et al.
patent: 1 074 937 (2001-02-01), None
Environmental conflict resolution using the graph model Hipel, K.W.; Liping Fang; Kilgour, D.M.; Haight, M.; Systems, Man and Cybernetics, 1993. ‘Systems Engineering in the Service of Humans’, Conference Proceedings., International Conference on Oct. 17-20, 1993 pp. 153-158 vol. 1 Digital Object Identifier 10.1109/ICSMC.1993.384737.
Managing intellectual property rights in the WWW: patterns and semantics Gil, R.; Tous, R.; Delgado, J.; Automated Production of Cross Media Content for Multi-Channel Distribution, 2005. AXMEDIS 2005. First International Conference on Nov. 30-Dec. 2, 2005, pp. 8 pp. Digital Object Identifier 10.1109/AXMEDIS.2005.30.
Agha, G. et al. “A foundation for actor computation”, in Journal of Functional Programming, 7(1): 1-72, 1997.
Aksit, M et al. “Abstracting object interactions using composition filters”, in R.Gerraoui, O. Nierstrasz, and M.Riveille, editors, Object Based Distributed Processing. Springer Verlag, 1994.
Andreoli, Jean-Marc et al. “AllianceNet: Information Sharing, Negotiation and Decision-Making for Distributed Organizations,” in Proceedings of EC-Web 2000, London, U.K. 2000.
Andreoli, Jean-Marc et al. “CLF/Mekano: a Framework for Building Virtual-Enterprise Applications,” in Proceedings of EDOC'99, Manheim, Germany, 1999.
Andreoli, Jean-Marc et al. “Towards a Flexible Middleware Negotiation Facility for Distributed Components”, in Proceedings of DEXA “E-Negotiations” workshop, Munich, Sep. 5, 2001.
Andreoli, Jean-Marc et al. “Multiparty Negotiation for Dynamic Distributed Components”, in Journal of Science of Computer Programming, 31(2-3):179-203, 1998.
C. Berge. “Graphs and hypergraphs”, in North-Holland Publishing Company, Amsterdam, Inc., 1973, Chapter 17, pp. 389-413.
W. Emmerich, “Software Engineering and Middleware: A Roadmap”, in Proceedings of ICSE 2000, The future of Software Engineering, Munich, Germany, 2000.
J-Y. Girard, “Linear logic”, in Theoretical Computer Science, 50:1-102, 1987.
McConnell, Stephen et al. “Negotiation Facility,” OMG final revised submission for a CORBA service, 1999.
Yellin et al. “Protocol specifications and component adaptors”, in ACM Transactions on Programming Languages and Systems, 19(2): 292-333, 1997.
Andreoli, Jean-Marc et al., “Augmenting Offices With Ubiquitous Sensing”, in Proc. of Smart Object Conference, Grenoble, 2003.
Andreoli, Jean-Mark et al., “Negotiation as a Generic Component Primitive”, in Proc. of Distributed Application and Interoperable Systems, Paris, France, 2003.
Andreoli, Jean-Marc et al., “Ubiquitous Negotiation Games: A Case Study”, in Proc. of DEXA “e-negotiations” Workshop, Prague, Czech Republic, 2003.
Bichler, M. et al., “Towards, a Structured Design of Electronic Negotiations”, in Group Decision and Negotiation Journal, 12(4):311-335, 2003 (earlier version InterNeg Research papers INR Jul. 2002).
Castellani, S. et al., “E-Alliance: A Negotiation Infrastructure for Virtual Alliances” in Group Decision and Negotiation Journal, 12(2):127-141,2003.
Chen, Y., “Arc Consistency Revisited”, in Information Processing Letters, 70:175-184, 1999.
Jung et al., “Argumentation as distributed constraint satisfaction; applications and results”, published in Proceedings of International Conference on autonomous Agents, pp. 324-331, Montreal, QB, Canada.
Mackworth, A., “Constraint Satisfaction”, in Shapiro, S. (Eds.), Encyclopedia of Artificial Intelligence (2nded.), John Wiley and Sons (pp. 285-293), 1992.
Montanari, U., “Networks of Constraints: Fundamental Properties and Applications to Picture Processing”, in Information Science, 7, pp. 95-132, 1974.
Nelson, G. et al., “Simplification by Cooperating Decision Procedures”, in ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
Shostak, R., “A Practical Decision
Andreoli Jean-Marc
Castellani Stefania
Fay Sharpe LLP
Holmes Michael B
Xerox Corporation
LandOfFree
System for negotiation with mirroring does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System for negotiation with mirroring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for negotiation with mirroring will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4041266