• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.87-101
• /
• 1991

The primary purpose of this study was to investigate a robust search methodology that could be used in full-text information retrieval systems. A robust search methodology is one that can be easily used by a variety of users (particularly naive users) and it will give them comparable search performance regardless of their different expertise or interests In order to develop a possibly robust search methodology, a fully functional prototype of a fuzzy knowledge based information retrieval system was developed. Also, an experiment that used this prototype information retreival system was designed to investigate the performance of that search methodology over a small exploratory sample of user queries To probe the relatonships between the possibly robust search performance and the query organization using fuzzy inference logic, the search performance of a shallow query structure was analyzes. Consequently the following several noteworthy findings were obtained: 1) the hierachical(tree type) query structure might be a better query organization than the linear type query structure 2) comparing with the complex tree query structure, the simple tree query structure that has at most three levels of query might provide better search performance 3) the fuzzy search methodology that employs a proper levels of cut-off value might provide more efficient search performance than the boolean search methodology. Even though findings could not be statistically verified because the experiments were done using a single replication, it is worth noting however, that the research findings provided valuable information for developing a possibly robust search methodology in full-text information retrieval.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.6
• /
• pp.993-998
• /
• 2006

We earlier suggested a hierarchical regulatory network using defined modeling symbols and weights in order to improve the flux balance analysis (FBA) with regulatory events that were represented by if-then rules and Boolean logic. In the present study, the simulation results of the models, which were developed and improved from the previou model by incorporating a hierarchical regulatory network into the FBA, were compared with the experimental outcome of an aerobic batch growth of E. coli on glucose and tryptophan. From the experimental result, a diauxic growth curve was observed, reflecting growth resumption, when tryptophan was used as an alternativee after the supply of glucose was exhausted. The model parameters, the initial concentration of substrates (0.92 mM glucose and 1 mM tryptophan), cell density (0.0086 g biomass/1), the maximal uptake rates of substrates (5.4 mmol glucose/g DCW h and 1.32 mmol tryptophan/g DCW h), and lag time (0.32 h) were derived from the experimental data for more accurate prediction. The simulation results agreed with the experimental outcome of the temporal profiles of cell density and glucose, and tryptophan concentrations.

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

This study is to develop knowledge base system for query extension to the user oriented information retrieval. This study has survey the theories of the concept-based information retrieval method and statistic based information retrieval method. In the construction method of knowledge base, the common hypothesis is that the emergence of related term is the frequency of simultaneous emergence of a set of documents. Using the subject index file algorithms and the 'and' operator of boolean logic based on this hypothesis, this study builds the knowledge base. In this research experiment, a subject of knowledge base is education. Using the book of the Introduction to Education, two experimental knowledge base systems is constructed by the different indexing method. One system has constructed by controlled language indexing method, and another system has constructed by natural language indexing method. The performance of two knowledge base system is evaluated.

• Journal of Digital Convergence
• /
• v.14 no.6
• /
• pp.253-261
• /
• 2016

As many people use internet through the various programs of PC and mobile devices, the possibility of private data leak is increasing. A program should be used after checking security of information flow. Security analysis of information flow is a method that analyzes security of information flow in program. If the information flow is secure, there is no leakage of personal information. If the information flow not secure, there may be a leakage of personal information. This paper proposes a method of analyzing information flow that facilitates SAT solver. The method translates a program that includes variables where security level is set into propositional formula representing control and information flow. The satisfiability of the formula translated is determined by using SAT solver. The security of program is represented through the result. Counter-example is generated if the program is not secure.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2003.04a
• /
• pp.472-477
• /
• 2003

멸종위기종의 서식지를 효율적으로 관리하기 위해서는 해당 종의 서식 가능한 지역의 분포를 알아야 한다. 본 연구의 목적은 GIS와 퍼지집합을 이용하여 산양(Nemorhaedus caudatus)의 서식지적합성모형을 개발하여 멸종 위기종의 서식지를 관리하기 위한 정보를 제공하는 것이다. 산양의 서식지적합성모형 개발을 위한 본 연구의 주요내용은 다음과 같다. 첫째, 산양 서식지 이용에 관한 기존 연구를 바탕으로 산양의 잠재적 서식지 환경변수를 분류하였으며, 분석 대상지의 산양 흔적 조사를 통해 서식지 환경변수의 재분류 및 x²검정(Chi-square test)을 통한 변수들의 유용성을 파악하고, 쌍체비교를 통한 환경변수별 가중치를 계산하였다. 둘째, 기존 부울논리(boolean logic)의 단점을 보완하기 위해 현장 조사의 결과를 바탕으로 퍼지논리(fuzzy logic)에 의한 산양 서식지의 각 환경변수별 주제도를 작성하고, 주제도들의 상관관계를 분석하여 상호 관련성이 높은 변수들의 중복을 피하였다. 셋째, 환경변수별 주제도와 변수별 가중치를 바탕으로 다기준평가기법(MCE, Multi-Criteria Evaluation)을 이용하여 분석대상지의 산양 서식지적합성모형을 개발하였다. 마지막으로, 개발된 서식지적합성모형의 타당성을 검증하기 위해 분석대상지 외부 지역을 대상으로 검증을 실시하였다. 분석 결과 분석대상지의 분류정확도는 서식가능성 0.5를 기준으로 93.94%의 매우 높은 분류정확도를 나타내었으며, 검증대상지에서는 95.74%의 분류정확도를 나타내어 본 모형의 분류정확도는 일관성이 높은 것으로 판단되었다. 또한 전체 공원구역에서 서식가능성 0.5이상의 면적은 59%를 차지하였다.퇴적이 우세한 것으로 관측되었다.보체계의 구축사업의 시각이 행정정보화, 생활정보화, 산업정보화 등 다양한 분야와 결합하여 보다 큰 시너지 효과와 사용자 중심의 서비스 개선을 창출할 수 있는 기반을 제공할 것을 기대해 본다.. 이상의 결과를 종합해볼 때, ${\beta}$-glucan은 고용량일 때 직접적으로 또는 $IFN-{\gamma}$ 존재시에는 저용량에서도 복강 큰 포식세로를 활성화시킬 뿐 아니라, 탐식효율도 높임으로써 면역기능을 증진 시키는 것으로 나타났고, 그 효과는 crude ${\beta}$-glucan의 추출조건에 따라 달라지는 것을 알 수 있었다.eveloped. Design concepts and control methods of a new crane will be introduced in this paper.and momentum balance was applied to the fluid field of bundle. while the movement of′ individual material was taken into account. The constitutive model relating the surface force and the deformation of bundle was introduced by considering a representative prodedure that stands for the bundle movement. Then a fundamental equations system could be simplified considering a steady state of the process. O

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.1
• /
• pp.79-85
• /
• 2001

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint(TMFCPLD). This technology mapping algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. This method is for reason to reduce area and improve total run time of circuits by TEMPLA proposed previously. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Initial cost of each node are the number of OR-terms that it have. Among mappable clusters, clusters of which the number of multi-level is least is selected, and the graph is partitioned. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA, and reduced the number of CLBs by 4.7% than those of TMCPLD. This results will give much efficiency to technology mapping for CPLDs.

• Applied Biological Chemistry
• /
• v.50 no.4
• /
• pp.245-252
• /
• 2007

FTA (fault tree analysis), an analytical method for system failure management, was employed in the management of faults in running PCR analysis. PCR is executed through several processes, in which the process of PCR machine operation was selected for the analysis by FTA. The reason for choosing the simplest process in the PCR analysis was to adopt it as a first trial to test a feasibility of the FTA approach. First, fault events-top event, intermediate event, basic events-were identified by survey on expert knowledge of PCR. Then those events were correlated deductively to build a fault tree in hierarchical structure. The fault tree was evaluated qualitatively and quantitatively, yielding minimal cut sets, structural importance, common cause vulnerability, simulation of probability of occurrence of top event, cut set importance, item importance and sensitivity. The top event was 'errors in the step of PCR machine operation in running PCR analysis'. The major intermediate events were 'failures in instrument' and 'errors in actions in experiment'. The basic events were four events, one event and one event based on human errors, instrument failure and energy source failure, respectively. Those events were combined with Boolean logic gates-AND or OR, constructing a fault tree. In the qualitative evaluation of the tree, the basic events-'errors in preparing the reaction mixture', 'errors in setting temperature and time of PCR machine', 'failure of electrical power during running PCR machine', 'errors in selecting adequate PCR machine'-proved the most critical in the occurrence of the fault of the top event. In the quantitative evaluation, the list of the critical events were not the same as that from the qualitative evaluation. It was because the probability value of PCR machine failure, not on the list above though, increased with used time, and the probability of the events of electricity failure and defective of PCR machine were given zero due to rare likelihood of the events in general. It was concluded that this feasibility study is worth being a means to introduce the novel technique, FTA, to the management of faults in running PCR analysis.