• Title/Summary/Keyword: link similarity

Search Result 57, Processing Time 0.026 seconds

Competition - Ecological Classification of the Prominent Paddy Weed Species around Bulrush(Scirpus juncoides) (올챙고랭이(Scirpus juncoides)를 중심으로 한 주요(主要) 논 잡초종(雜草種)의 벼 경합생태적(競合生態的) 분류(分類))

  • Guh, J.O.;Heo, S.M.
    • Korean Journal of Weed Science
    • /
    • v.5 no.2
    • /
    • pp.96-102
    • /
    • 1985
  • A study on the competition-ecological classification of the 10 prominent paddy weed species around bulrush (Scirpus juneoides) to simplify the weed problem concept for the rice production. A serial assessments on the competition ability in space and dry matter production(nutrient depletion) of respective weed species and paddy rice, and the data were used to compute the phenotypic similarity by Single Link Clustering method. Both growth response of weed species in mono- and under the paddy rice standing was very similar (r = 0.969), but the reduction rate as affected by paddy rice standing was negatively correlated with the ability in space-competition(r=-0.513). Dendrogram of 10 weed species based on the phenotypic similarity computed in 4 characters in mono- and under the paddy rice standing was also similar, as Echinochloa c., Ludwigia p., Cyperus s., and Scirpus m. in I-group, Eleocharis k., Scirpus j, in II-group, and Juncus e., Potamogeton d. in III-group, respectively. Also, that of paddy rice to 10 weed species showed Fimbristylis m., Scirpus j., Eleocharis k., Scirpus m., Juncus e. in I-group, and Ludwigia p., Potamogeton d., Monochoria v. in II-group, respectively. The integrated dendrogram by the above two data indicate the I-group with Fimbristylis m., Scirpus j., Eleocharis k. and Juncus e., as higher growth response with relatively lower competition ability to paddy rice, II-group with Cyperus s., Echinochloa c., Potamogeton d., and Ludwigia p., as higher both in growth and competition, and the last, III-group with Monochoria v., and Scirpus m., as lower growth but higher competition, respectively.

  • PDF

Congestion Control of Self-Similar Traffic in Two-way Network (양방향 네트워크에서 자기유사성 트래픽 혼잡 제어)

  • 석경휴;송선희;김철영;나상동
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.295-303
    • /
    • 2004
  • In this Paper, we discuss an active TCP link of unsynchronized transmission mode network in two-way traffic and the Improvement of its traffic patron thorough the network pathway of protocol is shown. This is because the traffic pattern is performed on the basis of existing windows which are distributing information in several periods of time in the way of interfacing LTS control module, which is controlling by an information of exceeding the time limit of feedback loop determined by RTP, with TCP. The simulation to utilize this efficiently is performed with the circumstance of bench mark based on physical modeling of the self-similarity traffic in the performance of TCP. In this paper, we use a methodology to understand and evaluate the effect of change of transmitting protocol in sticks under the condition of the self-similar traffic in two-way network and it is shown that an improvement of congestion control by self-similarity under a heavy condition.

Performance Improvement of Web Information Retrieval Using Sentence-Query Similarity (문장-질의 유사성을 이용한 웹 정보 검색의 성능 향상)

  • Park Eui-Kyu;Ra Dong-Yul;Jang Myung-Gil
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.5
    • /
    • pp.406-415
    • /
    • 2005
  • Prosperity of Internet led to the web containing huge number of documents. Thus increasing importance is given to the web information retrieval technology that can provide users with documents that contain the right information they want. This paper proposes several techniques that are effective for the improvement of web information retrieval. Similarity between a document and the query is a major source of information exploited by conventional systems. However, we suggest a technique to make use of similarity between a sentence and the query. We introduce a technique to compute the approximate score of the sentence-query similarity even without a mature technology of natural language processing. It was shown that the amount of computation for this task is linear to the number of documents in the total collection, which implies that practical systems can make use of this technique. The next important technique proposed in this paper is to use stratification of documents in re-ranking the documents to output. It was shown that it can lead to significant improvement in performance. We furthermore showed that using hyper links, anchor texts, and titles can result in enhancement of performance. To justify the proposed techniques we developed a large scale web information retrieval system and used it for experiments.

Web Traffic Analysis according to the Link-down Duration of TCP and SCTP (링크다운 시간에 따른 TCP와 SCTP의 웹 트래픽 분석)

  • Choi, Yong-Woon;Cho, Kwang-Moon;Lee, Yong-Jin
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.3
    • /
    • pp.44-52
    • /
    • 2010
  • The most popular world wide web traffic in the Internet uses TCP as the transport layer protocol. Since TCP utilizes the single path, it can not communicate with the correspondent host during the link-down. On the other hand, SCTP can still communicate with the other SCTP entity by using alternate path even while the primary path is down. Most of previous studies have conducted the performance comparison research between TCP and SCTP by using typical file transfer. Since web traffic with self-similarity is characterized by the packet inter-arrival times and shape parameter affecting the size of web file in the Pareto distribution, it is necessary to perform the experiments considering these parameters. This paper aims to compare the throughput between TCP and SCTP while varying parameters reflecting the web traffic characteristics in link-down environment. Experimental results for web traffic using NS-2 simulator show that the throughput of SCTP using multi-homing is better than that of TCP. Simulation also shows that TCP is more affected than SCTP by mean inter-arrival and shape parameters with regard to the web traffic. These results can be applied to estimate the performance variation of web traffic due to the duration of link-down.

Implementation of Policy based In-depth Searching for Identical Entities and Cleansing System in LOD Cloud (LOD 클라우드에서의 연결정책 기반 동일개체 심층검색 및 정제 시스템 구현)

  • Kim, Kwangmin;Sohn, Yonglak
    • Journal of Internet Computing and Services
    • /
    • v.19 no.3
    • /
    • pp.67-77
    • /
    • 2018
  • This paper suggests that LOD establishes its own link policy and publishes it to LOD cloud to provide identity among entities in different LODs. For specifying the link policy, we proposed vocabulary set founded on RDF model as well. We implemented Policy based In-depth Searching and Cleansing(PISC for short) system that proceeds in-depth searching across LODs by referencing the link policies. PISC has been published on Github. LODs have participated voluntarily to LOD cloud so that degree of the entity identity needs to be evaluated. PISC, therefore, evaluates the identities and cleanses the searched entities to confine them to that exceed user's criterion of entity identity level. As for searching results, PISC provides entity's detailed contents which have been collected from diverse LODs and ontology customized to the content. Simulation of PISC has been performed on DBpedia's 5 LODs. We found that similarity of 0.9 of source and target RDF triples' objects provided appropriate expansion ratio and inclusion ratio of searching result. For sufficient identity of searched entities, 3 or more target LODs are required to be specified in link policy.

An Approach for Accuracy in Computing Link-based Similarity of Scientific Papers (링크 기반 논문 유사도 계산의 정확도 향상 방안)

  • Yoon, Seok-Ho;Kim, Ji-Soo;Kim, Sang-Wook
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06c
    • /
    • pp.160-162
    • /
    • 2012
  • 본 논문에서는 논문들 간의 유사도를 계산하는 기존 링크 기반 유사도 계산 방안의 정확도를 향상시키기는 방안을 제안한다. 제안하는 방안은 링크로 연결되어 있는 두 객체의 관련 정도를 경험적인 세 가지 방법(인기도 고려, 발행연도 고려, 내용 관련도 고려)을 이용해서 계산하고 계산된 값을 링크의 가중치로 사용한다. 실험을 통하여 기존 링크 기반 유사도 계산 방안보다 제안하는 방안을 적용한 기존 링크 기반 유사도 계산 방안의 정확도가 우수하다는 것을 보인다.

Dynamic Tracking Aggregation with Transformers for RGB-T Tracking

  • Xiaohu, Liu;Zhiyong, Lei
    • Journal of Information Processing Systems
    • /
    • v.19 no.1
    • /
    • pp.80-88
    • /
    • 2023
  • RGB-thermal (RGB-T) tracking using unmanned aerial vehicles (UAVs) involves challenges with regards to the similarity of objects, occlusion, fast motion, and motion blur, among other issues. In this study, we propose dynamic tracking aggregation (DTA) as a unified framework to perform object detection and data association. The proposed approach obtains fused features based a transformer model and an L1-norm strategy. To link the current frame with recent information, a dynamically updated embedding called dynamic tracking identification (DTID) is used to model the iterative tracking process. For object association, we designed a long short-term tracking aggregation module for dynamic feature propagation to match spatial and temporal embeddings. DTA achieved a highly competitive performance in an experimental evaluation on public benchmark datasets.

Normalization for Link-Based Similarity Measures in Scientific Literature (논문 데이터베이스에서 링크 기반 유사도 계산을 위한 정규화 방안)

  • Kim, Ji-Soo;Yoon, Seok-Ho;Kim, Sang-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.130-131
    • /
    • 2010
  • 본 논문에서는 기존 링크 기반 유사도 계산 방안에 사용되는 두 가지 정규화 방안들을 설명하고, 두 정규화 방안 중에서 논문 데이터베이스에 적합한 정규화 방안을 선정한다. 또한, 실제 논문 데이터베이스에 두 가지 정규화 방안을 적용한 기존 링크 기반 유사도 계산 방안의 정확도를 측정함으로써 선정된 정규화 방안이 다른 정규화 방안보다 우수하다는 것을 규명한다.

Post Recommendation Using Link-based Similarity in Blogosphere (블로그 공간에서 링크 기반 유사도를 이용한 게시글 추천)

  • Song, Suk-Soon;Yoon, Seok-Ho;Kim, Sang-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.929-930
    • /
    • 2009
  • 본 논문에서는 링크 기반 유사도 계산을 이용해서 블로그 공간에서 사용자가 관심을 가질만한 게시글들을 사용자에게 추천하는 방안을 제안한다. 제안된 방안은 사용자가 관심을 가졌던 게시글들 중에서 시드 게시글을 선택하고 링크 기반 유사도를 계산하여 시드 게시글과 가장 유사하다고 판단되는 k개의 게시글들을 사용자에게 추천한다. 또한, 시드 게시글들 중에서 추천하고자 하는 주제가 아닌 다른 주제의 게시글들이 잘못 추천되는 문제를 해결하기 위해서 시드 게시글과 동일한 주제라고 확실시 되는 게시글들만을 점진적으로 찾아 추천하는 방안을 제안한다. 실제 블로그 데이터를 이용한 실험을 통하여 제안하는 추천 방안의 우수성을 검증한다.

An Agent System for Supporting Adaptive Web Surfing (적응형 웹 서핑 지원을 위한 에이전트 시스템)

  • Kook, Hyung-Joon
    • The KIPS Transactions:PartB
    • /
    • v.9B no.4
    • /
    • pp.399-406
    • /
    • 2002
  • The goal of this research has been to develop an adaptive user agent for web surfing. To achieve this goal, the research has concentrated on three issues: collection of user data, construction and improvement of user profile, and adaptation by applying the user profile. The main outcome from the research is a prototype system that provides the functional definition and componential design scheme for an adaptive user agent for the web environment. Internally, the system achieves its operational goal from the cooperation of two independent agents. They are IIA (Interactive Interface Agent) and UPA (User Profiling Agent). As a tool for providing a user-friendly interface environment, the IIA employs the Keyword Index, which is a list of index terms of a webpage as well as a keyword menu for subsequent queries, and the Suggest Link, which is a hierarchical list of URLs showing the past browsing procedure of the user. The UPA reflects in the User Profile, both the static and the dynamic information obtained from the user's browsing behavior. In particular, a user's interests are represented in the form of Interest Vectors which, based on the similarity of the vectors, is subject to update and creation, thus dynamically profiling the user's ever-shifting interests.