• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.598-603
• /
• 2008

Sequence-Pair(SP)는 플로어플랜을 표현하는 모델 중 하나로써, 일반적으로 SP 모델을 사용하는 플로 어프래너 (floorplanner)는 Simulated-Annealing (SA) 알고리즙을 통해 해 탐색 과정을 수행한다. SP 모델을 이용한 다양한 논문에서 플로어플랜 성능 향상을 위해 평가함수의 개선과 스케줄링 기법 향상을 모색하였으며, 평가함수의 경우 O(nlogn) 시간 알고리즘이 존재한다. 본 논문에서는 SP 모델을 이용한 SA 기법에서 SA의 해 탐색 과정 중 초기 해 탐색 시점에서 좋은 해를 빠르게 찾을 수 있는 방법을 제안한다. 제안 기법은 기존의 SA 프레임펙을 수정한 2단계 SA 알고리즘으로써 SP에 대응하는 배치를 압축하고 압축한 배치를 역변환하는 과정으로 구성된다. 실험과 결과를 통해 제안기법의 효과를 보이며, 평균적으로 동일한 SA 환경 하에서 제안기법이 최종결과 면에서 우수함을 보인다.

• Journal of the Korean Society for information Management
• /
• v.13 no.1
• /
• pp.103-117
• /
• 1996

The purpose of this study is to identify how users react with the search options and bibliographic information during search reformulation on the online catalog. Two online catalogs(N0TIS system and Dynix system) were selected and undergraduate students were recruited as the participants for this study. The study shows that the search options and bibliographic information affected the type of the query reformulation and the re-choice of the search options during search.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.136-139
• /
• 2002

연관규칙 마이닝과정에서의 빈발항목 탐색의 대표적인 방법으로 알려진 Apriori 알고리즘의 성능을 향상시키기 위한 많은 연구가 진행되어 왔다. 본 논문에서는 트랜잭션 데이터베이스(TDB)에서 생성되는 각 패스의 k-itemset들에 대해 각각 트랜잭션 ID List(TIDist)를 유지하고 이를 이용해 (k+1)-itemset을 효율적으로 찾아내는 방법을 제안한다. 이 방법은 frequent (k+1)-itemset(k>0)의 빈도수 및 TIDList를 TDB 에 대한 스캔이 전혀 없이 k-itemset의 TIDList로부터 직접 구한다. 이는 빈발항목집합을 찾기 위한 탐색 complexity는 크게 줄여줄 뿐 아니라 시간 변화에 따른 빈발항목집합의 분포 정보를 제공해 준다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.277-280
• /
• 2007

A moving object tracking algorithm for image searching based on specific color detection is proposed in this paper. That is preprocessed for a luminance variation and noise cancellation to be robust system. The motion tracking is used the difference between input image and reference image in R, G, B each channels for a moving image. The proposed method is enhanced to 15% fast in comparison with the contour tracking method and the matching method, and stable.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.4
• /
• pp.35-41
• /
• 2002

To solve the large scale optimization problem approximately, various approaches have been introduced. They are mainly based on recent research advancement of simulations for evolutions, flocking, annealing, and interactions among organisms on artificial environments. The typical ones are simulated annealing(SA), artificial neural network(ANN), genetic algorithms(GA), tabu search(TS), etc. Recently the particle swarm optimization(PSO) has been introduced. The PSO simulates the process of birds flocking or fish schooling for food, as with the information of each agent Is share by other agents. The PSO technique has been applied to various optimization problems of which variables are continuous. However, there are seldom trials for visualization of searching process. This paper proposes a new visualization tool for searching process particle swarm optimization(PSO) algorithm. The proposed tool is effective for understanding the searching process of PSO method and educational for students.

• Journal of Korean Library and Information Science Society
• /
• v.54 no.1
• /
• pp.143-165
• /
• 2023

This study aims to propose a scaffolding strategy that can be applied to the information search process by using Kuhlthau's ISP model, which presented a design and implementation strategy for the mediation role in the learning process. To this end, the relevant literature was reviewed to categorize scaffolding strategies, and impressions were collected from the students surveys after providing 150 middle school students in the Daejeon area with the project class to which the scaffolding strategy based on the ISP model was applied. The collected data were processed into a form suitable for analysis through data preprocessing for word frequencies to be extracted, and topic analysis was performed using STM (Structural Topic Modeling). First, after determining the optimal number of topics and extracting topics for each stage of the ISP model, the extracted topics were classified into three types: cognitive domain-macro perspective, cognitive domain-micro perspective, and emotional domain perspective. In this process, we focused on cognitive verbs and emotional verbs among words extracted through text mining, and presented a scaffolding strategy model related to each topic by reviewing representative document cases. Based on the results of this study, if an appropriate scaffolding strategy is provided at the ISP model stage, a positive effect on learners' self-directed task solving can be expected.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.1
• /
• pp.85-94
• /
• 2017

In this paper, I proposed a sound model generation and a most frequent model search algorithm for recognizing animal vocalization. The sound model generation algorithm generates a optimal set of models through repeating processes such as the training process, the Viterbi Search process, and the most frequent model search process while adjusting HMM(Hidden Markov Model) structure to improve global recognition rate. The most frequent model search algorithm searches the list of models produced by Viterbi Search Algorithm for the most frequent model and makes it be the final decision of recognition process. It is implemented using MFCC(Mel Frequency Cepstral Coefficient) for the sound feature, HMM for the model, and C# programming language. To evaluate the algorithm, a set of animal sounds for 27 species were prepared and the experiment showed that the sound model generation algorithm generates 27 HMM models with 97.29 percent of recognition rate.

• Journal of Korean Library and Information Science Society
• /
• v.40 no.4
• /
• pp.159-176
• /
• 2009

The aim of this study was to investigate the users' behaviour when interacting with elements based on XML documents retrieval system and develop approaches for XML retrieval which are effective in user-based environment. We followed the experimental guidelines from the INEX 2006 iTrack organizers. For the research goals, 16 responses from the questionnaires per subject and system logs were collected and analyzed using Excel and SPSS 17.0.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.277-279
• /
• 2005

무선 멀티 홉 네트워크는 기지국 없이 중간의 무선 단말기를 경유해서 메세지를 전송하므로 무선 단말기의 전력 상태나 이동에 따라 그 토폴로지가 자주 변한다. 따라서 목적지까지 경로를 탐색하고 유지하기 위해 효율적인 경로 탐색 기법에 대한 연구가 필요하다. 그러나 경로 탐색 과정은 경로 탐색 메세지를 네트워크 전체로 전파하는 플러딩으로 인해 네트워크의 처리율을 크게 감소시킨다. 플러딩으로 발생하는 트래픽을 억제하기 위해 제안된 선별적인 플러딩 기법 중 이웃 노드 정보에 기반 한 접근 방식은 비교적 정확하게 재전송에 필요한 노드를 선별할 수 있으나 HELLO 패킷을 주기적으로 발생시켜야 한다. 본 논문은 이웃 노드의 맥(MAC) 계층에서 발생하는 제어 메세지를 청취해서 이웃 노드의 트래픽 정보를 수집하고 이것을 이용해서 재전송에 필요한 노드를 선별하는 기법을 제안 한다.

• KNOM Review
• /
• v.24 no.2
• /
• pp.48-55
• /
• 2021

Ethereum is an open software platform based on blockchain technology that enables the construction and distribution of distributed applications. Ethereum uses a fully distributed connection method in which all participating nodes participate in the network with equal authority and rights. Ethereum networks use Kademlia-based node discovery protocols to retrieve and store node information. Ethereum is striving to stabilize the entire network topology by implementing node discovery protocols, but systems for monitoring are insufficient. This paper develops a WireShark dissector that can receive packet information in the Ethereum node discovery process and provides network packet measurement results. It can be used as basic data for the research on network performance improvement and vulnerability by analyzing the Ethereum node discovery process.