RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
        • 주제분류
        • 발행연도
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • SCISCIESCOPUS

        On Fair Resource Sharing in Downlink Coordinated Multi-Point Systems

        Xin Ge,Hu Jin,Julian Cheng,Leung, Victor C. M. IEEE 2016 IEEE communications letters Vol.20 No.6

        <P>An opportunistic scheduling scheme is proposed for the downlink of a coordinated multi-point (CoMP) system, which exploits both spatial multiplexing and multiuser diversity gains while maintaining fair resource sharing among users. The proposed scheduling scheme consists of two steps in each time slot: selecting a base station (BS) at each user, and then selecting a user at each BS. Although the proposed scheme selects users in a distributed manner, the channels among the selected users are proved to be orthogonal when the number of users approaches infinity. Simulation results demonstrate that the proposed scheme yields a better throughput than the existing scheduling schemes designed for fair resource sharing in CoMP systems.</P>

      • Joint User Association and User Scheduling for Load Balancing in Heterogeneous Networks

        Ge, Xin,Li, Xiuhua,Jin, Hu,Cheng, Julian,Leung, Victor C. M. IEEE 2018 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS Vol.17 No.5

        <P>This paper investigates joint user association (UA) and user scheduling (US) for load balancing over the downlink of a wireless heterogeneous network by formulating a network-wide utility maximization problem. In order to efficiently solve the problem, we first approximate the nonconvex throughput achieved with US to a concave function, and demonstrate that the gap for such an approximation approaches zero when the number of users is sufficiently large. Then, by exploiting a distributed convex optimization technique known as <I>alternating direction method of multipliers</I>, a joint UA and US algorithm, which can be implemented on each user’s side and base station (BS)’s side separately, is proposed to obtain the single-BS association and resource allocation solutions. A remarkable feature of the proposed algorithm is that apart from load balancing, multiuser diversity is exploited in the association process to further improve system performance. We also extend the algorithm design to multi-BS association, whereby a user is associated with multiple BSs. The simulation results show the superior performance of the proposed algorithms and underscore the significant benefits of jointly exploiting multiuser diversity and load balancing.</P>

      • SCISCIESCOPUS

        Exploiting Opportunistic Scheduling in Uplink Wiretap Networks

        Ge, Xin,Jin, Hu,Zhu, Jun,Cheng, Julian,Leung, Victor C. M. IEEE 2017 IEEE Transactions on Vehicular Technology VT Vol.66 No.6

        <P>Opportunistic scheduling schemes are investigated for uplink wiretap channels with multiple asymmetrically located legitimate users (LUs) and eavesdroppers. To exploit multiuser diversity, the cumulative distribution function-based scheduling method is leveraged to schedule the transmissions of the LUs. Under this scheduling framework, the closed-form expressions of the secrecy outage probability and ergodic secrecy rate are derived, illustrating the interplay among the system parameters, such as the channel statistics and the number of LUs and eavesdroppers. Through the secrecy outage analysis of the proposed scheduling schemes, we observe that the secrecy throughput is not always maximized with a larger channel access ratio (CAR), and consequently, we design a CAR adjustment scheme to maximize the secrecy throughput while satisfying the required secrecy level. We also prove that under our proposed scheduling schemes, the secrecy diversity order of each LU is equal to the reciprocal of the LU's CAR, implying that full diversity order is achieved, and the ergodic secrecy rate of each LU normalized by its CAR achieves the optimal double-logarithmic growth when the number of LUs increases to infinity.</P>

      • Oncogenic Pathway Combinations Predict Clinical Prognosis in Gastric Cancer

        Ooi, Chia Huey,Ivanova, Tatiana,Wu, Jeanie,Lee, Minghui,Tan, Iain Beehuat,Tao, Jiong,Ward, Lindsay,Koo, Jun Hao,Gopalakrishnan, Veena,Zhu, Yansong,Cheng, Lai Ling,Lee, Julian,Rha, Sun Young,Chung, Hyu Public Library of Science 2009 PLoS genetics Vol.5 No.10

        <▼1><P>Many solid cancers are known to exhibit a high degree of heterogeneity in their deregulation of different oncogenic pathways. We sought to identify major oncogenic pathways in gastric cancer (GC) with significant relationships to patient survival. Using gene expression signatures, we devised an <I>in silico</I> strategy to map patterns of oncogenic pathway activation in 301 primary gastric cancers, the second highest cause of global cancer mortality. We identified three oncogenic pathways (proliferation/stem cell, NF-κB, and Wnt/β-catenin) deregulated in the majority (>70%) of gastric cancers. We functionally validated these pathway predictions in a panel of gastric cancer cell lines. Patient stratification by oncogenic pathway combinations showed reproducible and significant survival differences in multiple cohorts, suggesting that pathway interactions may play an important role in influencing disease behavior. Individual GCs can be successfully taxonomized by oncogenic pathway activity into biologically and clinically relevant subgroups. Predicting pathway activity by expression signatures thus permits the study of multiple cancer-related pathways interacting simultaneously in primary cancers, at a scale not currently achievable by other platforms.</P></▼1><▼2><P><B>Author Summary</B></P><P>Gastric cancer is the second leading cause of global cancer mortality. With current treatments, less than a quarter of patients survive longer than five years after surgery. Individual gastric cancers are highly disparate in their cellular characteristics and responses to standard chemotherapeutic drugs, making gastric cancer a complex disease. Pathway based approaches, rather than single gene studies, may help to unravel this complexity. Here, we make use of a computational approach to identify connections between molecular pathways and cancer profiles. In a large scale study of more than 300 patients, we identified subgroups of gastric cancers distinguishable by their patterns of driving molecular pathways. We show that these identified subgroups are clinically relevant in predicting survival duration and may prove useful in guiding the choice of targeted therapies designed to interfere with these molecular pathways. We also identified specific gastric cancer cell lines mirroring these pathway subgroups, which should facilitate the pre-clinical assessment of responses to targeted therapies in each subgroup.</P></▼2>

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼