De-Nian Yang

Dr. De-Nian Yang

Academia Sinica, Taipei, Taiwan

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 December 2017 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HSHong-Han Shuai
Hong-Han Shuai
CSChih-Ya Shen
Chih-Ya Shen
DYDe-Nian Yang
De-Nian Yang
YLYi-Feng Carol Lan
Yi-Feng Carol Lan
WLWang-Chien Lee
Wang-Chien Lee
MCMing-Syan Chen
Ming-Syan Chen
The explosive growth in popularity of social networking leads to the problematic usage. An increasing number of social network mental disorders (SNMDs), such as Cyber-Relationship Addiction, Information Overload, and Net Compulsion, have been recently noted. Symptoms of these mental disorders are usually observed passively today, resulting in delayed clinical intervention. In this paper, we argue that mining online social behavior provides an opportunity to actively identify SNMDs at an early stage. It is challenging to detect SNMDs because the mental status cannot be directly observed from online social activity logs. Our approach, new and innovative to the practice of SNMD detection, does not rely on self-revealing of those mental factors via questionnaires in Psychology. Instead, we propose a machine learning framework, namely, Social Network Mental Disorder Detection (SNMDD), that exploits features extracted from social network data to accurately identify potential cases of SNMDs. We also exploit multi-source learning in SNMDD and propose a new SNMD-based Tensor Model (STM) to improve the accuracy. To increase the scalability of STM, we further improve the efficiency with performance guarantee. Our framework is evaluated via a user study with 3,126 online social network users. We conduct a feature analysis, and also apply SNMDD on large-scale datasets and analyze the characteristics of the three SNMD types. The results manifest that SNMDD is promising for identifying online social network users with potential SNMDs.

1 May 2017
Verified
Conference Paper
Closed access
JKJian-Jhih Kuo
Jian-Jhih Kuo
SSShan-Hsiang Shen
Shan-Hsiang Shen
HKHong-Yu Kang
Hong-Yu Kang
DYDe-Nian Yang
De-Nian Yang
MTMing-Jer Tsai
Ming-Jer Tsai
WCWen-Tsuen Chen
Wen-Tsuen Chen
With software-defined network (SDN) and network function virtualization (NFV) techniques, we can embed the service chain consisting of a sequence of virtualized network functions (VNFs), i.e., we can determine the flow path and deploy the VNFs contained in the service chain at any place on the path. In the literature, the methods of service chain embedding bound the number of VNFs at a node, whereas the link capacities are disregarded and the amount of flows is not considered, which could cause serious congestion. In addition, according to our experiment, the process overhead on a computation node is linear to the total amount of flows processed. In this paper, we propose a method of service chain embedding to maximize the total amount of flows while bounding the process overhead of the flows on a node by its computation capability and the total amount of flows on an link by its bandwidth capacity. To our knowledge, our method is the first approximation algorithm of service chain embedding with considering flow in the literature. Simulations show our algorithm has good performance in terms of the total amount of flows.

20 August 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CWChih-Hang Wang
Chih-Hang Wang
JKJian-Jhih Kuo
Jian-Jhih Kuo
DYDe-Nian Yang
De-Nian Yang
WCWen-Tsuen Chen
Wen-Tsuen Chen
Artificial Intelligence (AI) on chips has recently driven the expansion of Social Internet of Things (SIoT), where a group of SIoT devices with social relations can collaboratively identify and handle local events without the help of remote servers. On the other hand, Mobile Edge Computing (MEC) is a favorable way to locally process SIoT data for reducing data transmission and computation among SIoT devices and backhaul networks. Nevertheless, the load sharing among SIoT devices, MEC, and remote servers brings about new challenges for the communication and computation trade-off, cross-layer design in SIoT, and forwarding and aggregation trade-off. To tackle these issues, we formulate a new optimization problem, namely SIoT Collaborative Group and Device Selection Problem (SCGDSP), and prove the NP-hardness. We first explore the intrinsic properties of a fundamental SCGDSP case by finding the optimal collaborative group for each user request. Then, we design an approximation algorithm for the general SCGDSP that first evaluates candidate collaborative groups under different social relations, and then selects the collaborative groups and SIoT devices properly. For scalability, the proposed algorithm also supports dynamic user requests and can be distributionally deployed in massive networks enabling collaborative MEC. Moreover, it also sustains local SIoT services, where the computation only involves SIoT devices and MEC servers. Simulation results demonstrate that ESCGS can reduce by more than 50% of the total communication and computation costs compared with baseline schemes in the real networks from topology zoo. Moreover, the distributed ESCGS reduces by 87% of the running time with total 16.5MB message overhead, requiring no more than 0.05ms transmission delay in a 100Gbps backbone networks with 8 MEC servers, 1000 SIoTs, and 800 monitored locations.

11 July 2017 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HHHui-Ju Hung
Hui-Ju Hung
THTing-Yu Ho
Ting-Yu Ho
SLShi-Yong Lee
Shi-Yong Lee
CYChun-Yuan Yang
Chun-Yuan Yang
DYDe-Nian Yang
De-Nian Yang
With the advance of the photovoltaic panel technology, the infrastructure equipment of cellular networks with solar energy sources has attracted extensive interests. It is expected that base stations (BSs) and relay stations (RSs) with renewable energy will play important roles in reducing the power consumption from electrical grids in future green cellular networks. Inspired by this technology trend, this paper considers a heterogeneous green cellular network, in which a part of RSs are powered by solar energy sources to represent the incremental deployment for the infrastructure with renewable energy in the near future. We formulate a new relay selection and power allocation problem with Mixed Integer Linear Programming to select solar-powered RSs and grid-powered RSs, such that the total grid power consumption is effectively minimized in decode-and-forward cooperative communications networks. We design an algorithm to derive the optimal solution, and also devise an efficient distributed algorithm to reduce the computational cost. The simulation results demonstrate that the algorithms can effectively reduce the total grid power consumption with different channel conditions, different deployments of RSs in a network, and different available power levels in solar-powered RSs. In addition, the problem model and proposed algorithms can be extended to support hybrid energy sources.

15 December 2022 in Physics Reports
Verified
Journal Article
Open access
ASAnton P.J. Stampfl
Anton P.J. Stampfl
ZLZhongdong Liu
Zhongdong Liu
JHJun Hu
Jun Hu
KSKei Sawada
Kei Sawada
HTHidekazu Takano
Hidekazu Takano
GMGiorgio Margaritondo
Giorgio Margaritondo

23 May 2017 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JLJi-Tang Lee
Ji-Tang Lee
DYDe-Nian Yang
De-Nian Yang
YCYu-Chun Chen
Yu-Chun Chen
WLWanjiun Liao
Wanjiun Liao
With the recent emergence of naked-eye 3D mobile devices and various 3D-enabled laptops, service providers now afford the opportunity to provide mobile 3D video streaming in LTE-Advanced networks. Differing from traditional single-view 3D videos, multi-view 3D videos allow users to choose preferred view angles and thus are promising for new applications, such as free-viewpoint television (FTV). Nevertheless, enabling multi-view 3D video services may overwhelm the network resource when transmitting all views of every video. Fortunately, Depth-Image-Based Rendering (DIBR) allows each mobile client to synthesize the desired view from a nearby left view and right view, so that not all views of a video are necessarily transmitted. A new challenge with DIBR, however, is to carefully choose the transmitted views to limit the video distortion and minimize the bandwidth consumption. In this paper, therefore, we first formulate a new optimization problem, called View and MCS Selection (VMS) Problem, to minimize the bandwidth consumption for multi-view 3D video multicast in LTE networks. An algorithm, called View and MCS Aggregation (VMAG) is proposed to find the optimal solution to VMS. For Carrier Aggregation (CA) in LTE-Advanced networks, we formulate a new View, MCS and Carrier Selection (VMCS) Problem and prove that the problem is NP-Hard. We first design a dynamic programming algorithm, called the View Assignment with MCS and Carrier (VAMC) algorithm, to find the optimal solution for small instances. We then propose the View and MCS Aggregation with Carrier (VMAGC) algorithm based on VMAG to effectively find the near-optimal solution to VMCS. The simulation results show that bandwidth consumption can be effectively reduced by over 30 percent in VMS and VMCS.