RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      검색결과 좁혀 보기

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

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

      오늘 본 자료

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

        학교운동장 녹화를 위한 야생초 활용방안

        김송아,이광우,심우경 韓國植物ㆍ人間ㆍ環境學會 2001 인간식물환경학회지 Vol.4 No.3

        The school ground with meadows provides the biotope ecologically, reduces environmental pollution, decreases almost twenty-six times maintenance expenses compared with lawn ground and creates esthetically high value compared with school naked ground. This research showed that the good lawn ground condition was 10, the common 6, the bad 7 in 23 among 131 school lawn grounds that were surveyed. For the proper wildflower selection, Yong-San Family Park, lawn grounds of Government Buildings Management, the baseball ground of Kun-Guk University were investigated. By using these data, total 9 families, 15 species could be introduced into school grounds for the meadow as appeared in the elementary school textbooks. The total ground might not be consisted of complete wildflower meadows but there existed partial naked ground. The weed species of wildflower meadows in the school ground had tolerance with foot path and nearly all weed species could be survived. For further research, the study on the tolerance of wildflowers with foot path should be followed.

      • 접속어미의 통어론적 특징 : 15세기 국어의 접속월을 중심으로

        金頌元 건국대학교 부설 중원인문연구소 1990 論文集 Vol.9 No.-

        This study is attempted to make a systematic description of the connective sentence constructions in the 15th centuri's Korean by comprehensive analysis of connective endings. The connective sentences are connected by the various connective endings. On the basis of the meaning relations of the antecedent and consequent clause, the Connective sentences are classified. This study deals with the syntactic constraints on the connective sentences with regard to Mood. The following are some remarkable achievements that have been made in this study. (1) The system of the connective sentences and the classification of the connective endings are as follows. 1. Linking relation endings: ① -고(곡, 옥, 구), ② -으며, ③ -니와(거니와/어니와/가니와), ④ -??, ⑤ -아/어(거아/거어), ⑥ -디, ⑦ ??/들(드란), 2. Relative relation endings: ① -으나, ② -어도/아도(라도/나도), ③ -고도/오도, ④ -??, ⑤ -??, ⑥ -??(디위/디외/디웨), ⑦ -??, ⑧ -??, ⑨ -??, ⑩ -으니, ⑪ -고, ⑫ -으며, 3. Cause-Result Relation endings: ① -으니, ② -??, ③ -아/어(악/억, 거/어), ④ -라, 4. Appreciable relation endings: ① -??/??(??) 5. Conditional relation endings: ① -으면, ② 은대(??), ③ -은댄(은덴, ??, 은든, ??, 단, 든), ④ -??, ⑤ -을덴(뎐), ⑥ -??/늘, ⑦ -??(??), 6. Intentional relation endings: ① -고져/오져, ② -과뎌(??), ③ -굇고(엣고/겟고/�T고), ④ -으려, ⑤ -사, ⑥ -옷, ⑦ -곳디, ⑧ -가, 7. Resultative relation endings: ① -??(애), -도록, ② -게/에(긔/의, ??/??, -거), 8. Selective relation endings: ① -으나, 9. Purposive relation endings: ① -으라, 10. Repeating relation endings: ① -으락, ② -암/엄, 11. Simultaneous relation endings: ① -다가며, 12. Proportional relation endings: ① -디옷, ② -??, 13. Emphasis relation endings: ① -나, ② -도, 14. Value relation endings: ① -암직/엄직, ② -어만, 15. Comparative relation endings: ① -곤/온, ② -노니, 16. Simulative relation endings: ① -??/듯(덧), -다시, -드시, -디시, 17. Convertive relation endings: ① -다가/라가, ② -으나, (2) The syntactic constraints on the connective sentence with regard to Mood-Declarative, Interrogative Imperative, and propositive Mood are described as Table 56(Page 56) in Chapter II or III.

      • 저농도 질소시비가 배나무 실생묘의 생육과 수체내 질소함량에 미치는 영향

        김송,오성도,최동근 전북대학교 농업과학기술연구소 2002 農大論文集 Vol.33 No.1

        Seedlings of 'Niitaka' cultivar in Japanese pear were supplied with nutrient solution at pH 6.5 with four level of nitrogen concentration (33, 50 100, and 200 mg․L^-1) in a sand culture. Fresh weight and plant height were increased with increasing concentration of nitrogen supply. Total nitrogen and reduced nitrogen in most of organs were also increased with increasing concentration of nitrogen supply. Increasing nitrogen supply decreased the content of nitrate nitrogen in leaves and stems, but that of increase in roots. The in vivo-NO_3^- nitrate reductase activity(NRA) of leaves and stems were not detected when the seedlings grown in low concentration of nitrogen than 200mg․L^-1, but increasing nitrogen supply increased in vivo - NO_3^- NRA of roots. The in vivo + NO_3^- NRA in all organs were increased with increasing nitrogen supply. In NRA of each organs, it in the leaves was the highest and in the root was higher than in the shoot. It could be therefore recommended that nitrogen should be supplied with around 200mg․L^-1 in Japanese pear trees.

      • KCI등재

        A PROPOSAL ON ALTERNATIVE SAMPLING-BASED MODELING METHOD OF SPHERICAL PARTICLES IN STOCHASTIC MEDIA FOR MONTE CARLO SIMULATION

        김송,이재용,김도현,김종경,노재만 한국원자력학회 2015 Nuclear Engineering and Technology Vol.47 No.5

        Chord length sampling method in Monte Carlo simulations is a method used to modelspherical particles with random sampling technique in a stochastic media. It has receivedattention due to the high calculation efficiency as well as user convenience; however, atechnical issue regarding boundary effect has been noted. In this study, after analyzing thedistribution characteristics of spherical particles using an explicit method, an alternativechord length sampling method is proposed. In addition, for modeling in finite media, acorrection method of the boundary effect is proposed. Using the proposed method, sampleprobability distributions and relative errors were estimated and compared with thosecalculated by the explicit method. The results show that the reconstruction ability andmodeling accuracy of the particle probability distribution with the proposed method wereconsiderably high. Also, from the local packing fraction results, the proposed method cansuccessfully solve the boundary effect problem. It is expected that the proposed methodcan contribute to the increasing of the modeling accuracy in stochastic media.

      • KCI등재

        F-Index: 빠른 부분그래프 매칭을 위한 특징 인덱스

        김송현(Song-Hyon Kim),송인철(Inchul Song),이윤준(Yoon-Joon Lee) 한국정보과학회 2013 정보과학회논문지 : 데이타베이스 Vol.40 No.1

        본 논문에서는 대규모 데이터베이스 그래프에서 주어진 질의 그래프와 동형인 모든 부분그래프들을 찾는 부분그래프 문제를 다룬다. 최근 빠른 부분그래프 매칭을 위해서 특징 인덱스를 기반으로 하는 기법들이 제안되었다. 이 기법들은 데이터베이스 그래프 정점들과 질의 그래프 정점들을 정점 특징을 사용하여 비교한 후 부분그래프 매칭 작업에서 고려할 필요가 없는 데이터베이스 그래프 상의 정점들을 걸러냄으로써 부분그래프 매칭 비용을 줄인다. 기존 기법들에서는 라벨 분포와 부분구조를 정점 특징으로 사용한다. 하지만 가지치기 능력과 추출비용 사이의 교환 비용을 적절히 고려하지 않았다. 본 논문에서는 빠른 부분그래프 매칭을 위한 F-Index라고 부르는 특징 인덱스를 제안한다. F-Index는 정점 특징의 가지치기 능력과 추출비용 사이의 균형을 고려한다. 제안하는 기법에서는 라벨 분포와 함께 정점 주변의 연결정보를 정점 특징으로 사용한다. 데이터베이스 그래프 상에서 적합하지 않은 정점들을 빠르게 걸러내기 위해 정점 특징을 추출한 후 인덱스를 구축한다. 본 논문에서는 다양한 실험을 통해 제안하는 기법이 기존기법들에 비해서 질의 처리 시간과 인덱스 생성 시간 측면에서 우수함을 보인다. In this paper, we study the subgraph matching problem in a large database graph, which finds all subgraphs in the database graph that are isomorphic to a query graph. Recently, feature index-based methods have been proposed for fast subgraph matching in a large database graph. They adopt the concept of vertex features to easily compare the vertices from a database graph with those from a query graph and filter out vertices in the database graph not eligible for subgraph matching. Previous approaches use various kinds of vertex features such as label distribution and discriminative substructures. However, they do not carefully consider the tradeoff between pruning power and extraction cost of vertex features. In this paper we propose a feature index called F-Index for fast subgraph matching. F-Index strikes a balance between pruning power and extraction cost. It uses the combination of label distribution and connectivity information of neighbors as vertex features. F-Index is constructed over the extracted vertex features for fast filtering of unqualified vertices. Experimental results show that our method outperforms the existing methods in terms of query processing time with comparable index build time.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼