In the morning, I had a meeting with Prof. Kintigh. I explained to him about the report I sent to him two days ago. In that report, I explained the procedures of matching and merging in our paper, by means of the example he provided before. Dr.Candan is pretty satisfied with this example, and it does really reflect the motivation of our work: to integrate data with different schemas. 

His questions are mainly about the special edges in the master coding system. I think that the goal of these edges is to maintain the integrity of individual coding systems, so that concepts defined in different criteria won't be misused. In other words, we merge different schemas, but in the meantime maintain their independency.  (Hold on! The semantics of the mapping defined in the current paper, could be changed, because of the way we used to merge the different schemas. !!! Where does the conflicts from though???)

Although special edges exist in the merged schema, we treat them as same as other regular edges when evaluating the user's path query. 

In the afternoon, I had a meeting with Dr.Candan and Prof. Sapino. We looked over the progress we made in the current version paper, and made some decisions about the outline of the potential final paper. Below I give a general idea of our recent work. Four parts are concerned: 

1. Choice agreement computation:

• algorithm
• complexity 2^E
• overlap ?? 
• implementation ??

2. K-highest confidential paths:

• Yen's algorithm ( should be implemented! )

3. K-lowest confidential paths:

• edge sorting + pairs of node-disjoint paths
• dynamic programming

4. Path instances analysis:

• Cycle detection in the graph (finding all pairs of shortest paths, and check the reachabilities among paths)
• Analysis of compatibilities among different paths, which are the results of query evaluation. 

Finally, my assignment is to implement the Yen's algorithm to find k-shortest paths in the graph, and all pairs of shortest paths in the same graph.