RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

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

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

      오늘 본 자료

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

        패킷 분류를 위한 이차원 이진 프리픽스 트리

        정여진(Yeojin Jung),김혜란(Hyeran Kim),임혜숙(Hyesook Lim) 한국정보과학회 2005 정보과학회논문지 : 정보통신 Vol.32 No.4

        인터넷은 그 급속한 성장과 더불어 점차 더 나은 서비스를 제공할 것을 요구받게 되었다. 이에 따라 차세대 인터넷 라우터들에서의 지능적인 패킷 분류 기능은 필수 불가결한 것으로 여겨지고 있다. 패킷 분류란 미리 정의된 classifier에 의거하여 입력된 패킷에 매치하는 가장 순위가 높은 룰을 찾는 과정이다. 기존에 나와있는 많은 패킷 분류 검색 구조들이 출발지, 목적지 프리픽스 필드에 기반하여 룰을 추려내는 접근 방법을 사용하고 있다. 그러나 대부분의 검색 구조들은 출발지, 목적지 프리픽스 검색을 위하여 트라이 구조에 바탕을 둔 순차적인 일차원 검색을 따르고 있으며, 매우 큰 메모리를 요구한다는 단점을 가지고 있다. 본 논문에서는 메모리를 매우 효율적으로 사용하면서도 출발지-목적지 프리픽스 쌍에 기반한 이차원 패킷 분류 구조를 제안하고자 한다. 코드워드로 구성된 이진 프리픽스 트리를 구성함으로써, 출발지 프리픽스 검색과 목적지 프리픽스 검색이 하나의 이진 트리를 통해 동시에 가능하도록 하였다. 또한 본 논문에서 제안하는 구조인 이차원 이진 프리픽스 트리는 트리 구조 내부에 비어있는 노드를 포함하고 있지 않으므로 트라이 구조가 가지고 있는 메모리의 비효율성 문제를 완전히 제거하였다. Demand for better services in the Internet has been increasing due to the rapid growth of the Internet, and hence next generation routers are required to perform intelligent packet classification. For a given classifier defining packet attributes or contents, packet classification is the process of identifying the highest priority rule to which a packet conforms. A notable characteristic of real classifiers is that a packet matches only a small number of distinct source-destination prefix pairs. Therefore, a lot of schemes have been proposed to filter rules based on source and destination prefix pairs. However, most of the schemes are based on sequential one-dimensional searches using trie which requires huge memory. In this paper, we proposea memory-efficient two-dimensional search scheme using source and destination prefix pairs. By constructing binary prefix tree, source prefix search and destination prefix search are simultaneously performed in a binary tree. Moreover, the proposed two-dimensional binary prefix tree does not include any empty internal nodes, and hence memory waste of previous trie-based structures is completely eliminated.

      • KCI등재

        허프만 복호화를 위한 균형이진 검색 트리

        김혜란,정여진,임창훈,임혜숙,Kim Hyeran,Jung Yeojin,Yim Changhun,Lim Hyesook 한국통신학회 2005 韓國通信學會論文誌 Vol.30 No.5C

        허프만 코드는 영상이나 비디오 전송뿐만 아니라 여러 분야에서 광범위하게 사용되고 있는 데이터 압축 알고리즘으로서, 실시간 데이터의 양이 증가함에 따라 효율적인 디코딩 알고리즘에 관한 많은 연구가 진행되고 있다. 본 논문에서는 호프만 디코딩을 위해 균형 트리를 형성하여 효율적인 이진 검색을 수행하는 구조를 제안하고 타 구조와의 성능을 비교하였다. 제안하는 구조는 길이가 다른 코드워드 간의 크기 비교를 가능하게 하는 정의를 사용하여 비어있는 내부 노드를 포함하지 않는 완전 균형 트리를 구성하므로, 디코딩 테이블을 위해 필요로 하는 메모리의 크기에 있어 매우 우수한 구조이다. 실제 영상 데이터를 사용하여 실험한 결과, 256개의 심볼 set에 대해 제안하는 구조는 매우 적은 수의 테이블 엔트리를 요구하며, 디코딩 성능은 최소 1번, 최대 5번, 평균 2.41번의 메모리 접근을 소요함을 보았다. Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

      • KCI등재

        폐리튬이온전지로부터 유가금속을 회수하기 위한 암모니아 침출법

        구희숙,정여진,강가희,김송이,김수경,양동효,이강인,손정수,권경중,Ku, Heesuk,Jung, Yeojin,Kang, Ga-hee,Kim, Songlee,Kim, Sookyung,Yang, Donghyo,Rhee, Kangin,Sohn, Jeongsoo,Kwon, Kyungjung 한국자원리싸이클링학회 2015 資源 리싸이클링 Vol.24 No.3

        전기자동차의 수요가 증가함에 따라 리튬이온전지의 생산량도 증가하여 효율적인 전지 재활용 기술이 요구된다. 폐리튬이온전지를 재활용하는 방법에는 크게 건식제련과 습식제련에 기반한 방법으로 나눌 수 있다. 본 연구에서는 하이브리드 자동차에 사용된 폐리튬이온전지의 양극활물질을 습식제련에 기반한 암모니아침출법을 이용하여 활물질 내의 유용금속인 Ni, Mn, Co의 침출거동을 조사하였다. 물리적으로 처리된 활물질의 입자크기는 -65 mesh이며, 주된 원소는 14.0 wt% Ni, 13.0 wt% Mn, 5.7 wt% Co이다. 암모니아, 환원제 (아황산암모늄), pH 완충제 (탄산암모늄 혹은 황산암모늄)의 존재하에 각 금속의 침출거동을 확인하고, 또한 침출시간과 온도에 따른 침출률의 영향도 조사하였다. 환원제의 존재는 Ni과 Co의 침출률 향상을 위해 필수적이다. 암모니아침출법은 산침출법과 달리 Ni/Co와 Mn의 선택적인 침출이 가능하여 침출된 유용금속을 분리하는 단계를 줄일 수 있고, 산침출 후 수반되는 침전과정 시 필요로 하는 추가 염기성 시약의 사용을 줄일 수 있다. Recycling technologies would be required in consideration of increasing demand in lithium ion batteries (LIBs). In this study, the leaching behavior of Ni, Co and Mn is investigated with ammoniacal medium for spent cathode active materials, which are separated from a commercial LIB pack in hybrid electric vehicles. The leaching behavior of each metal is analyzed in the presence of reducing agent and pH buffering agent. The existence of reducing agent is necessary to increase the leaching efficiency of Ni and Co. The leaching of Mn is insignificant even with the existence of reducing agent in contrast to Ni and Co. The most conspicuous difference between acid and ammoniacal leaching would be the selective leaching behavior between Ni/Co and Mn. The ammoniacal leaching can reduce the cost of basic reagent that makes the pH of leachate higher for the precipitation of leached metals in the acid leaching.

      • KCI등재

        수도권과 비수도권 대학생의 주거비 및 주거비 부모 지원 인식과 실태

        유서연(Yu, Seoyeon),정여진(Jung, Yeojin),이세연(Lee, Seyeon),이현정(Lee, Hyun-Jeong) 한국생활과학회 2014 한국생활과학회지 Vol.23 No.6

        The purpose of this study was to explore housing cost burden and financial support from parents to afford housing costs of college students from Capital and non-Capital regions. On-site and on-line questionnaire surveys were conducted to college students between March 3 and April 4, 2014, and total 241 useable responses were collected. Findings are as follow: (1) Jeon-se renters and monthly renters with deposit in Capital region were found to have paid greater housing costs than those in non-Capital region; (2) 86% of Jeon-se renters, 95% of monthly renters with deposit, and 80% of monthly renters without deposits were found to have received parental supports to pay housing costs; (3) respondents in Capital region tended to perceive influence of housing costs on housing choices greater than those in non-Capital region; and (4) more than a quarter of the respondents thought it would be proper to receive parental supports for all expenses until college graduation.

      • KCI등재

        신규시장 성장모형의 모수 추정을 위한 전문가 시스템

        이동원(Dongwon Lee),정재권(Jaekwon Jung),정여진(Yeojin Jung),박도형(Dohyung Park) 한국지능정보시스템학회 2015 지능정보연구 Vol.21 No.4

        Demand forecasting is the activity of estimating the quantity of a product or service that consumers will purchase for a certain period of time. Developing precise forecasting models are considered important since corporates can make strategic decisions on new markets based on future demand estimated by the models. Many studies have developed market growth curve models, such as Bass, Logistic, Gompertz models, which estimate future demand when a market is in its early stage. Among the models, Bass model, which explains the demand from two types of adopters, innovators and imitators, has been widely used in forecasting. Such models require sufficient demand observations to ensure qualified results. In the beginning of a new market, however, observations are not sufficient for the models to precisely estimate the market’s future demand. For this reason, as an alternative, demands guessed from those of most adjacent markets are often used as references in such cases. Reference markets can be those whose products are developed with the same categorical technologies. A market’s demand may be expected to have the similar pattern with that of a reference market in case the adoption pattern of a product in the market is determined mainly by the technology related to the product. However, such processes may not always ensure pleasing results because the similarity between markets depends on intuition and/or experience. There are two major drawbacks that human experts cannot effectively handle in this approach. One is the abundance of candidate reference markets to consider, and the other is the difficulty in calculating the similarity between markets. First, there can be too many markets to consider in selecting reference markets. Mostly, markets in the same category in an industrial hierarchy can be reference markets because they are usually based on the similar technologies. However, markets can be classified into different categories even if they are based on the same generic technologies. Therefore, markets in other categories also need to be considered as potential candidates. Next, even domain experts cannot consistently calculate the similarity between markets with their own qualitative standards. The inconsistency implies missing adjacent reference markets, which may lead to the imprecise estimation of future demand. Even though there are no missing reference markets, the new market’s parameters can be hardly estimated from the reference markets without quantitative standards. For this reason, this study proposes a case-based expert system that helps experts overcome the drawbacks in discovering referential markets. First, this study proposes the use of Euclidean distance measure to calculate the similarity between markets. Based on their similarities, markets are grouped into clusters. Then, missing markets with the characteristics of the cluster are searched for. Potential candidate reference markets are extracted and recommended to users. After the iteration of these steps, definite reference markets are determined according to the user’s selection among those candidates. Then, finally, the new market’s parameters are estimated from the reference markets. For this procedure, two techniques are used in the model. One is clustering data mining technique, and the other content-based filtering of recommender systems. The proposed system implemented with those techniques can determine the most adjacent markets based on whether a user accepts candidate markets. Experiments were conducted to validate the usefulness of the system with five ICT experts involved. In the experiments, the experts were given the list of 16 ICT markets whose parameters to be estimated. For each of the markets, the experts estimated its parameters of growth curve models with intuition at first, and then with the system. The comparison of the experiments results show that the estimated parameters are closer when they use the system in co

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼