forked from bencentra/centrarium
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathresearch.html
More file actions
executable file
·131 lines (94 loc) · 6.53 KB
/
research.html
File metadata and controls
executable file
·131 lines (94 loc) · 6.53 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
---
layout: page
title: Research
permalink: /research/
---
<h3>2023</h3>
<b>XXXXXXXXX Traffic Reduction XXXXXXXXX</b>
<p>C. J. Roger Lo, anonymous. ACM Flagship conference under review</p>
<h3>2022</h3>
<b>Shrinking City‐Scale Internet Traffic through Optimal Transport Video Recommendation</b>
<p>C. J. Roger Lo. University of Edinburgh</p>
<a href="https://ieeexplore.ieee.org/document/9931951"><b>Information‐Centric Scheduling: Queue Shortening in WSNs via Spatio‐Temporal Compression</b></a>
<p>C. J. Roger Lo, Hung‐Yun Hsieh. SDF'22 Sensor Data Fusion: Trends, Solutions, Applications. This is my first paper done in 2020 after starting a research student career for 14 months!</p>
<h3>2021</h3>
<a href="https://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/ccd=aB9mWc/record?r1=1&h1=1"><b>Optimal Recovery of Correlated Sources in Information‐Centric Wireless Sensor Networks</b></a>
<p>C. J. Roger Lo. National Taiwan University</p>
<b>Optimal Sampling and Scheduling for Multi‐Source Recovery via Age‐of‐Information Minimization</b>
<p>C. J. Roger Lo, Hung‐Yun Hsieh. This paper draft targeting INFOCOM'21 led me into Cambridge.</p>
<!---
<p>This page shows some of my research works.</p>
<h3>Information-Centric Stochastic Network Scheduling</h3>
<p>This research is conducted under the mentorship of my thesis advisor, <a href="https://www.ee.ntu.edu.tw/profile1.php?teacher_id=942014">Prof. Hung-Yun Hsieh</a>.</p>
<p>This work has been submitted to ISIT, which is now under review. The contents in this paper will become the mainframe of my thesis. This work considers "information-centric"
scheduling. We can simply distinguish "information" into three dimensions, that is, the quantity, the quality, and the freshness (information age/delay). In this paper, we contrive
the information quantity by distributed source coding and queue length minimization, and the quality by a newly derived information-theoretic bound and fidelity requirement.
Recently, I'm thinking about adding in a new metric called Age of Information (AoI), which is likely to become the rest of my thesis.</p>
<p style="text-align:center;">
<iframe frameborder="0" scrolling="no" width="640" height="480" src="https://2021.ieee-isit.org/Papers/Uploads/Proposals/PaperNum/2160/2021020492905_781039_2160.pdf" align="middle">
</iframe>
</p>
<br>
<p>We extend the classic Slepian-Wolf-Cover bound and propose an information-theoretic bound that allows compression rate to vary in different scheduling periods. This extension allows
the scheduler to decide and allocate the communication resources period by period, without knowing the statistical information of the sources in advance. Here's its beautiful proof:</p>
<p style="text-align:center;">
<iframe frameborder="0" scrolling="no" width="640" height="480" src="https://tonic.ee.ntu.edu.tw/depot/rogerlo47/extended%20swc_1.pdf" align="middle">
</iframe>
</p>
<br>
<p>We also show the slides for presentation in the following:</p>
<p style="text-align:center;">
<iframe frameborder="0" scrolling="no" width="640" height="480" src="https://tonic.ee.ntu.edu.tw/depot/rogerlo47/information-centric_1.pdf" align="middle">
</iframe>
</p>
<br>
<p>An extended journal version with all proofs and details is written as well. Whereas more evaluations should be added in before submission.</p>
<p style="text-align:center;">
<iframe frameborder="0" scrolling="no" width="640" height="480" src="https://tonic.ee.ntu.edu.tw/depot/rogerlo47/Data_Centric_Paper_25.pdf" align="middle">
</iframe>
</p>
<hr>
<p>I have research experience also in several other fields, and here I show them by a table as follows:</p>
<ul>
<li><b>[Mobile Networks and Wireless Communications Lab, NTU, Prof. Hung-Yun Hsieh]</b></li>
A first author paper was submitted to IEEE ISIT 2021 (now under review), where we focus on stochas- tic network scheduling problems applied to wireless M2M networks and IWSNs in a data-centric regime.
<li><b>[Artificial Intelligence and Multimedia Lab, NTU, Prof. Tsung-Nan Lin]</b></li>
Designed and implemented a software-defined network (SDN) routing policy with meter-based method for enhancing the QoS of video streaming services. Built an intelligent dialogue agent for the front desks.
<li><b>[Data Management and Information Discovery Lab, Academia Sinica, Dr. De-Nian Yang]</b></li>
Conducting research about social IoTs for the surveillance of COVID-19 pandemic, in which we use spatio-temporal Hawkes process for modelling infectious events.
<li><b>[Video and Image Processing Lab, NTU, Prof. Wen-Ming Yan]</b></li>
Presented a paper about determinant, hoping to smooth out its awkward appearance in modern linear algebra. Several new definitions of determinants are also discussed.
<li><b>[Intelligent Vehicle and Mechatronics Lab, NTU, Prof. Kang Li]</b></li>
Applied SLAM (simultaneous localization and mapping) and YOLOv3 (computer vision toolkit) on a automated guided vehicle (AGV). Imported a self-driving bus into NTU.
</ul>
<hr>
<h3>An Intuitive Interpretation of Determinants</h3>
<p>In this research we've tried to define and interpret the concept of matrix determinants in a more intuitive manner. This is a project with Prof. Wen-Ming Yan from the Computer Science and
Information Engineering Department at National Taiwan University.<\p>
<p style="text-align:center;">
<iframe frameborder="0" scrolling="no" width="640" height="480" src="https://tonic.ee.ntu.edu.tw/depot/rogerlo47/Determinant.pdf" align="middle">
</iframe>
</p>
<br>
<h3>Compass and Straightedge Construction on a Sphere</h3>
<p>Assume P as the set of constructible polygons on the plane, and S as the set of constructible polygons on a sphere. In this work we prove that P=S with some properties in spherical
trigonometry and the technique of finite field extension. The proof was all done but hasn't been fully typed out yet. Below are some sketch diagrams made with LaTeX MetaPost.</p>
<p style="text-align:center;">
<iframe frameborder="0" scrolling="no" width="640" height="480" src="https://tonic.ee.ntu.edu.tw/depot/rogerlo47/Sphere.pdf" align="middle">
</iframe>
</p>
<fieldset>
<form>
<h2>Comments and Advices</h2>
<p>If there's any ideas or suggestions, please leave your comments here.</p>
<p><label for="text_field">Title:</label>
<input type="text" id="text_field" /></p>
<p><label for="text_area">Text Area:</label>
<textarea id="text_area"></textarea></p>
<p><label for="file">File Input:</label>
<input type="file" class="file" name="file" />
</p>
<p><input type="submit" value="Submit" /></p>
</form>
</fieldset>
--->