• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.102-102
• /
• 2022

소하천의 홍수 예측은 대부분 수치모형을 직접 활용하거나, 미리 설정된 시나리오에 기반하여 수치모의를 수행하고 계산된 결과를 이용하여 추정한 경험식을 활용한다. 수치모형과 그 결과를 홍수 예·경보에 활용하기 위해서는 계측자료에 기반하여 변수를 최적화하는 등의 수치모형 검증 절차가 매우 중요하다. 소하천은 국가, 지방하천에 비해 계측자료가 절대적으로 부족한 형편으로 소하천의 홍수 모의를 위해서 주로 국가, 지방하천에서 계측한 자료를 이용하여 검증을 수행한다. 이렇게 검증된 소하천 수치모형은 국가 혹은 지방하천 유역 전체를 모의하여야 하므로 모의시간이 많이 소요되어 1시간내에 홍수유출이 이루어지는 소하천 홍수 모의에는 적절치 않다. 또한 소하천은 하천경사가 급하고 유속이 빨라 실시간 홍수모의가 어려울 수 있다. 따라서 소하천의 홍수 예측 방법으로 수치모형 보다는 계측자료에 기반한 추정삭이 보다 더 효율적이다. 행정안전부와 국립재난안전연구원은 2017년부터 소하천 홍수 예측기술 개발을 위하여 자동유량계측기술을 소하천에 확대적용하고 실시간 수리량 자료를 계측하고 있다. 자동유량계측기술은 CCTV를 이용하여 표면유속을 구하고 동시에 계측된 수위와 단면자료를 이용하여 자동으로 유량을 계측하는 기술이다. 자동유량계측기술은 저비용, 저노동, 고효율의 유량계측기술로써 부족한 계측인력과 계측의 안전성을 고려할 때 소하천에 적합한 계측기솔이라고 할 수 있다. 행정안전부와 국립재난안전연구원은 2025년 까지 전국 소하천의 10%인 2,230개 소하천에 자동유량계측기술을 확대 구축하고 실시간으로 수리량 자료를 걔측할 계획이다. 본 연구에서는 이들 계측자료와 AI 등 첨단기술에 기반한 홍수 예측기술 개발하고자 한다. 예측기술은 계측유역과 미계측유역을 구분하며, 계측유역에 대해서는 계측자료를 이용하고 미계측 유역에 대해서는 단위도법과 CES를 이용하여 구한 결과를 이용하여 강우-유량 노모그래프와 수위-유량 관계식을 개발한다. 이때 노모그래프는 토양수분조건을 고려하여 개발하며, 미계측 소하천의 예측결과는 소하천을 그룹화하고 동일 그룹내에 포함된 소하천의 계측자료를 이용하여 검증한다. 개발된 홍수 예측기술은 소하천 홍수 예·경보시스템에 적용되며 이렇게 개발된 시스템은 소하천의 인명피해 저감에 크게 기여할 수 있을 것으로 기대된다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.107-107
• /
• 2022

소하천의 홍수 예측은 대부분 수치모형을 직접 활용하거나, 미리 설정된 시나리오에 기반하여 수치모의를 수행하고 계산된 결과를 이용하여 추정한 경험식을 활용한다. 수치모형과 그 결과를 홍수 예·경보에 활용하기 위해서는 계측자료에 기반하여 변수를 최적화하는 등의 수치모형 검증절차가 매우 중요하다. 소하천은 국가, 지방하천에 비해 계측자료가 절대적으로 부족한 형편으로 소하천의 홍수 모의를 위해서 주로 국가, 지방하천에서 계측한 자료를 이용하여 검증을 수행한다. 이렇게 검증된 소하천 수치모형은 국가 혹은 지방하천 유역 전체를 모의하여야 하므로 모의시간이 많이 소요되어 1시간내에 홍수유출이 이루어지는 소하천 홍수 모의에는 적절치 않다. 또한 소하천은 하천경사가 급하고 유속이 빨라 실시간 홍수모의가 어려울 수 있다. 따라서 소하천의 홍수 예측방법으로 수치모형 보다는 계측자료에 기반한 추정삭이 보다 더 효율적이다. 행정안전부와 국립재난안전연구원은 2017년부터 소하천 홍수 예측기술 개발을 위하여 자동유량계측기술을 소하천에 확대적용하고 실시간 수리량 자료를 계측하고 있다. 자동유량계측기술은 CCTV를 이용하여 표면유속을 구하고 동시에 계측된 수위와 단면자료를 이용하여 자동으로 유량을 계측하는 기술이다. 자동유량계측기술은 저비용, 저노동, 고효율의 유량계측기술로써 부족한 계측인력과 계측의 안전성을 고려할 때 소하천에 적합한 계측기솔이라고 할 수 있다. 행정안전부와 국립재난안전연구원은 2025년 까지 전국 소하천의 10%인 2,230개 소하천에 자동유량계측기술을 확대 구축하고 실시간으로 수리량 자료를 걔측할 계획이다. 본 연구에서는 이들 계측자료와 AI 등 첨단기술에 기반한 홍수 예측기술 개발하고자 한다. 예측기술은 계측유역과 미계측유역을 구분하며, 계측유역에 대해서는 계측자료를 이용하고 미계측 유역에 대해서는 단위도법과 CES를 이용하여 구한 결과를 이용하여 강우-유량 노모그래프와 수위-유량 관계식을 개발한다. 이때 노모그래프는 토양수분조건을 고려하여 개발하며, 미계측 소하천의 예측결과는 소하천을 그룹화하고 동일 그룹내에 포함된 소하천의 계측자료를 이용하여 검증한다. 개발된 홍수 예측기술은 소하천 홍수 예·경보시스템에 적용되며 이렇게 개발된 시스템은 소하천의 인명피해 저감에 크게 기여할 수 있을 것으로 기대된다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.95-117
• /
• 2006

In this paper, we describe the optimization of the link-level performance and the complexity of floating-point and fixed-point methods in IEEE 802.16e OFDMA/TDD mobile modem. In floating-point design, we propose the channel estimation methods for downlink traffic channel and select the optimized method using computer simulation. So we also propose efficent algorithms for time and frequency synchronization, Digital Front End and CINR estimation scheme to optimize the system performance. Furthermore, we describe fixed-point method of uplink traffic and control channels. The superiority of the proposed algorithm is validated using the performances of Detection, False Alarm, Missing Probability and Mean Acquisition Time, PER Curve, etc. For fixed-point design, we propose an efficient methodology for optimized fixed-point design from floating-point At last, we design fixed-point of traffic channel, time and frequency synchronization, DFE block in uplink and downlink. The tradeoff between performance and complexity are optimized through computer simulations.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.32 no.8
• /
• pp.1270-1277
• /
• 2003

The extrusion conditions of the soymilk residue and corn grits mixtures were optimized. The experiment was designed according to the D-optimal design of response surface methodology (RSM), which shows 18 experimental points including 4 replicates for three independent variables (screw speed, water content and die temperature). The responses variables such as bending force, expansion ratio, bulk density, water solubility index (WSI), water absorption index (WAI), and color values (L＊, a＊, b＊) were evaluated using response surface analysis. Expansion ratio and WSI decreased with increasing water content, whereas bulk density tended to increase with increasing water content. While greater screw speeds enhanced WSI and yellowness, higher moisture contents decreased the expansion ratio and WSI value. However, die temperature did not influence upon the response variables. The optimum extrusion conditions by numerical and graphical methods were similar: the screw speed, water content, and die temperature were 250 rpm, 22.43% and l28.16$^{\circ}C$ by the numerical method; 250 rpm, 22.43%, and 128.02$^{\circ}C$ by graphical method.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.93-104
• /
• 2007

In the complex real-time multi-agent system such as game environment, dynamic task allocations are repeatedly performed to achieve a goal in terms of system efficiency. In this research, we present a task allocation scheme suitable for the real-time multi-agent environment. The scheme is to optimize the task allocation by complementing existing coordination agent with $A^*$ algorithm. The coordination agent creates a status graph that consists of nodes which represent the combinations of tasks and agents, and refines the graph to remove nodes of non-execution tasks and agents. The coordination agent performs the selective utilization of the $A^*$ algorithm method and the greedy method for real-time re-allocation. Then it finds some paths of the minimum cost as optimized results by using $A^*$ algorithm. Our experiments show that the coordination agent with $A^*$ algorithm improves a task allocation efficiency about 25% highly than the coordination agent only with greedy algorithm.

• Journal of Korean Society of Steel Construction
• /
• v.22 no.2
• /
• pp.197-208
• /
• 2010

An under-tension system is frequently employed for large-span structures to reduce the deflection and member size. In this study, a microgenetic algorithm was used to find the optimum cross-section of truss structures with an undertension cable under transverse loading. Maximum deflection, allowable stress, and buckling were considered constraints. The proposed approach was verified using a 10-bar truss sample that shows good agreement with the previous results. In the numerical results, minimum-weight design of the under-tension structure was performed for various magnitudes of pretension.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.122-131
• /
• 2010

In this paper, we design and implement CTOC, a new bytecode analysis and translation tool. We also propose E-Tree, a new intermediate code, to efficiently deal with intermediate codes translated from bytecodes. E-Tree is expressed in a tree form by combining relevant bytecode instructions in basic blocks of eCFG to overcome the weaknesses of bytecodes such as complexity and analytical difficulty. To demonstrate the usefulness and possible extensibility of CTOC, we show the creation process of eCFG and E-Tree through practical bytecode analysis and translation and shows the optimization process of a bytecode program as an example of possible extensibility.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.430-432
• /
• 2005

자바 언어는 객체 지향 언어이며 이식성에 좋은 언어로써 각광을 받고 있다. 하지만 자바 프로그램은 이식성은 좋지만 실행 시 인터프리터 방식으로 사용하기 때문에 실행속도가 느리다는 단점이 있다. 또한 바이트코드는 스택기반의 코드이기 때문에 코드 단편화 문제점과 스택 접근 연산들을 사용하여 프로그램 분석이 용이 하지 않고, 단순한 변환을 복잡하게 만들 수 있다는 단점이 있다. 따라서 바이트코드 자체로 분석과 최적화하기가 용이 하지 못하다. 본 논문에서는 바이트코드의 분석을 위한 트리구조 중간코드를 제안 한다. 트리구조 중간코드는 스택기반 코드의 문제점을 보완하고, 기존에 3-주소 형태의 최적화 기법들을 적용할 수 있다는 장점이 있다. 본 논문은 바이트코드와 각종 정보를 가지고 있는 클래스 파일을 입력받아 분석 후 기본블록을 나누고 BNF코드를 바탕으로 트리구조 중간코드를 생성하게 된다. 생성된 중간코드를 가지고 제어 흐름 그래프를 만들게 된다. 이러한 방식으로 트리구조 중간코드를 설계하게 된다.

• Journal of Intelligence and Information Systems
• /
• v.27 no.4
• /
• pp.49-71
• /
• 2021

Users who intend to utilize knowledge to actively solve given problems proceed their jobs with cross- and sequential exploration of associated knowledge related each other in terms of certain criteria, such as content relevance. A knowledge map is the diagram or taxonomy overviewing status of currently managed knowledge in a knowledge-base, and supports users' knowledge exploration based on certain relationships between knowledge. A knowledge map, therefore, must be expressed in a networked form by linking related knowledge based on certain types of relationships, and should be implemented by deploying proper technologies or tools specialized in defining and inferring them. To meet this end, this study suggests a methodology for developing the knowledge graph-based knowledge map using the Graph DB known to exhibit proper functionality in expressing and inferring relationships between entities and their relationships stored in a knowledge-base. Procedures of the proposed methodology are modeling graph data, creating nodes, properties, relationships, and composing knowledge networks by combining identified links between knowledge. Among various Graph DBs, the Neo4j is used in this study for its high credibility and applicability through wide and various application cases. To examine the validity of the proposed methodology, a knowledge graph-based knowledge map is implemented deploying the Graph DB, and a performance comparison test is performed, by applying previous research's data to check whether this study's knowledge map can yield the same level of performance as the previous one did. Previous research's case is concerned with building a process-based knowledge map using the ontology technology, which identifies links between related knowledge based on the sequences of tasks producing or being activated by knowledge. In other words, since a task not only is activated by knowledge as an input but also produces knowledge as an output, input and output knowledge are linked as a flow by the task. Also since a business process is composed of affiliated tasks to fulfill the purpose of the process, the knowledge networks within a business process can be concluded by the sequences of the tasks composing the process. Therefore, using the Neo4j, considered process, task, and knowledge as well as the relationships among them are defined as nodes and relationships so that knowledge links can be identified based on the sequences of tasks. The resultant knowledge network by aggregating identified knowledge links is the knowledge map equipping functionality as a knowledge graph, and therefore its performance needs to be tested whether it meets the level of previous research's validation results. The performance test examines two aspects, the correctness of knowledge links and the possibility of inferring new types of knowledge: the former is examined using 7 questions, and the latter is checked by extracting two new-typed knowledge. As a result, the knowledge map constructed through the proposed methodology has showed the same level of performance as the previous one, and processed knowledge definition as well as knowledge relationship inference in a more efficient manner. Furthermore, comparing to the previous research's ontology-based approach, this study's Graph DB-based approach has also showed more beneficial functionality in intensively managing only the knowledge of interest, dynamically defining knowledge and relationships by reflecting various meanings from situations to purposes, agilely inferring knowledge and relationships through Cypher-based query, and easily creating a new relationship by aggregating existing ones, etc. This study's artifacts can be applied to implement the user-friendly function of knowledge exploration reflecting user's cognitive process toward associated knowledge, and can further underpin the development of an intelligent knowledge-base expanding autonomously through the discovery of new knowledge and their relationships by inference. This study, moreover than these, has an instant effect on implementing the networked knowledge map essential to satisfying contemporary users eagerly excavating the way to find proper knowledge to use.