Now 355 visitors
Today:0 Yesterday:0
Total: 123811
216S 51P 5R
2026-10-21, Week 43 |
| Member Login |
| TACT Journal Homepage |
| Call for Paper |
| Committee |
| Find My Paper |
| Author Homepage |
| Statistics & History |
| Welcome Message |
| Paper Procedure |
| FAQ |
| Paper Archives |
| Outstanding Papers |
| Author Homepage |
| - Paper Procedure |
| - Journal Procedure |
| - Presentation Tips |
|
| Program & Proceedings |
| Program with Papers |
| Plenary Session |
| Tutorial Session |
|
| Presentation Platform |
| Hotel & Travel Info |
| About Korea |
| Accommodation |
| Transportation |
| VISA |
| Other Infomation |
|
| Photo Gallery |
| Scheduler Login |
| Seminar |
| Archives Login |
|
| Sponsors |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Save Q&A |
 |
* Edit or answer any Q&A by selecting Q&A number Hyper Link below + Write button (Save)
|
ICACT20230191 Question.1
Questioner: franklinlu888@outlook.com 2023-02-24 오전 10:41:21 |
ICACT20230191 Answer.1
Answer by Auhor fengyi12@chinaunicom.cn 2023-02-24 오전 10:41:21
Chrome  Click!! |
| Hi, because I am the chair of this session, may I ask a question about the algorithm on Slide.09? Will the results be different if the sequence of the deleted elements is changed? |
Thanks for your question. Yes, some results will be different if the sequence of the deleted elements is changed. Because it is chosen randomly and then will be deleted. We have performed some related simulations and found that little differences can be found. But the advantage of this algorithm lies in the simplicity and efficiency. |
ICACT20230191 Question.2
Questioner: franklinlu888@outlook.com 2023-02-24 오전 10:44:04 |
ICACT20230191 Answer.2
Answer by Auhor fengyi12@chinaunicom.cn 2023-02-24 오전 10:44:04
Chrome Click!! |
| Thanks to the speaker and audience. We enjoyed a wonderful QA time. I am the chair of the session, Bing-Yuh Lu, and see you next time! |
Thank you very much. It is my great honor that our paper was accepted by the ICACT and we really enjoyed the virtual conference attendance. |
ICACT20230191 Question.3
Questioner: daniel379@hanyang.ac.kr 2023-02-24 오전 10:48:10 |
ICACT20230191 Answer.3
Answer by Auhor fengyi12@chinaunicom.cn 2023-02-24 오전 10:48:10
Chrome Click!! |
| First of all, I took a good look at the contents of the paper.
You suggested a novel density heuristic algorithm.
Please briefly explain if there is an existing density heuristic algorithm here, and if so, what it is.
Thank you
|
Thank you for your question. Yes, there is an existing density heuristic algorithm. For instance, the authors in [4] proposed a density-based RSU deployment policy, specially designed to obtain an efficient system with the lowest possible cost to alert emergency services in case of an accident. Their approach is based on deploying RSUs using an inverse proportion to the expected density of vehicles. The obtained results proved that the proposed algorithm is able to reduce the required number of RSUs, as well as the accident notification time.
[4] J. Barrachina et al., "Road Side Unit Deployment: A Density-Based Approach," in IEEE Intelligent Transportation Systems Magazine, vol. 5, no. 3, pp. 30-39, Fall 2013, doi: 10.1109/MITS.2013.2253159. |
| |
