The search functionality is under construction.

Author Search Result

[Author] Ming CHENG(5hit)

1-5hit
  • A Computer-Based Clinical Teaching-Case System with Emulation of Time Sequence for Medical Education

    Lih-Shyang CHEN  Yuh-Ming CHENG  Sheng-Feng WENG  Chyi-Her LIN  Yong-Kok TAN  

     
    PAPER

      Vol:
    E88-D No:5
      Page(s):
    816-821

    In medical education, many of computerized Problem-Based Learning (PBL) systems are used into their training curricula. But these systems do not truly reflect the situations which practitioners may actually encounter in a real medical environment, and hence their effectiveness as learning tools is somewhat limited. Therefore, the present study analyzes the computerized PBL teaching case, and considers how a clinical teaching case can best be presented to the student. Specifically, this paper attempts to develop a web-based PBL system which emulates the real clinical situation by introducing the concept of a "time sequence" within each teaching case. The proposed system has been installed in the medical center of National Cheng Kung University in Taiwan for testing purposes. The participants in this study were 50 of 5th grade (equivalent to 1st grade students in a medical school of the American medical education system) students for the evaluation process. Some experiments are conducted to verify the advantages of designing teaching cases with the concept of the "time sequence."

  • Weighted Generalized Hesitant Fuzzy Sets and Its Application in Ensemble Learning Open Access

    Haijun ZHOU  Weixiang LI  Ming CHENG  Yuan SUN  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2024/01/22
      Vol:
    E107-D No:5
      Page(s):
    694-703

    Traditional intuitionistic fuzzy sets and hesitant fuzzy sets will lose some information while representing vague information, to avoid this problem, this paper constructs weighted generalized hesitant fuzzy sets by remaining multiple intuitionistic fuzzy values and giving them corresponding weights. For weighted generalized hesitant fuzzy elements in weighted generalized hesitant fuzzy sets, the paper defines some basic operations and proves their operation properties. On this basis, the paper gives the comparison rules of weighted generalized hesitant fuzzy elements and presents two kinds of aggregation operators. As for weighted generalized hesitant fuzzy preference relation, this paper proposes its definition and computing method of its corresponding consistency index. Furthermore, the paper designs an ensemble learning algorithm based on weighted generalized hesitant fuzzy sets, carries out experiments on 6 datasets in UCI database and compares with various classification algorithms. The experiments show that the ensemble learning algorithm based on weighted generalized hesitant fuzzy sets has better performance in all indicators.

  • A New Energy Efficient Clustering Algorithm Based on Routing Spanning Tree for Wireless Sensor Network

    Yating GAO  Guixia KANG  Jianming CHENG  Ningbo ZHANG  

     
    PAPER-Network

      Pubricized:
    2017/05/26
      Vol:
    E100-B No:12
      Page(s):
    2110-2120

    Wireless sensor networks usually deploy sensor nodes with limited energy resources in unattended environments so that people have difficulty in replacing or recharging the depleted devices. In order to balance the energy dissipation and prolong the network lifetime, this paper proposes a routing spanning tree-based clustering algorithm (RSTCA) which uses routing spanning tree to analyze clustering. In this study, the proposed scheme consists of three phases: setup phase, cluster head (CH) selection phase and steady phase. In the setup phase, several clusters are formed by adopting the K-means algorithm to balance network load on the basis of geographic location, which solves the randomness problem in traditional distributed clustering algorithm. Meanwhile, a conditional inter-cluster data traffic routing strategy is created to simplify the networks into subsystems. For the CH selection phase, a novel CH selection method, where CH is selected by a probability based on the residual energy of each node and its estimated next-time energy consumption as a function of distance, is formulated for optimizing the energy dissipation among the nodes in the same cluster. In the steady phase, an effective modification that counters the boundary node problem by adjusting the data traffic routing is designed. Additionally, by the simulation, the construction procedure of routing spanning tree (RST) and the effect of the three phases are presented. Finally, a comparison is made between the RSTCA and the current distributed clustering protocols such as LEACH and LEACH-DT. The results show that RSTCA outperforms other protocols in terms of network lifetime, energy dissipation and coverage ratio.

  • Interference Mitigation in CR-Enabled Heterogeneous Networks Open Access

    Shao-Yu LIEN  Shin-Ming CHENG  Kwang-Cheng CHEN  

     
    INVITED PAPER

      Vol:
    E96-B No:6
      Page(s):
    1230-1242

    The heterogeneous network (HetNet), which deploys small cells such as picocells, femotcells, and relay nodes within macrocell, is regarded as a cost-efficient and energy-efficient approach to resolve increasing demand for data bandwidth and thus has received a lot of attention from research and industry. Since small cells share the same licensed spectrum with macrocells, concurrent transmission induces severe interference, which causes performance degradation, particularly when coordination among small cell base stations (BSs) is infeasible. Given the dense, massive, and unplanned deployment of small cells, mitigating interference in a distributed manner is a challenge and has been explored in recent papers. An efficient and innovative approach is to apply cognitive radio (CR) into HetNet, which enables small cells to sense and to adapt to their surrounding environments. Consequently, stations in each small cell are able to acquire additional information from surrounding environments and opportunistically operate in the spectrum hole, constrained by minimal inducing interference. This paper summarizes and highlights the CR-based interference mitigation approaches in orthogonal frequency division multiple access (OFDMA)-based HetNet networks. With special discussing the role of sensed information at small cells for the interference mitigation, this paper presents the potential cross-layer facilitation of the CR-enable HetNet.

  • A Novel Energy-Efficient Packet Transmission Protocol for Cluster-Based Cooperative Network

    Jianming CHENG  Yating GAO  Leiqin YAN  Hongwen YANG  

     
    PAPER

      Pubricized:
    2018/10/15
      Vol:
    E102-B No:4
      Page(s):
    768-778

    Cooperative communication can reduce energy consumption effectively due to its superior diversity gain. To further prolong network lifetime and improve the energy efficiency, this paper studies energy-efficient packet transmission in wireless ad-hoc networks and proposes a novel cluster-based cooperative packet transmission (CCPT) protocol to mitigate the packet loss and balance the energy consumption of networks. The proposed CCPT protocol first constructs a highly energy-efficient initial routing path based on the required energy cost of non-cooperative transmission. Then an iterative cluster recruitment algorithm is proposed that selects cooperative nodes and organizing them into clusters, which can create transmit diversity in each hop of communication. Finally, a novel two-step cluster-to-cluster cooperative transmission scheme is designed, where all cluster members cooperatively forward the packet to the next-hop cluster. Simulation results show that the CCPT protocol effectively reduces the energy cost and prolongs the network lifetime compared with the previous CwR and noC schemes. The results also have shown that the proposed CCPT protocol outperforms the traditional CwR protocol in terms of transmit efficiency per energy, which indicates that CCPT protocol has achieved a better trade-off between energy and packet arrival ratio.