![Page 1: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/1.jpg)
Presentation Template
KwangSoo YangFlorida Atlantic University
College of Engineering & Computer Science
![Page 2: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/2.jpg)
1. What is the problem?
2. Why is it important?
3. Why is it challenging (or hard)?
4. What are the limitations of the related work? What is the novelty?
5. What are the contributions?
6. What is the validation methodology?
Six Items of Critical Reading
![Page 3: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/3.jpg)
1. What is the problem?
1. What is the problem addressed in the paper?2. Is it clearly stated?3. Does the author make the important issues clear?
![Page 4: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/4.jpg)
2. Why is it important?
1. Is the problem significant / relevant?2. Is there any reason to care about the problem
(practical applications / real world applications) and paper’s results?
3. Is the problem new?
![Page 5: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/5.jpg)
3. Why is it challenging?
What is the difficulty of solving the problem? Computationally complex? (NP completeness?) Large search space? Hard to solve?
![Page 6: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/6.jpg)
4. What are the limitations of the related work? What is the novelty?
1. Has the problem been solved before?2. Is this a trivial variation on or extension of previous
results?3. Is the author aware of related and previous work,
both recent and old?4. What are the assumptions and limitations of related
work?5. Which limitation is solved in the paper?6. Critique an assumption that you believe is
unreasonable. 7. What is the impact of removing this unreasonable
assumption on the solution proposed by the authors?
![Page 7: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/7.jpg)
5. What are the contributions?
1. Is the problem the extension of the related work? Which part is extended?
2. Is the problem new?3.What are the proposed approaches, algorithms, and
ideas?4. Is there any experimental and analytical evaluation?
![Page 8: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/8.jpg)
6. What is the validation methodology?
1. Case study?2. Statistical hypothesis testing?3. Analytical evaluation?4. Computational complexity?5. Theorem and lemmas, proofs?6. Experimental evaluation?7. The strengths and weaknesses of the methodology? 8. Why did authors choose this/these methodology?
![Page 9: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/9.jpg)
Why is the problem?
Input: A spatio-temporal network (STN) Set of operations
Output: Storage and access methods
Objective: Minimize disk page access
Constraints: Spatio-temporal network is too large for main memory. Preserve temporal attribute information. (lossless storage)
![Page 10: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/10.jpg)
Lagrangian Approaches to Storage ofSpatio-temporal Network Datasets
KwangSoo YangFlorida Atlantic University
College of Engineering & Computer Science
![Page 11: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/11.jpg)
Why is it important?
Dynamic social network Airline flight schedule
Power distributionSpatio-temporal road network
There are many network applications
- Peak load- Cascading blackout
- Price- Routes- Schedules
- Emerging trends - Evolving network- Propagation models- Dynamic migration
- Routing planning
- Shortest path
![Page 12: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/12.jpg)
U.P.S. Embraces High-Tech Delivery Methods (July 12, 2007) By Claudia H. Deutsch
“The research at U.P.S. is paying off. Last year, it cut 28 million miles from truck routes— in good part by mapping routes that minimize left turns.”
Societal economic effect
Many companies incorporate time-dependent traffic data into network dataset.
Speed Profile
Why is it important?
![Page 13: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/13.jpg)
Time dependent routing planning
Minnesota – Austin (TX) Flight Schedule
- Average Delay- Flight time
Total flight time varies with the start time of day
Why is it important?
![Page 14: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/14.jpg)
Why is it challenging?
A static network contains a large amount of information, temporal information further increases the data size
Increased difficulty of rapid data retrieval
NodesEdges
Time points: 10,080(60 mins X 24 hours X 7 days)
10 billion data entries !!
: 1,000,000: 3,000,000
![Page 15: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/15.jpg)
Why is it hard?
The problem is NP hard problem.
The NP hardness of Lagrangian Approaches to Storage of Spatio-temporal Network Datasets follows from a well-known result about the NP-hardness of the balanced min-cut partitioning problem.
![Page 16: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/16.jpg)
Basic Concept (Storage Model)
Spatio-temporal network representation
Time expanded graph
Snapshot model
![Page 17: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/17.jpg)
GetASuccessor(A,C,1) = C3: A1C3
LagGetSuccessors(A,1) = B2, C3: A1B2, A1C3
LagGetPredecessors(D,4) = B2, C3: B2D4, C3D4
LagGetAPredecessor(C,A,3) = A1, A2A1C3, A2C3
1. GetASuccessor()2. GetSuccessors()3. GetPredecessors()4. GetAPredecessor()
Parameter : (source, sink, time)
Parameter : (source, time)
Parameter : (sink, time)
Parameter : (sink, source, time)
Basic Concept (Access Methods)
![Page 18: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/18.jpg)
Related work
ST Storage Model
Orthogonal Approach
Longitudinal Snapshot
LagrangianApproach
![Page 19: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/19.jpg)
ACD : 2 disk IO
Snapshot Approach
![Page 20: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/20.jpg)
ACD : 2 disk IO
Longitudinal Approach
![Page 21: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/21.jpg)
Lagrangian Approach
ACD : 1 disk IO
![Page 22: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/22.jpg)
What is the contribution?
• Proved that the problem is NP hard • Proposed LCP partition approach for the problem.• Proposed I/O cost model.• Experimentally evaluated proposed storage method
and I/O cost model against traditional approaches using real dataset.
![Page 23: Presentation Template KwangSoo Yang Florida Atlantic University College of Engineering & Computer Science](https://reader035.vdocument.in/reader035/viewer/2022062322/5697bfa21a28abf838c95ff6/html5/thumbnails/23.jpg)
What is the validation method?