• Journal of Physiology & Pathology in Korean Medicine
• /
• v.16 no.5
• /
• pp.845-850
• /
• 2002

This paper suggest a methodology for representation of findings which can be called as signs and symptoms. A finding consists of unit signs and unit symptoms, and moreover findings which appear in one individual patient have so many different relationship each other. So, it is nat appropriate to list all of possible findings as medical standard or to fill findings as independent things in paper for medical record. We try to distinguish finding item from finding list, and suggest the methodology by which we can make finding list from finding items. That is, we suggest finding item[Concept], value types, relationship, logical operator, and syntax as a component of representation. And by using urinary symptom, we make the example for representation methodology. Finally, we mention the background knowledge, brief research process of related area.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1301-1307
• /
• 2001

Video retrieval system must offer representation frame list to do to do play from point that user wants. Representation frame list can get though cut detection point exactly. This paper dismembers frame to fixed block to cut detection point, and compare same block histogram cost of next time frame. If result that compare does not exceed thresold, detect next frame to cutting.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.569-573
• /
• 2001

An approximate representation of discrete functions {f$_{i,j}\mid$｜i, j=-1, 0, 1, …, N+1}in two variables by a fuzzy system is described. We use the cubic B-splines as fuzzy sets for the input fuzzification and spike functions as the output fuzzy sets. The ordinal number of f$_{i,j}$ in the sorted list is taken to be the out put fuzzy set number in the (i, j) th entry of the fuzzy rule table. We show that the fuzzy system is an exact representation of the cubic spline function s(x, y)=$\sum_{N+1}^{{i,j}=-1}f_{i,j}B_i(x)B_j(y)$ and that the approximation error S(x, y)-f(x, y) is surprisingly O($h^2$) when f(x, y) is three times continuously differentiable. We prove that when f(x, y) is a gray scale image, then the fuzzy system is a smoothed representation of the image and the original image can be recovered exactly from its fuzzy system representation when it is a digitized image.e.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• Proceedings of the KAIS Fall Conference
• /
• 2007.05a
• /
• pp.230-232
• /
• 2007

본 논문은 인간의 언어정보처리과정 중 초기 어휘획득(lexical acquisition) 과정을 한국어에 적용시켜 Full-List 모형과 Decomposition 모형의 하이브리드한 형태의 계산주의적 (computational) 어휘정보처리 모델을 구현하고 실험하였다. 실험결과 학습을 통한 언어적 입력의 인간의 어휘획득 과정을 모사(simulate) 할 수 있었고, 특정 문법범주 습득 순서에 대한 이론적 근간을 제시할 수 있었다. 또한 본 연구의 모델에서 자동으로 생성된 Full-List 사전과 Decomposition 사전을 통해 인간의 대뇌 심성표상(mental representation) 형태를 유추할 수 있는 증거를 보였다.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.67-75
• /
• 2008

In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL list into URL prefix form and building a hash tree representation of them, the proposed algorithm performs tree searches for URL lookups. It eliminates redundant searches of hash table method. Experimental results show that proposed algorithm is $62%{\sim}210%$ faster, depending on the number of segment, than conventional hash table method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.358-363
• /
• 1998

An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.1
• /
• pp.68-74
• /
• 1985

In this Paper, we present a non-doglegging channel routing system for If layout using standard cells. This system produces a final two-layer wiring pattern in the horizontal track between two rows, each of which is a linear placement of standard cells of identical heights, satisfying the given net list specification. The layout of CMOS cell library Including nine primitive cells used in this paper is represented in CIF (Caltech Intermediate Form) using λ(Lambda) of 2 microns in Mead-Conway layout representation scheme. The cell dimension and 1/0 characteristics such as name, position and layer type of the pins are stored in Component Library to be used in the channel routing progranl, CROUT. 4 subprogram, NET-PLOT, was used to report a schemdtic layout result, and another subprogram, NETCIF was used to with a full-fledged final layout representation in GIF, A test run for realizing a dynamicmaster-slave D flip-flop with set/reset using primitive cells was shown to take 4 CPU seconds on VAX 11/780.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.385-390
• /
• 2005

Set constraints logic language is a language that adopts `set theory` in programming. In this paper, we introduce the procedure for solving set constraints proposed by A. Dovier and show how the procedure can be implemented in logic language Prolog. The procedure is represented in `rewriting rules` and this representation is characterized by having nondeterministic rule applicationsand mathematical variables that is difficult to be implemented in general programming languages. In this paper, we show that the representation can be easily implemented by using nondeterministic control, logical variables and data structure `list` provided in Prolog. Our implementation has following advantages.First we have implemented the full features of the language. Second we have described the implementation detail in thisresearch. Third other used the commercial Prolog called SICStus, but we are using CIAO Prolog with GNU GPL(General Public License) and anyone can use it freely. Forth the software of our implementation is open source so anyone can use, modify, and distribute it freely.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.553-558
• /
• 2007

In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys' identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.