跳至主導覽
跳至搜尋
跳過主要內容
國立陽明交通大學研發優勢分析平台 首頁
English
中文
首頁
人員
單位
研究成果
計畫
獎項
活動
貴重儀器
影響
按專業知識、姓名或所屬機構搜尋
查看斯高帕斯 (Scopus) 概要
陳 秋媛
教授
應用數學系
電話
03-5712121#31767
電子郵件
cychen
nycu.edu
tw
網站
http://www.math.nctu.edu.tw/faculty/faculty_content.php?S_ID=20&SC_ID=1
h-index
h10-index
h5-index
356
引文
12
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
42
引文
4
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
20
引文
3
h-指數
按照存儲在普爾（Pure）的出版物數量及斯高帕斯（Scopus）引文計算。
1987 …
2023
每年研究成果
概覽
指紋
網路
計畫
(22)
研究成果
(37)
類似的個人檔案
(2)
指紋
查看啟用 Chiuyuan Chen 的研究主題。這些主題標籤來自此人的作品。共同形成了獨特的指紋。
排序方式
重量
按字母排序
Keyphrases
Shuffle-exchange Network
100%
Double-loop Networks
82%
L-shaped
65%
Routing Algorithm
60%
All-to-all
60%
Locally Twisted Cubes
55%
Multistage Interconnection Networks
52%
Wireless Sensor Networks
50%
Control Tag
49%
Hypercube
48%
Minimal Dominating Set
40%
Visibility Graph
40%
Sensor Deployment
40%
Tag-based Routing
40%
Independent Spanning Trees
40%
HyPer
40%
Self-stabilizing Algorithm
40%
Triple-loop Networks
40%
Radio
40%
Internet of Healthcare Things (IoHT)
40%
Wake-up
40%
Exchange Algorithm
32%
Interconnection Networks
31%
Stage number
30%
Simple Polygon
30%
Linear Time
30%
Receiver-initiated
30%
Probabilistic Sensing Model
27%
Precomputation
27%
Minimum Distance Diagram
27%
Maximal Planar Graph
25%
Domination in Graphs
25%
Minimum number
25%
Polygon
25%
Hashing
25%
Dominating Set Problem
24%
DEMON
24%
Backward Control
23%
Free Data
23%
Collision-free
23%
Banyan Network
22%
Node number
22%
SIMPLE Algorithm
22%
Efficient Routing
22%
Bistatic Radar
20%
Minimum Cost Placement
20%
Multiplicative Graph
20%
Capacity Function
20%
Graph Functions
20%
Barrier Coverage
20%
Mathematics
Edge
70%
Hypercube
65%
Dominating Set
60%
Cube
60%
Exchange Algorithm
50%
Triangle
45%
Necessary and Sufficient Condition
40%
Spanning Tree
40%
Wireless Sensor Network
40%
Simple Polygon
40%
Necessary Condition
40%
Linear Time
30%
Maximal Planar Graphs
30%
Lower and upper bounds
20%
Graph Model
20%
Arboricity
20%
Multiplicative
20%
Algebraic Operation
20%
Strongly chordal graphs
20%
Modular Exponentiation
20%
Infinite Number
20%
Polygon
20%
Minimality
20%
Latin Square
20%
Interval Graph
20%
Partition Coefficient
20%
Secondary Schools
20%
Optimal Partition Problem
20%
Partition Function
20%
Seminal Paper
20%
Great Deal
20%
Sensor Node
16%
Spiral Polygon
15%
Planar Graph
15%
Clique
15%
Intersects
15%
Initial State
13%
Finite Time
13%
Distributed Systems
13%
Detection Probability
12%
Cardinality
10%
Stable Set
10%
Local Area
10%
Line Segment
10%
Hamiltonian Cycle
8%
Connected Graph
7%
Number System
6%
Arbitrary Vertex
5%
Even number
5%
Intersection Graph
5%
Computer Science
Exchange Network
100%
Routing Algorithm
60%
Wireless Sensor Network
50%
multistage interconnection network
49%
Internet of Things Device
40%
Distributed System
40%
Precomputation
33%
Hashing
30%
Explicit Formula
22%
Wireless Sensor
20%
Contact Frequency
20%
Called Operation
20%
Sensor Deployment
20%
Multiple Partition
20%
Free Transmission
20%
fault-tolerance
20%
Infinite Number
20%
Lower Energy Consumption
20%
Data Collector
20%
Energy Efficient
20%
Internet-Of-Things
20%
Secondary Schools
20%
Interconnection Network
20%
Wireless Network
20%
Graph Theory
20%
Local Area Network
20%
Network Topology
18%
Optimal Algorithm
16%
Hypercube
14%
Memory Allocation
13%
Detection Probability
12%
Sensor Node
12%
Forward Control
10%
Energy Saving
10%
Coverage Area
10%
Number System
10%
Hash Function
10%
Parallel Processing
6%
Forward Networks
5%
Communication Delay
5%
