RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

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

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

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • The Implementation of Hydraulics System and Solar Energy in The Tennis Balls Collecting Machine

        Nanthawan Am ?Eam 제어로봇시스템학회 2010 제어로봇시스템학회 국제학술대회 논문집 Vol.2010 No.10

        The purpose of this research is to implement hydraulics system and solar energy in The Tennis Balls Collecting Machine. The machine is operated with power of motor from solar cell energy. The canvas conveying belt is connected to the motor for carrying tennis balls to the basket. Hydraulics system lifts a tennis ball basket for releasing tennis balls to tennis ball keeping basket. The capacity of machine for containing a ball is between 120 to 140 balls and the ability of picking a ball is at the rate of 80 balls per minute depending on the perimeter distance of spread balls. The result of the test of machine operating without solar cell showed that the machine can be operated for 4 hours continuously. In addition to, 4 hour; it can be used with charging battery from electricity. When it is connected a solar cell to the machine, it can be operated uninterruptedly and it is continuously charged by solar cell. In addition, the result of the ergonomics posture assessment tests: Rapid Upper Limb Assessment (RULA) showed that the height and path length of handle are suitable for user.

      • SCIESCOPUSKCI등재

        NEGACYCLIC CODES OF LENGTH 8p<sup>s</sup> OVER F<sub>p</sub><sub>m</sub> + uF<sub>p</sub><sub>m</sub>

        Klin-eam, Chakkrid,Phuto, Jirayu Korean Mathematical Society 2019 대한수학회보 Vol.56 No.6

        Let p be an odd prime. The algebraic structure of all negacyclic codes of length $8_{p^s}$ over the finite commutative chain ring ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8_{p^s}$ over ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ into 5 cases, i.e., $p^m{\equiv}1$ (mod 16), $p^m{\equiv}3$, 11 (mod 16), $p^m{\equiv}5$, 13 (mod 16), $p^m{\equiv}7$, 15 (mod 16) and $p^m{\equiv}9$ (mod 16). From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.

      • KCI등재

        한국에서의 러시아문학 번역현황 조사 및 분석

        엄순천(Eam Sun Cheon) 한국노어노문학회 2005 노어노문학 Vol.17 No.3

        Since 1908 until present, there has been 1564 individual volumes of translated Russian literature published in our country, and the <Bibliography of Russian Literature in Korean Versions> had been completed for individual 9637 works included in these individual volumes. In this thesis, an analysis has been attempted by author, type, translator, period of translation and publisher for the Russian literature that had been translated in Korea based on the bibliography. When we examine the distribution of 1564 individual volumes by types, the fiction had been translated the most with 732 volumes. The next is selected fiction with 447 volumes being translated. So the total of 1,179 volumes of selected fictions has been translated and it takes up 75% of total translated volumes. When individual 9637 books are classified into types (focusing on the modern literature), the poem has been translated the most with 3895 books and 2786 short stories, 1113 long stories, 468 medium length stories, 611 essays, 345 fables, 185 dramas, 153 others and 43 anecdotes had been translated. Here the 4367 fictions had been translated and it takes up 45% of the total translated works. Among the most frequently introduced authors in our country are Tolstoy, Dostoevsky, Turgenev, etc and the Tolstoy's work has been translated the most with 426 volumes, and the next is Dostoevsky with 241 volumes. The last is Turgenev with 142 volumes. The period of time when the Russian literature had been mostly translated was 1970's with 403 volumes being translated. While there was expansion in quantity with Hak Soo Kim, Dong Hyun Lee and Hyung Gyu Park making a considerable contribution to the translation of Russian literature before mid 1980's, there was a leap in quality after the mid 1980's as literal translations were being accomplished by the translators whose major was Russian literature. As stated above, we have examined the translation status of Russian literature in summary. Because the statistics value presented on thesis is incomplete, the growth in the accommodation of Russian literature and its status will be uncovered more obviously if a more complete bibliography on the translation of Russian literature is made. Also, the literal-technical and literal-idealogical effects which Russian authors had contributed to the formation of modern-present literature or the analysis of compared literature should be continuously researched.

      • SCIESCOPUSKCI등재

        REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 2p<sup>s</sup> OVER GALOIS RINGS

        Klin-eam, Chakkrid,Sriwirach, Wateekorn Korean Mathematical Society 2019 대한수학회보 Vol.56 No.1

        In this paper, we consider the structure of ${\gamma}$-constacyclic codes of length $2p^s$ over the Galois ring $GR(p^a,m)$ for any unit ${\gamma}$ of the form ${\xi}_0+p{\xi}_1+p^2z$, where $z{\in}GR(p^a,m)$ and ${\xi}_0$, ${\xi}_1$ are nonzero elements of the set ${\mathcal{T}}(p,m)$. Here ${\mathcal{T}}(p,m)$ denotes a complete set of representatives of the cosets ${\frac{GR(p^a,m)}{pGR(p^a,m)}}={\mathbb{F}}p^m$ in $GR(p^a,m)$. When ${\gamma}$ is not a square, the rings ${\mathcal{R}}_p(a,m,{\gamma})=\frac{GR(p^a,m)[x]}{{\langle}x^2p^s-{\gamma}{\rangle}}$ is a chain ring with maximal ideal ${\langle}x^2-{\delta}{\rangle}$, where ${\delta}p^s={\xi}_0$, and the number of codewords of ${\gamma}$-constacyclic code are provided. Furthermore, the self-orthogonal and self-dual ${\gamma}$-constacyclic codes of length $2p^s$ over $GR(p^a,m)$ are also established. Finally, we determine the Rosenbloom-Tsfasman (RT) distances and weight distributions of all such codes.

      • 포화된 정규압밀 점성토에서 비배수 공극수압의 거동(I) - 등방재하시험에 의한 분석 -

        임성훈 ( Eam Sung Hoon ),이달원 ( Lee Dal Won ) 한국농공학회 2003 韓國農工學會誌 : 전원과 자원 Vol.45 No.4

        The B value on the saturated soil is commonly known as the amount of 1. Usually this concept is consistent with the condition that effective stress is equal to zero, but it was reported in some literatures that the B value was less than 1 in spite of saturated condition in the test of very stiff material such as rock and quasi-stiff material on which the stiffness can be mobilized because of effective stress not equal to zero. In this study the B value was measured on various effective stress conditions on normally consolidated clay. The test results in the B value less than 1 in spite of perfect saturation. The measured excessive pore water pressure was not only smaller than the change of the total stress, but also the function of time on clay.

      • KCI등재

        Negacyclic codes of length $8p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$

        Chakkrid Klin-eam,Jirayu Phuto 대한수학회 2019 대한수학회보 Vol.56 No.6

        Let $p$ be an odd prime. The algebraic structure of all negacyclic codes of length $8p^s$ over the finite commutative chain ring $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ into 5 cases, i.e., $p^m\equiv 1 \pmod{16}$, $p^m\equiv 3,11 \pmod{16}$, $p^m\equiv 5,13 \pmod{16}$, $p^m\equiv 7,15 \pmod{16}$ and $p^m\equiv 9 \pmod{16}$. From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.

      • KCI등재

        Repeated-root constacyclic codes of length $2p^s$ over Galois rings

        Chakkrid Klin-eam,Wateekorn Sriwirach 대한수학회 2019 대한수학회보 Vol.56 No.1

        In this paper, we consider the structure of $\gamma$-constacyclic codes of length $2p^s$ over the Galois ring ${\rm GR}(p^a,m)$ for any unit $\gamma$ of the form $\xi_0+p\xi_1+p^2z$, where $z\in {\rm GR}(p^a,m)$ and $\xi_0, \xi_1$ are nonzero elements of the set $\mathcal{T}(p,m)$. Here $\mathcal{T}(p,m)$ denotes a complete set of representatives of the cosets $\frac{{\rm GR}(p^a,m)}{p{\rm GR}(p^a,m)} = \mathbb{F}_{p^m}$ in ${\rm GR}(p^a,m)$. When $\gamma$ is not a square, the rings $\mathcal{R}_{p}(a,m,\gamma)=\frac{{\rm GR}(p^a,m)[x]}{\langle x^{2p^s}-\gamma\rangle}$ is a chain ring with maximal ideal $\langle x^2-\delta\rangle$, where $\delta^{p^s}=\xi_0$, and the number of codewords of $\gamma$-constacyclic code are provided. Furthermore, the self-orthogonal and self-dual $\gamma$-constacyclic codes of length $2p^s$ over ${\rm GR}(p^a,m)$ are also established. Finally, we determine the Rosenbloom-Tsfasman (RT) distances and weight distributions of all such codes.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼