project:idds:start
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
project:idds:start [2024/02/06 13:35] – [Aim] liang | project:idds:start [2025/02/09 02:19] (current) – old revision restored (2024/06/09 22:03) liang | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | Last-updated: | + | Last-updated: |
====== Project IDDS and more ====== | ====== Project IDDS and more ====== | ||
- | members: Javaria, Wenruo, Azam, liangz | + | members: Javaria, |
==== 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 the program and user's manual for generating networks | + | * Upload the program and user's manual for generating networks |
- | ** Javaria ** | + | **Javaria ** |
+ | |||
+ | * Review those papers that cited the one on Scientific Report. (2024/ | ||
+ | * 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.{{: | ||
+ | * 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/start.1707226552.txt.gz · Last modified: by liang