DVS Scheduling in a Line or a Star Network of Processors

Author(s):  
Zongxu Mu ◽  
Minming Li
Keyword(s):  
Author(s):  
Jong-Seok Kim ◽  
◽  
Hyung Jae Chang ◽  
Keyword(s):  

1988 ◽  
Vol 24 (21) ◽  
pp. 1313 ◽  
Author(s):  
Y.C. Chung ◽  
K.J. Pollock ◽  
P.J. Fitzgerald ◽  
B. Glance ◽  
R.W. Tkach ◽  
...  

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jibing Wu ◽  
Lianfei Yu ◽  
Qun Zhang ◽  
Peiteng Shi ◽  
Lihua Liu ◽  
...  

The heterogeneous information networks are omnipresent in real-world applications, which consist of multiple types of objects with various rich semantic meaningful links among them. Community discovery is an effective method to extract the hidden structures in networks. Usually, heterogeneous information networks are time-evolving, whose objects and links are dynamic and varying gradually. In such time-evolving heterogeneous information networks, community discovery is a challenging topic and quite more difficult than that in traditional static homogeneous information networks. In contrast to communities in traditional approaches, which only contain one type of objects and links, communities in heterogeneous information networks contain multiple types of dynamic objects and links. Recently, some studies focus on dynamic heterogeneous information networks and achieve some satisfactory results. However, they assume that heterogeneous information networks usually follow some simple schemas, such as bityped network and star network schema. In this paper, we propose a multityped community discovery method for time-evolving heterogeneous information networks with general network schemas. A tensor decomposition framework, which integrates tensor CP factorization with a temporal evolution regularization term, is designed to model the multityped communities and address their evolution. Experimental results on both synthetic and real-world datasets demonstrate the efficiency of our framework.


2003 ◽  
Author(s):  
B. Glance ◽  
K.J. Pollock ◽  
P.J. Fitzgerald ◽  
C.A. Burrus ◽  
B.L. Kasper ◽  
...  
Keyword(s):  

Author(s):  
Dao Xuan Uoc

Zigbee wireless network built on IEEE 802.15.4 standard is becoming one of the most popular wireless networks in modern IoT devices. One of the disadvantages of Zigbee networks is the short transmission distance between devices. This paper focuses on researching and comparing routing algorithms in Zigbee networks, thereby building the optimal routing algorithm in the existing system. The paper’s objective is to form the basis for making Zigbee tree and mesh networks, which improves the transmission distance for Zigbee networks better than the star network.


1986 ◽  
Vol 4 (7) ◽  
pp. 755-758 ◽  
Author(s):  
Steven Cheng ◽  
H. Kobrinski ◽  
Liang Wu ◽  
J. Jackel

Sign in / Sign up

Export Citation Format

Share Document