• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.125-132
• /
• 2023

To NP-complete 3-SAT problem, this paper proposes a O(nm) polynomial time algorithm, where n is the number of literals and m is the total frequency of all literals in equation f. Conventionally well-known DPLLs should perform O(2^𝑙) in the worst case by performing backtracking if they fail to find a solution in a brute-force search of a branch-and-bound for the number of literals 𝑙. DPLL forms the core of the SAT Solver by substituting true(T) or false(F) for a literal so that a clause containing the least frequency literal is true(T) and removing a clause containing that literal. Contrary to DPLL, the proposed algorithm selects a literal _max𝑙 with the maximum frequency and sets $_{\max}({\mid}l{\mid},{\mid}{\bar{l}}{\mid})=1$. It then deletes 𝑙∈c_i clause in addition to ${\bar{l}}$ from ${\bar{l}}{\in}c_i$ clause. Its test results on various k-SAT problems not only show that it performs less than existing DPLL algorithm, but prove its simplicity in satisfiability verification.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.13-17
• /
• 2024

In this paper, union-based rule antecedent neuro-fuzzy controller, which can guarantee a parsimonious knowledge base with reduced number of rules, is proposed. The proposed neuro-fuzzy controller allows union operation of input fuzzy sets in the antecedents to cover bigger input domain compared with the complete structure rule which consists of AND combination of all input variables in its premise. To construct the proposed neuro-fuzzy controller, we consider the multiple-term unified logic processor (MULP) which consists of OR and AND fuzzy neurons. The fuzzy neurons exhibit learning abilities as they come with a collection of adjustable connection weights. In the development stage, the genetic algorithm (GA) constructs a Boolean skeleton of the proposed neuro-fuzzy controller, while the stochastic reinforcement learning refines the binary connections of the GA-optimized controller for further improvement of the performance index. An inverted pendulum system is considered to verify the effectiveness of the proposed method by simulation and experiment.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.2
• /
• pp.189-209
• /
• 1998

The purpose of this study is to verify the difference of behavioral characteristics between the primary and secondary search, the influence of the primary search results on Online databases. Data is collected by surveying the professional and end-user searchers in 33 online information service centers. 262 valid responses out of 308 questionaire are analyzed by the t-test, ANOVA, $\chi^2-test$ using SAS program. The major findings are as follows : (1) Preparatory searches(the levels of expectation, the degree of question comprehension), search results(the number of output documents, precision ratio, recall ratio, degree of satisfaction) are significantly different between the primary and secondary searches on Online Databases. But the number of search terms, Boolean logics, files, systems, relevant documents are not significantly different between the primary and secondary searches. (2) The results of the primary search affect the secondary searches. The number of output documents in the primary search affect the modification of search strategies and objects in the secondary searches. The number of relevant documents affect the variation of search scopes in the secondary searches. The precision ratio affect the change of search strategies and scopes in the secondary searches.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.2
• /
• pp.177-187
• /
• 1999

Up to date, in many application fields of GSIS, we usually have used vector-based spatial overlay or grid-based spatial algebra for extraction and analysis of spatial data. But, because these methods are based on traditional crisp set, concept which is used these methods. shows that many kinds of spatial data are partitioned with sharp boundary. That is not agree with spatial distribution pattern of data in the real world. Therefore, it has a error that a region or object is restricted within only one attribution (One-Entity-one-value). In this study, for improving previous methods that deal with spatial data based on crisp set, we are suggested to apply into spatial overlay process the concept of fuzzy set which is good for expressing the boundary vagueness or ambiguity of spatial data. two methods be given. First method is a fuzzy interval partition by fuzzy subsets in case of spatially continuous data, and second method is fuzzy boundary set applied on categorical data. with a case study to get a land suitability map for the development site selection of new town, we compared results between Boolean analysis method and fuzzy spatial overlay method. And as a result, we could find out that suitability map using fuzzy spatial overlay method provide more reasonable information about development site of new town, and is more adequate type in the aspect of presentation.

• 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.45 no.12
• /
• pp.1-7
• /
• 2008

Magnetic Tunneling Junction (MTJ) has been used as a nonvolatile universal storage element mainly in memory technology. However, according to several recent studies, magneto-logic using MTJ elements show much potential in substitution for the transistor-based logic device. Magneto-logic based on MTJ can maintain the data during the power-off mode, since an MTJ element can store the result data in itself. Moreover, just by changing input signals, the full logic functions can be realized. Because of its programmability, it can embody the reconfigurable magneto-logic circuit in the rigid physical architecture. In this paper, we propose a novel 3-bit arbitrary magneto-logic circuit beyond the simple combinational logic or the short sequential one. We design the 3-bit magneto-logic which has the most complexity using MTJ elements and verify its functionality. The simulation results are presented with the HSPICE macro-model of MTJ that we have developed in our previous work. This novel magneto-logic based on MTJ can realize the most complex logic function. What is more, 3-bit arbitrary logic operations can be implemented by changing gate signals of the current drivel circuit.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.64-78
• /
• 2000

In this paper, we design and implement a system for managing domain specific thesauri, where object-oriented paradigm is applied to thesaurus construction, concept browsing and query-based reference. This system provides an objected-oriented mechanism to assist domain experts in constructing thesauri; it determines a considerable part of relationship degrees between terms by inheritance and supplies domain experts with information available from a thesaurus being constructed This information is especially useful to enforce consistency between the hierarchies of a thesaurus, each constructed by different experts in different sites through cooperation. It may minimize the burden of domain eIn this paper, we design and implement a system for managing domain specific thesauri, where object oriented paradigm is applied to thesaurus construction, concept browsing and query based reference. This system provides an objected mechanism to assist domain experts in constructing thesauri: it determines a considerable part of relationship degrees between terms by inheritance and supplies domain experts with information available from a thesaurus being constructed. This information is especially useful to enforce consistency between the hierarchies of a thesaurus, each constructed by different experts in different sites through cooperation. It may minimize the burden of domain experts caused from the exhaustive specification of individual relationship. This system also provides an abstracted browsing and a query based reference, which allow users to easily verify thesaurus terms before they are used in usual boolean queries. The verification is made by actively searching for them in the thesaurus. Reference queries and abstracted browsing views facilitate this searching. The facility is indispensable especially when precision counts for much.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.10-17
• /
• 2007

It opens a new horizon on spintronics for the potential application of MTJ as a universal logic element, to employ the magneto-logic in substitution for the transistor-based logic device. The magneto-logic based on the MTJ element shows many potential advantages, such as high density, and nonvolatility. Moreover, the MTJ element has programmability and can therefore realize the full logic functions just by changing the input signals. This magneto-logic using MTJ elements can embody the reconfigurable circuit to overcome the rigid architecture. The established magneto-logic element has been designed and fabricated on a triple-layer MTJ. We present a novel magneto-logic structure that consists of a single layer MTJ and a current driver, which requires less processing steps with enhanced functional flexibility and uniformity. A 4-bit gray counter is designed to verify the magneto-logic functionality of the proposed single-layer MTJ and the simulation results are presented with the HSPICE macro-model of MTJ that we have developed.

• 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.