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:    Feburary 17th, 2003
week:    8
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  
  
  • Very first algorithm passes most elements and checks for matches and mismatches.
  • Contact with Steve Capell Sydney. They install the open source ebXML registry/repository this week. They are interested in what I am doing.
    Will keep him updated of the next actions.
  • Review of algorithm. Nice OO. Make it parse all elements, multiple occurances of elements. Write out draft CPA plus _mistmatch_ list.
    (1/2 - 1 week).
  • not sure how deep I have to go with XML Digital Signatures. Probably all the way. So this means enhancing the algorithm to go
    down the path of XML Digital Signature as well.
  • Have to check what kind of messages (business level messages, business level sync message, transport level messages + signals,
    message level messages + signals, ... to understand certain fileds within the CPP's.
  • Run 2 of phase one is to take into account the Negotiation Description Document.
  • Then phase 3 before phase 2. Phase 3 have some sort of web-based workflow negotiation support system.
    Research necessary. But basically keep it simple.
  • No meeting arranged with Tim McGrath.
 
m e e t i n g . n o t e s  
Note for my remote supervisor Andrew:
Phase 1 - algorithm, phase 2: automated negotitation, phase 3: human negotiation.
For phase 1: improved algorithm writes draft cpa PLUS a log file (XML Document?) with XPath references to conflicting elements. Don suggested to also right down values of both CPPs plus, if possible a solution to problem.
My friend noted to have a classification of conflicts, plus have a classification of rules. This can result in ruby classes which will be instantiated at run time. Eg. there can be a MatchingClass to each CPPA XML Schema element....
After Dons idea: After phase 1 continue with phase 3. Keep it simple. This phase then helps to think about phase 2. Basically phase 2 will do what phase 3 does but automatic. Phase 2 then again can influence the algorithm of phase 1 (evoultuon of know how).
The idea is to maybe hold on to a specific problem area, problem elements. Maybe specialise on security with digital signatures.... Don suggestion.
Ultimate research will be phase 2. So go ahead quickly with phase 1 and 3.
For phase 2: have a framework with "sort of plugable rules" how to negotiate over elements.
For phase 2: start with simple elements. Then discuss complicated situations.
 
m e e t i n g . t o . d o . l i s t  
Keep up the good work (oh thats my only comment ;)
Go over algorithm of phase 1, rewrite to parse all (almost) elements plus write out log.
After rewrite of algorithm quickly review Negotiation Support Systems and think of phase 3.
Write weekly updates to Andrew.


© Sacha Schlegel@2003!