Final Report

Question 1
Compare the following forms of information representation in terms of (you can add more aspects)
structuralizing, machine/human friendliness, data structure, application scenarios.
Relational Database, HTML, XML, RDF

Question 2
(1) Draw the corresponding RDF graph according to the following XML document.
<?xml version="1.0"?>
<rdf:RDF
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:cd="http://www.recshop.fake/cd/">
<rdf:Description
rdf:about="http://www.recshop.fake/cd/Empire Burlesque">
<cd:artist>Bob Dylan</cd:artist>
<cd:country>USA</cd:country>
<cd:company>Columbia</cd:company>
<cd:price>10.90</cd:price>
<cd:year>1985</cd:year>
</rdf:Description>

(2) If the property artist has sub-property fullname = “Bob Dylan” and homepage =
“http://example.bobdylan.com” which has been included in "http://www.recshop.fake/cd#",
write the XML document based on (1) and its corresponding RDF graph

Question 3
(1) Find H(T2), H(T3) in the following Hash pointers
T1 →23→ Alice
T2 Alice →16→ Bob
T3 Bob →8→ Carol

(2) Explain what will happen if there is a modification of T2 to T2`=“Alice →36→ Bob” and how
to solve the problem if this modification is valid with centralized ledger.

Question 4
(1) Explain what Bitcoin mining puzzle is using figures
(2) Besides the digital currency Bitcoin, please discuss another application of Blockchain
technology with an example pertaining to in your research field.

Intentions
Q1
To enable students to get the overall understanding of several typical information
representation forms related to RDF and its application areas.

Q2
To test the basic knowledge of XML, RDF graph.

Q3
To test the basic knowledge of Hash pointer and the Blockchain.

Q4
Test the several applications of Blockchain technology and the connection of their own
researches.
Model Answers
Q1
Example:
Database HTML XML RDF
Structuralizing High Low High High
Machine/human Machine- Human-oriented Machine-oriented Machine-oriented
friendliness oriented
Data structure Array String Tree Graph
Application Operational WWW RSS Inference and AI
(More comparation items can be discussed.)

Q2
(1)

http://www.recshop.fake/cd/Empire Burlesque

http://www.recshop.fake/cd/artist http://www.recshop.fake/cd/year
http://www.recshop.fake/cd/company
1985
Bob Dylan
Columbia http://www.recshop.fake/cd/pric
http://www.recshop.fake/cd/country
e
USA 10.90

(2)
<?xml version="1.0"?>
<rdf:RDF
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:cd="http://www.recshop.fake/cd#">
<rdf:Description
rdf:about="http://www.recshop.fake/cd/Empire Burlesque">
<cd:artist rdf:nodeID="art"/>
<cd:country>USA</cd:country>
<cd:company>Columbia</cd:company>
<cd:price>10.90</cd:price>
<cd:year>1985</cd:year>
</rdf:Description>
<rdf:Description rdf:nodeID="art">
<cd:fullname>Bob Dylan</cd:fullname>
<cd:homepage rdf:resource="http://example.bobdylan.com"/>
</rdf:Description>

http://www.recshop.fake/cd/Empire Burlesque

http://www.recshop.fake/cd/year
http://www.recshop.fake/cd/artist
http://www.recshop.fake/cd/company
1985

Columbia http://www.recshop.fake/cd/pric
http://www.recshop.fake/cd/country
e
USA 10.90

http://www.recshop.fake/cd/fullname http://www.recshop.fake/cd/homepage

http://example.bobdylan.com
Bob Dylan

Q3
(1)
H(T2) = H(H(T1)| Alice →16→ Bob) = H(H(|→23→ Alice)| Alice →16→ Bob)
H(T3) =H(H(T2)| Bob →8→ Carol) = H(H(H(|→23→ Alice)| Alice →16→ Bob)| Bob →8→ Carol)

(2)
H(T2`) will be different from H(T2) recorded in the header of T3 block, thus making the
modification invalid.
In the situation of centralized ledger, H(T2’) and its corresponding H(T3’) will be recalculated and
the new H(T3’) will be signed by the ledger, thus making the modification valid.

Q4
(1)
Example: It refers to the large-scale calculation to find the nonce Ni given the header of previous
block and the hash value of transactions, the first solution will win.
(figures can refer to the last page of the lecture slide)

(2)
Example: In the field of education, the blockchain technology can be used to record the learning
evidence throughout the life for students and cam be shared by all institutions participated in the
chain. Since the learning data and academic performance also have requirement for confidentiality,
accuracy and integrity, using Blockchain technology can guarantee the information sharing and
validity.