RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

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

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

      오늘 본 자료

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

        Final report on force key comparison CCM.F-K2.a and CCM.F-K2.b (50 kN and 100 kN)

        Vincke, William,Zhimin, Zhang,Pusa, Aimo,Averlant, Philippe,Kumme, Rolf,Germak, Alessandro,Ueda, Kazunaga,Park, Yon-Kyu,Torres, Jorge,Burke, Ben,Langmead, Fredrik,Fank, Sinan,Knott, Andy,Bartel, Tom Springer-Verlag 2012 METROLOGIA -BERLIN- Vol.49 No.-

        <P>This report describes CIPM key comparison CCM.F-K2, a comparison between the deadweight force standard machines of fourteen National Measurement Institutes, at generated forces of 50 kN and 100 kN, in the period from 2004 to 2007. Two different measurement schemes were employed, one for machines capable of generating both 50 kN and 100 kN and the other using the single force of 50 kN, for machines of a lower maximum capacity than 100 kN. Multiple transducers were used and the force–time profile was strictly controlled, to minimize effects of creep. Analysis of the results took careful account of the drift of the transducers' sensitivities throughout the comparison period, as this was one of the major uncertainty contributions. The final results suggest that the nominal 50 kN forces generated at four of the fourteen laboratories (and the 100 kN forces at two of them) may be statistically significantly different from the same nominal forces generated at the other laboratories.</P><P>Main text.To reach the main text of this paper, click on Final Report. Note that this text is that which appears in Appendix B of the BIPM key comparison database kcdb.bipm.org/.</P><P>The final report has been peer-reviewed and approved for publication by the CCM, according to the provisions of the CIPM Mutual Recognition Arrangement (CIPM MRA).</P>

      • SCISCIESCOPUS

        4-Ary Codebook Design Using Reed–Muller Codes for MIMO Beamforming Systems

        Young Gil Kim,Han Vinck, A. J. IEEE 2016 IEEE Transactions on Vehicular Technology VT Vol.65 No.2

        <P>We design 4-ary codebooks using Reed-Muller codes for multiple-input-multiple-output (MIMO) beamforming systems. An upper-bound on the maximum correlation magnitude metric of a 4-ary codebook is derived from the minimum Hamming distance of the corresponding binary linear block code. The 4-ary MIMO beamforming codebooks for the number of transmit antennas equal to 4, 8, 16, and 32 are tabulated. We show that the 4-ary codebook using Reed-Muller codes provides the same symbol error probability (SEP) as the Long-Term Evolution (LTE) codebook when the number of transmit antennas is 4 and when the number of feedback bits is 4.</P>

      • SCISCIESCOPUS

        Anticollision Algorithms for FM0 Code and Miller Subcarrier Sequence in RFID Applications

        Kim, Young Gil,Vinck, A. J. Han IEEE 2018 IEEE Transactions on Vehicular Technology VT Vol.67 No.6

        <P>We propose anticollision algorithms using bit collision detection for FM0 code and Miller subcarrier sequence in Radio Frequency Identification (RFID) applications. We present Mealy machine representations of FM0 code and Miller subcarrier sequence. The performance of the anticollision algorithm using bit collision detection for Miller subcarrier sequence is the same as that for FM0 code. We show that the throughput of the bit collision detection algorithms for FM0 code and Miller subcarrier sequence is 0.5 while the throughput of the conventional binary tree algorithm, which is used for ISO 18000-6B RFID standard, is 0.35.</P>

      • KCI등재

        Capacity-Equivocation Region of a Special Case of Wiretap Channel with Noiseless Feedback

        Bin Dai,A. J. Han Vinck,Yuan Luo,Zheng Ma 한국통신학회 2015 Journal of communications and networks Vol.17 No.1

        The general wiretap channel with noiseless feedback is first investigated by Ahlswede and Cai, where lower and upper bounds on the secrecy capacity are provided in their work. The upper bound is met with equality only in some special cases. In this paper, we study a special case of the general wiretap channel with noiseless feedback (called non-degraded wiretap channel with noiseless feedback). Inner and outer bounds on the capacityequivocation region of this special model are provided. The outer bound is achievable if the main channel is more capable than the wiretap channel. The inner bound is constructed especially for the case that the wiretap channel is more capable than the main channel. The results of this paper are further explained via binary and Gaussian examples. Compared with the capacity results for the non-degraded wiretap channel, we find that the security is enhanced by using the noiseless feedback.

      • KCI등재

        Relay Selection in Cooperative Power Line Communication: A Multi-Armed Bandit Approach

        Babak Nikfar,A. J. Han Vinck 한국통신학회 2017 Journal of communications and networks Vol.19 No.1

        Power line communication (PLC) exploits the existence ofinstalled infrastructure of power delivery system, in order to trans-mit data over power lines. In PLC networks, different nodes of thenetwork are interconnected via power delivery transmission lines,and the data signal is flowing between them. However, the attenu-ation and the harsh environment of the power line communicationchannels, makes it difficult to establish a reliable communicationbetween two nodes of the network which are separated by a longdistance. Relaying and cooperative communication has been usedto overcome this problem. In this paper a two-hop cooperative PLChas been studied, where the data is communicated between a trans-mitter and a receiver node, through a single array node which hasto be selected from a set of available arrays. The relay selectionproblemcan be solved by having channel state information (CSI) attransmitter and selecting the relay which results in the best perfor-mance. However, acquiring the channel state information at trans-mitter increases the complexity of the communication system andintroduces undesired overhead to the system. We propose a classof machine learning schemes, namely multi-armed bandit (MAB),to solve the relay selection problem without the knowledge of thechannel at the transmitter. Furthermore, we develop a new MABalgorithm which exploits the periodicity of the synchronous impul-sive noise of the PLC channel, in order to improve the relay selec-tion algorithm.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼