Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yi-Hsuan Hung

dblp:32/3875 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network optimization and economics · 43% Content delivery and video streaming · 38% Edge and fog computing · 19%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource allocation › market-based resource allocation
auction-based resource allocation
0.412020
Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2020
Content delivery and video streaming
live streaming
0.412020
Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2020
Edge and fog computing
mobile edge computing
0.412020
Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2020
Content delivery and video streaming
quality of experience
0.412020
Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2020
Network optimization and economics
resource allocation
0.412020
Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2020
Network optimization and economics
auction mechanism
0.112020
Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing · IEEE Trans. Mob. Comput. 2020

Methods — techniques the papers use, named apart from their topics

dynamic programming · 0.4combinatorial auction · 0.4
YearPublicationVenuePosition
2026 Energy-optimal lane-change planning for fuel cell electric vehicles
Chi-Chang Huang, Yi-Hsuan Hung
IV2
2021 GRAde: a long-read sequencing approach to efficiently identifying the CYP11B1/CYP11B2 chimeric form in patients with glucocorticoid-remediable aldosteronism
abstract
BACKGROUND: Glucocorticoid-remediable aldosteronism (GRA) is a form of heritable hypertension caused by a chimeric fusion resulting from unequal crossing over between 11β-hydroxylase (CYP11B1) and aldosterone synthase (CYP11B2), which are two genes with similar sequences. Different crossover patterns of the CYP11B1 and CYP11B2 chimeric genes may be associated with a variety of clinical presentations. It is therefore necessary to develop an efficient approach for identifying the differences between the hybrid genes of a patient with GRA. RESULTS: We developed a long-read analysis pipeline named GRAde (GRA deciphering), which utilizes the nonidentical bases in the CYP11B1 and CYP11B2 genomic sequences to identify and visualize the chimeric form. We sequenced the polymerase chain reaction (PCR) products of the CYP11B1/CYP11B2 chimeric gene from 36 patients with GRA using the Nanopore MinION device and analyzed the sequences using GRAde. Crossover events were identified for 30 out of the 36 samples. The crossover sites appeared in the region exhibiting high sequence similarity between CYP11B1 and CYP11B2, and 53.3% of the cases were identified as having a gene conversion in intron 2. More importantly, there were six cases for whom the PCR products indicated a chimeric gene, but the GRAde results revealed no crossover pattern. The crossover regions were further verified by Sanger sequencing analysis. CONCLUSIONS: PCR-based target enrichment followed by long-read sequencing is an efficient and precise approach to dissecting complex genomic regions, such as those involved in GRA mutations, which could be directly applied to clinical diagnosis. The scripts of GRAde are available at https://github.com/hsu-binfo/GRAde .
Yu-Ching Wu, Chia-I Chen, Peng-Ying Chen, Chun-Hung Kuo, Yi-Hsuan Hung, Kang-Yung Peng, Vin-Cent Wu, Jyy-Jih Tsai-Wu, Chia-Lang Hsu
BMC Bioinform.5
2020 Optimizing Social Welfare of Live Video Streaming Services in Mobile Edge Computing
abstract
The live video streaming services have been suffered from the limited backhaul capacity of the cellular core network and occasional congestions due to the cloud-based architecture. Mobile Edge Computing (MEC) brings the services from the centralized cloud to nearby network edge to improve the Quality of Experience (QoE) of cloud services, such as live video streaming services. Nevertheless, the resource at edge devices is still limited and should be allocated economically efficiently. In this paper, we propose Edge Combinatorial Clock Auction (ECCA) and Combinatorial Clock Auction in Stream (CCAS), two auction frameworks to improve the QoE of live video streaming services in the Edge-enabled cellular system. The edge system is the auctioneer who decides the backhaul capacity and caching space allocation and streamers are the bidders who request for the backhaul capacity and caching space to improve the video quality their audiences can watch. There are two key subproblems: the caching space value evaluations and allocations. We show that both problems can be solved by the proposed dynamic programming algorithms. The truth-telling property is guaranteed in both ECCA and CCAS. The simulation results show that the overall system utility can be significantly improved through the proposed system.
Yi-Hsuan Hung, Chih-Yu Wang 0001, Ren-Hung Hwang
IEEE Trans. Mob. Comput.1
2018 Fog micro service market: Promoting fog computing using free market mechanism
abstract
Fog computing is proposed to mitigate cloud micro services, such as IoT gateway or AR data cache, from the centralized cloud to nearby base station (BS) or devices. The mobile users' devices can access service from nearby devices directly through Device to Device (D2D) communications. However, the incentive of devices to provide micro service is a challenge since the devices would spend their storage, computation, and energy resource. In this paper, we propose Fog Micro Service Market Game (FoMG), a game-theoretic framework to promote Fog computing in Fog-enabled cellular system on mobile devices through free market mechanism. The mobile users may decide the micro services they are going to rent (renting strategy) and the price of the services (pricing strategy) freely. The optimal strategy and Nash equilibrium of FoMG are derived through proposed algorithms. The simulation results showed that the overall system utility can be significantly improved through the proposed system.
Yi-Hsuan Hung, Chih-Yu Wang 0001
WCNC1