• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.74-81
• /
• 2008

Protein interaction network contains a small number of highly connected protein, denoted hub and many destitutely connected proteins. Recently, several studies described that a hub protein is more likely to be essential than a non-hub protein. This phenomenon called as a centrality-lethality rule. This nile is widely credited to exhibit the importance of hub proteins in the complex network and the significance of network architecture as well. To confirm whether the rule is accurate, we Investigated all protein interaction DBs of yeast in the public sites such as Uetz, Ito, MIPS, DIP, SGB, and BioGRID. Interestingly, the protein network shows that the rule is correct in lower scale DBs (e.g., Uetz, Ito, and DIP) but is not correct in higher scale DBs (e.g., SGD and BioGRID). We are now analyzing the features of networks obtained from the SGD and BioGRD and comparing those of network from the DIP.

• Proceedings of the Korea Database Society Conference
• /
• 2001.06a
• /
• pp.213-234
• /
• 2001

1. Brokat Server Technologies (Channel 통합 Messging Server) 복잡한 메시지 교환을 유연하게 제어함으로써 Front-End/Back-End각각에 존재하는 다양한 채널을 RealTime으로, 유연하게 통합관리하여 채널간의 Messaging을 Smart하게 컨트롤 2. Brokat Advisor (Rulebase Management System) 복잡한 비즈니스 룰의 적용과 Non-Programming/다이나믹한 관리를 동시에 가능하게 하는 Large E Business Engine (중략)

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.4
• /
• pp.103-108
• /
• 2012

Fuel economy is an important factor in a vehicle owing to recent energy supply and environmental problems. This paper deals with fuel cell hybrid vehicles (FCHVs) and introduces a fuel economy evaluation method. The fuel economy of an FCHV depends on its power management strategy. Two rule-based power management strategies are applied to this paper and their fuel economy is evaluated based on the optimal control theory. The concept of the optimal line is also applied to this paper, which is used to compare the fuel consumption of a power management strategy to the optimal result. The two rule-based strategies are also compared to each other.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1186-1191
• /
• 1991

This paper represents a new edge relaxation algorithm that enhances the noisy boundary informations in images. The proposed algorithm employes relaxation process that reduces or eliminates ambiguities of derivative operator response via contextual informations. The contextual informations are the neighborhood patterns of a central edge which are estimated using fuzzy pattern matching technique. The algorithm is developed on crack edges. Experimental results show that the proposed scheme is effective even for noisy images or low contrast images.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.841-842
• /
• 1988

For determination of black-out area and restoration area by an expert system for fault section estimation and power system restoration using information from circuit breakers, it is necessary that the recognition of system isolation state and a method of finding the change of system isolation state by the state transition of breakers in isolated system. This paper presents a method of resolving the above problem by rule-based approach.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.228-233
• /
• 2004

Nowadays, the robot with various and complex functions is required. previous algorithms, however, cannot satisfy the requirement. In order to solve these problems, we introduce the 2-Layer Fuzzy Controller, which has a small number of fuzzy rules corresponding to various inputs and outputs. Also, it controls robustly and effectively an object. The main problem in the fuzzy controller is how to design the fuzzy rule. This paper designs the optimal 2-layer fuzzy controller using the Schema Co-Evolutionary Algorithm. The schema co-evolutionary algorithm can find more rapidly and excellently than simple genetic algorithm does.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.453-456
• /
• 2005

일반적으로 심전도는 심장계통의 질환을 판단할 때 사용된다. 이러한 심장질환의 이상 유무를 자동으로 진단하기 위해서는 QRS파형 검출을 필요로 하며, 이를 위하여 웨이블렛변환 방법이나 템플릿매칭, 룰 베이스 방법 등 여러 가지 방법들이 쓰이고 있으나, 심전도 신호가 표준화된 형태를 갖지 않는 경우는 검출 능력에 많은 한계를 갖고 있다. 본 논문은 파형의 베이스라인(baseline)을 기준으로 진폭 값에 절대치을 취하는 방법으로 파형의 R피크값을 검출하는 알고리즘을 제안한다. 결과를 검증하기 위해 MIT-BIH 데이타베이스에서 제공하는 데이터와 R피크값을 본 논문의 알고리즘으로 추출된 R피크값과 비교한 결과 96.7%의 검출률을 보였다.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.175-186
• /
• 2010

Due to the emergence of new application programs and the fast growth of Internet users, Internet routers are required to provide the quality of services according to the class of input packets, which is identified by wire-speed packet classification. For a pre-defined rule set, by performing multi-dimensional search using various header fields of an input packet, packet classification determines the highest priority rule matching to the input packet. Efficient packet classification algorithms have been widely studied. Tuple pruning algorithm provides fast classification performance using hash-based search against the candidate tuples that may include matching rules. Bloom filter is an efficient data structure composed of a bit vector which represents the membership information of each element included in a given set. It is used as a pre-filter determining whether a specific input is a member of a set or not. This paper proposes new tuple pruning algorithms using Bloom filters, which effectively remove unnecessary tuples which do not include matching rules. Using the database known to be similar to actual rule sets used in Internet routers, simulation results show that the proposed tuple pruning algorithm provides faster packet classification as well as consumes smaller memory amount compared with the previous tuple pruning algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.1
• /
• pp.93-99
• /
• 2009

The fuzzy control, neural network and genetic algorithm(GA) are algorithms to make the intelligence of system more higher. In this paper, we optimized the fuzzy controller using a genetic algorithm for desire response. Also a compensated fuzzy controller has dual rules. One control rule used to decrease the overshoot and rise time occurring in transient response region and another fuzzy control rule use to decrease the steady state error and rapildy to converge at the convergence region. GA is necessary to optimal the exchange time of the two fuzzy control rule base. Fuzzy-GA controller have a process of reproduction, crossover and mutation and we experimented by hydraulic servo motor control system We could observe that compensated Fuzzy-GA controller have good control performance compare to the fuzzy control technique have two rule base table.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.497-509
• /
• 2008

Various algorithms and architectures for efficient packet classification have been widely studied. Packet classification algorithms based on a decision tree structure such as HiCuts and HyperCuts are known to be the best by exploiting the geometrical representation of rules in a classifier. However, the algorithms are not practical since they involve complicated heuristics in selecting a dimension of cuts and determining the number of cuts at each node of the decision tree. Moreover, the cutting is not efficient enough since the cutting is based on regular interval which is not related to the actual range that each rule covers. In this paper, we proposed a new efficient packet classification algorithm using a range cutting. The proposed algorithm primarily finds out the ranges that each rule covers in 2-dimensional prefix plane and performs cutting according to the ranges. Hence, the proposed algorithm constructs a very efficient decision tree. The cutting applied to each node of the decision tree is optimal and deterministic not involving the complicated heuristics. Simulation results for rule sets generated using class-bench databases show that the proposed algorithm has better performance in average search speed and consumes up to 3-300 times less memory space compared with previous cutting algorithms.