• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.416-420
• /
• 2004

Recently, the importance of vibration reduction at the local structure such as tank, deck which attached machinery and compass deck, has continuously increased by owner and shipbuilder. Because crews are afflicted with them and severe vibration problems affect on the crack of structure. This study conducted optimum design to get a stiffener size of local structure to reducing the vibration level and dec leasing the weight of structure in ship. Random tabu search method (R-Tabu) has fast converging time and can search variables size domains for nonlinear problems. This paper used Nastran external call type independence optimization method which makes using a solver module from Nastran.

• 디자인학연구
• /
• 제15권2호
• /
• pp.223-232
• /
• 2002

인터넷이 정보획득의 중요한 수단으로써 보편화되면서 인터넷상의 정보를 효율적으로 조직화하고 관리할 수 있는 시스템의 중요성이 점차 커지고 있다. 이에 따라 이용자의 정보검색효율성에 직접적인 영향을 기치는 디렉토리 분류체계에 대한 연구가 각 분야별로 활발히 진행되고 있다. 본 연구에서는 디자인 분야 디렉토리 분류체계에 의한 검색의 효율성을 높이기 위하여 문헌 분류체계에 대한 이론과 현재 서비스되어 지고 있는 디자인 포탈사이트들의 디렉토리 분류체계를 비교 분석하여 효율적인 분류체계 방안을 제안 하고자 한다.

• 통합자연과학논문집
• /
• 제3권3호
• /
• pp.143-147
• /
• 2010

Since it is of great importance to know how a ligand binds to a receptor, there have been a lot of efforts to improve the quality of prediction of docking poses. Earlier efforts were focused on improving search algorithm and scoring function in a docking program resulting in a partial improvement with a lot of variations. Although these are basically very important and essential, more tangible improvements came from the reduction of search space. In a normal docking study, the approximate active site is assumed to be known. After defining active site, scoring functions and search algorithms are used to locate the expected binding pose within this search space. A good search algorithm will sample wisely toward the correct binding pose. By careful study of receptor structure, it was possible to prioritize sub-space in the active site using "receptor-based pharmacophores" or "hot spots". In a sense, these techniques reduce the search space from the beginning. Further improvements were made when the bound ligand structure is available, i.e., the searching could be directed by molecular similarity using ligand information. This could be very helpful to increase the accuracy of binding pose. In addition, if the biological activity data is available, docking program could be improved to the level of being useful in affinity prediction for a series of congeneric ligands. Since the number of co-crystal structures is increasing in protein databank, "Ligand-Guided Docking" to reduce the search space would be more important to improve the accuracy of docking pose prediction and the efficiency of virtual screening. Further improvements in this area would be useful to produce more reliable docking programs.

• 대한건축학회논문집:구조계
• /
• 제33권12호
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

• 한국의사학회지
• /
• 제33권2호
• /
• pp.89-104
• /
• 2020

The purpose of this research is to build a database structure that can be useful for evidence-based medical practices by constructing the knowledge related to oriental medicine in the classical literature knowledge in a form that can utilize new forms of information technology. As a method, "database" is used as a keyword to search published studies in the field of oriental medicine, research is conducted on classic literature knowledge, and studies describing the contents of the data structure are found and analyzed. In conclusion, the original text DB for the preservation of the original texts and the presentation of the supporting texts should include 'Contents Text', 'Tree Structure', 'Herbal Structure', 'Medicine Manufacture', and 'Disease Structure' tables. In order to search, calculate, and automatically extract expressions written in the original text of the old literature, the tool DB should include 'Unit List', 'Capacity Notation List', 'CUI', 'LUI', and 'SUI' tables. In addition, In order to manage integrated knowledge such as herbal, medicine, acupuncture, disease, and literature, and to implement a search function such as comparison of similarity of control composition, the knowledge DB must contain 'dose-controlled medicine name', 'dose-controlled medicine composition', 'relational knowledge', 'knowledge structure', and 'computational knowledge' tables.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2009년도 춘계학술대회 논문집
• /
• pp.325-326
• /
• 2009

• 한국통신학회논문지
• /
• 제33권12B호
• /
• pp.1103-1111
• /
• 2008

라우터는 입력되는 패킷을 인터넷 주소 검색을 통하여 패킷의 목적지로 향하는 포트로 포워딩하는 역할을 하는데, 입력되는 속도와 같은 속도로 패킷을 포워딩하기 위해서는 매우 빠른 검색을 제공할 필요가 있다. 본 논문에서는 이진 검색을 이용한 IP 주소 검색구조에 대해 연구하였다. 대부분의 이진 검색 알고리즘들은 균형 이진 검색을 진행하지 않아 과도한 메모리 접근을 야기함으로써 검색속도가 느린 단점이 있다. 한편 영역분할을 이용한 이진 검색 알고리즘은 매우 빠른 검색 성능을 보이지만, 메모리 요구량이 크다는 단점이 있다. 본 논문에서는 영역분할 이진 검색에서 불필요한 엔트리와 항목을 삭제함으로써 라우팅 테이블의 크기를 최적화하여 메모리 요구량을 감소시키는 방법에 대하여 연구하였다. 이러한 최적화를 통하여 프리픽스의 개수와 비슷하거나 적은 수의 엔트리를 갖는 영역분할 이진 검색 라우팅 테이블을 구성할 수 있음을 보였다. 실제 사용되는 다양한 크기의 라우팅 테이블을 이용하여 영역분할 이진 검색의 원래 구조와 최적화된 구조의 검색 성능을 비교하였으며, 다른 여러가지 이진 검색 알고리즘과의 성능을 비교하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.521-523
• /
• 2006

This paper proposes an algorithm and its data structure to support real-time full-text search for the streamed or broadcasted multimedia data containing real-time stenograph text. Since the traditional indexing method used at information retrieval area uses the linguistic information, there is a heavy cost. Therefore, we propose the algorithm and its data structure based on suffix array, which is a simple data structure and has low space complexity. Suffix array is useful frequently to search for huge text. However, subtitle text of multimedia data is to get longer by time. Therefore, suffix array must be reconstructed because subtitle text is continually changed. We propose the data structure called prefix array and search algorithm using it.

• 정보관리학회지
• /
• 제22권2호
• /
• pp.205-228
• /
• 2005

이 연구는 웹정보원의 지적 구조를 동시링크분석을 이용하여 시기별 변화와 검색엔진별 차이를 중심으로 분석하였다. 지적 구조의 시기별 변화를 분석한 결과, 이차원 지도상에 나타난 웹정보원의 군집과 위치는 6년간의 시간흐름에 따른 지적 구조의 변화를 나타냈다. Altavista와 MSN Search 검색엔진을 대상으로 지적구조의 차이를 분석한 결과, 웹정보원 지도에 나타난 전체적인 지적 구조는 유사한 양상을 나타냈지만, 몇몇 웹정보원의 경우 소속 군집이 달라지는 경우가 발생했다. 인쇄 정보원에 적용되던 동시인용기법이 웹정보원에 대한 통시적 분석에도 응용될 수 있음을 확인하였다.

• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1732-1743
• /
• 2000

In this paper a fixed-delay trellis search with decision feedback (FDTrS/DF) for high-density DVD systems (4.7-15GB) is proposed and implemented with FPGA. The proposed FDTrS/DF is derived by transforming the binary tree search structure into trellis search structure implying that FDTrS/DF performs better than the singnal detection techniques based on tree search structure such as FDTS/DF and SSD/DF. Advantages of FDTrS/DF are significant reductions in hardware complexity due to the unique structure of FDTrS composed of only one trellis stage requiring no traceback procedure usually implemented in the Viterbi detector. Also in this paper the PDFS/DF and SSD/DF orginally proposed for high-density magnetic recording systems are modified for the DVD system and compared with the proposed FDTrS/DF. In order to increase speed in the FPGA implementation the pipelining technique and absolute branch metric (instead of square branch metric) are applied. The proposed FDTrS/DF is shown to provide the best performance among various signal detection techniques such as PRML, DFE, FDTS/DF and SSD/DF even with a small hardware complexity.