ebXML   masters by research in Computer Science  by Sacha Schlegel
   http://www.schlegel.li/ebXML/index.html    is the homepage of this project.

 M E E T I N G

 
m e e t i n g . h e a d e r  
  
date:    February 24th, 2003
week:    9
report:    x out of y
location:    School of Computing at Curtin University
Building 314, Level 4 Meeting room Don Reid
person:    Don Reid, supervisor
Sacha Schlegel, student (2967)
 
m e e t i n g . a c t i v i t i e s  
  
  • Reshuffling, enhancing algorithm level one. Creating CPA DOM then print the DOM. Ideas for XML Schema for conflict file.
  • Meeting with Tim McGrath last friday. - A guest lecture at Notre Dame University, Fremantle end of April while Tim is in Europe for the XML Conference.
 
m e e t i n g . n o t e s  
Don did bring up some question about ebXML or electronic business in general:
  • This project looks at two CPPs and then writes down a draft CPA (or even more than one if the CPPs are composed in such a way that it allows to get more than one CPA).
  • This project concentrates on binary Collaborations only!
  • Real world works with multi collaboration business processes. Eg. company A sells to company B via company C. Company A has bank X, company B has bank Y, company C has bank Z. To ship from A to B they use insurance T and from B to C insurance U. Bank X and Bank Y do not work together so any money transfer has to go through bank M which has relations to X and Y.
  • So Don sees the future that not only a CPA will be composed but that the world will try to match more than just one CPA. From the example above there will be an algorithm which tries to compose all possilbe CPAs!
  • Further currently lets say Company A downloads the CPPs of 100 companies. Assuming the CPA composition will result in about 80 CPAs (as the companies are already selected from a certain critera from the registry e.g. all companies located in my destination country from industry such and such). So which CPA will company A choose??? If company a wants to buy screws which CPA does it use to get the screws? Where is the price and conditiion negotiation?? etc.
  • Problem of classification of goods/items. If the product gets shipped from country A to country B in the middle of the sea the classification can change, or in the destination country there is no classification tag for the shipped product etc.
  • This project can help to understand problems which arise from pair wise CPA formation. This can lead to questions of multi collaborations.
Negotiation
  • Finish algorithm for level 1, then very basic level 3.
  • Deal if preference lists in level 1. Very quick look at the marriage algorithm for those elements.
  • Provide an interface / a way for someone to finish up work. Eg. provide dummy methods or an API. (eg. if Certificates are not further dealt with, provide something which indicates how to go ahead with Certificates.
  • For level 2 think of the main goals!
  • Select one area of the CPP / CPAs to negotiate. eg Protocol full stop.
  • List a set of basic scenarios for selected area.
  • List of strategies for basic scenarios.
  • Find some general rules for selected area and maybe a scenario.
  • Is it possible to apply Game Theory to the selected area, scenario? What is part of Game Theory. How does Game Theory work? Is there a Game Theory framework which could be applied/used.
  • If there will be utility functions for negotiation, Don recalls that the hard part is to give values to these utlities. Assuming the value can be between 1 - 10. So how much worth is it to get an A in a Masters By Research? Very hard question....
  
  
  
 
m e e t i n g . t o . d o . l i s t  
Keep focused. Dont follow side paths, have a quick look at them but keep focuesd on main work
  
  
  
  


© Sacha Schlegel@2003!