The search functionality is under construction.

Author Search Result

[Author] Lisheng MA(2hit)

1-2hit
  • Highly Efficient and Vivid-Red Phosphors Bearing 2,3-Diphenylquinoxaline Units and Their Application to Organic Light-Emitting Devices

    Hiroyuki FUJII  Hidehiro SAKURAI  Kazuyasu TANI  Lisheng MAO  Kenichiro WAKISAKA  Toshikazu HIRAO  

     
    LETTER-Characterization of Organic Devices

      Vol:
    E87-C No:12
      Page(s):
    2119-2121

    Newly designed cyclometalated iridium phosphors bearing 2,3-diphenylquinoxalines were characterized to provide highly efficient and vivid-red emitting materials for electrophosphorescent organic light-emitting devices. Excellent quantum efficiencies for photoluminescence (PL) within a range 50-79% were observed in dichloromethane solutions at room temperature. A greatly improved PL decay lifetime of 1.1 µsec was also observed in CBP coevaporated film. Luminescence peak wavelengths of the phosphors lay within a preferable range 653-675 nm in evaporated films. The most vivid-red electroluminescence with 1931 CIE chromaticity coordinates of (x=0.70, y=0.28) was successfully attained.

  • A Generalized Data Uploading Scheme for D2D-Enhanced Cellular Networks

    Xiaolan LIU  Lisheng MA  Xiaohong JIANG  

     
    PAPER-Network

      Pubricized:
    2019/03/22
      Vol:
    E102-B No:9
      Page(s):
    1914-1923

    This paper investigates data uploading in cellular networks with the consideration of device-to-device (D2D) communications. A generalized data uploading scheme is proposed by leveraging D2D cooperation among the devices to reduce the data uploading time. In this scheme, we extend the conventional schemes on cooperative D2D data uploading for cellular networks to a more general case, which considers D2D cooperation among both the devices with or without uploading data. To motivate D2D cooperation among all available devices, we organize the devices within communication range by offering them rewards to construct multi-hop D2D chains for data uploading. Specifically, we formulate the problem of chain formation among the devices for data uploading as a coalitional game. Based on merge-and-split rules, we develop a coalition formation algorithm to obtain the solution for the formulated coalitional game with convergence on a stable coalitional structure. Finally, extensive numerical results show the effectiveness of our proposed scheme in reducing the average data uploading time.