User Tools

Site Tools


project:idds:start

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
project:idds:start [2024/02/06 13:35] – [Aim] liangproject:idds:start [2025/02/09 02:19] (current) – old revision restored (2024/06/09 22:03) liang
Line 1: Line 1:
-Last-updated: 2024/02/06, liangz+Last-updated: 2024/06/9, liangz
  
 ====== Project IDDS and more ====== ====== Project IDDS and more ======
  
-members: Javaria, Wenruo, Azam, liangz+members: Javaria, <del>Wenruo,</del> Azam, liangz
  
 ==== Aim ==== ==== Aim ====
Line 17: Line 17:
   * A comprehensive empirical studies (3 months) -> at least a well-known network science conference.   * A comprehensive empirical studies (3 months) -> at least a well-known network science conference.
   * If possible, a theoretical analysis (details to be decided) -> a good network science or math or physical related journal.   * If possible, a theoretical analysis (details to be decided) -> a good network science or math or physical related journal.
 +  * Consider a generalization to integer weights on the edges -> facility allocation problem.
 ==== Tasks ==== ==== Tasks ====
  
-** Wenruo **+**Wenruo **
  
-  * Upload gr files of the networks used in research to the cloud (see the email). +   * Upload gr files of the networks used in research to the cloud (see the email). 
-  * Upload the program and user's manual for generating networks by ER, BA, WS, and LZ models.+  * Upload the program and user's manual for generating networks with ER, BA, WS, and LZ models.
  
-** Javaria **+**Javaria ** 
 + 
 +  * Review those papers that cited the one on Scientific Report. (2024/02/19) {{:project:idds:review_articles_20240219.xlsx|Report}}. 
 +  * Generate artificial networks with various models. 
 +  * Following the same approach as the paper on Scientific Report, analyze those networks to confirm the phenomenon reported. 
 +  * Same approach but with fixed distance k to study the scaling phenomenon with respect to k. 
 +  * Compare the running time of Python and C code implementation of the Sieve algorithm. 
 +  * Check the maximum capacity of Python code to handle the size of networks within a reasonable time (30 mins). 
 +  * Share the memo of tasks and future plans.{{:project:idds:memo.pdf|memo.pdf}} (2024/02/25 19:39 23.2 KB) 
 +  * Studying the scaling behavior size of distance dominating sets with respect to distance, network size, network metrics e.t.c.
  
-  * Analyze those networks by fixing the distance k. 
  
 ==== Archive ==== ==== Archive ====
  
-  * {{ :project:idds:idds2016.tgz |Version 2016}}+  * {{:project:idds:idds2016.tgz|Version 2016}} 
 + 
project/idds/start.1707226552.txt.gz · Last modified: by liang