• Communications of the Korean Mathematical Society
• /
• v.10 no.2
• /
• pp.285-292
• /
• 1995

Some nonpath-connected orthomodular lattices are given : Every infinite direct product of othomodular lattices containing infinitely many non-Boolean factors is a nonpath-connected orthomodular lattice. The orthomodular lattice of all closed subspaces of an infinite dimensional Hilbert space is a nonpath-connected orthomodular lattice.

• Proceedings of the KIEE Conference
• /
• 1985.07a
• /
• pp.242-245
• /
• 1985

논리회로의 합성이란 minimize된 Boolean Expression을 실재로 존재라는 TTL IC로 Implement시키는 과정을 말한다. 즉, IC pin assignment 의 과정인 것이다. 본 논문에서는 논리회로를 합성하는 expert system의 초보적인 형태를 제안하고 있다.

• The Pure and Applied Mathematics
• /
• v.17 no.4
• /
• pp.341-346
• /
• 2010

Category $E({\Omega},A)$ forms a topos. We study on some properties of the topos $E({\Omega},A)$. In particular, we show that $E({\Omega},A)$ is well-pointed.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.47-58
• /
• 2021

In this article, we completely determine the rings for which every element is a sum of a nilpotent and three tripotents that commute with one another. We discuss this property for some extensions of rings, including group rings.

• Genomics & Informatics
• /
• v.14 no.4
• /
• pp.160-165
• /
• 2016

Over the past decade, the detection of gene-gene interactions has become more and more popular in the field of genome-wide association studies (GWASs). The goal of the GWAS is to identify genetic susceptibility to complex diseases by assaying and analyzing hundreds of thousands of single-nucleotide polymorphisms. However, such tests are computationally demanding and methodologically challenging. Recently, a simple but powerful method, named "BOolean Operation-based Screening and Testing" (BOOST), was proposed for genome-wide gene-gene interaction analyses. BOOST was designed with a Boolean representation of genotype data and is approximately equivalent to the log-linear model. It is extremely fast, and genome-wide gene-gene interaction analyses can be completed within a few hours. However, BOOST can not adjust for covariate effects, and its type-1 error control is not correct. Thus, we considered two-step approaches for gene-gene interaction analyses. First, we selected gene-gene interactions with BOOST and applied logistic regression with covariate adjustments to select gene-gene interactions. We applied the two-step approach to type 2 diabetes (T2D) in the Korea Association Resource (KARE) cohort and identified some promising pairs of single-nucleotide polymorphisms associated with T2D.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1458-1467
• /
• 1999

VLSI 공정 기술이 발달하면서 이웃한 전선 간의 간격이 점점 더 가까워 지고 있으며, 그에 따라 인접 전선 간의 혼신 문제가 심각해지고 있다. 본 논문에서는 3층 그리드 채널 배선에 적용 가능한 혼신을 최소화시키는 배선층 할당 방법을 제안한다. 이 방법은 선형 의사 불린 최적화 기법에 맞도록 고안되었으며, 적절한 변수 선택 휴리스틱과 상한값 추정 방법을 통하여 최적의 결과를 짧은 시간 안에 찾아낸다. 실험 결과를 통하여, 일반적인 0/1 정수 선형 프로그래밍 기법과 비교하여 성능과 수행시간 면에서 우수함을 보인다. Abstract Current deep-submicron VLSI technology appears to cause crosstalk problem severe since it requires adjacent wires to be placed closer and closer. In this paper, we deal with a horizontal layer assignment problem for three layer HVH channel routing to minimize coupling capacitance, a main source of crosstalk. It is formulated in a 0/1 integer linear programming problem which is then solved by a linear pseudo boolean optimization technique. Experiments show that accurate upper bound estimation technique effectively reduces crosstalk in a reasonable amount of running times.

• Journal of Ocean Engineering and Technology
• /
• v.25 no.3
• /
• pp.47-52
• /
• 2011

3D geometric modeling has a lot of advantages in the field of design and manufacturing. Many manufacturing processes and production lines are using 3D geometric modeling technique. These help reduce the cost and time for manufacturing. The purpose of this study is the realization of a 3D cutting shape for an H-Beam used in ships and ocean plants. The complex 3D cutting shapes could be represented by using the boolean operation of basic figures. Graphic functions with parameters were used to simply define the basic figures. The developed system can show the complex cutting shape of an H-beam simply and quickly. This system can be utilized for the automatic cutting system for an H-beam.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.703-712
• /
• 2003

Today, documents existing on internet by the development of communication network increase in number. And it is required the information retrieval system that can efficiently acquire the necessary information. Most information retrieval systems retrieve documents using a simple keyword or a boolean query of keywords. But, the method is not fit for novice users to use and has many difficulties than user's dialogue query from the viewpoint of convenience and precise understanding for query. So, this paper has an aim to suggest the method that will cope with above problems and to design and implement a meta query processing system for information retrieval using Korean dialogue sentences. The system implemented in this paper can generates a new boolean query for a given Korean dialogue sentence and resolve lexical ambiguities through morphological analysis, syntactic analysis and extension of query using thesaurus.

• Journal of the Korean Society for information Management
• /
• v.7 no.1
• /
• pp.79-95
• /
• 1990

A retrieval technique was defined as a technique for comparing the document representations. So this study classified retrieval technique in terms of the charactristics of the retrieved set of documents and the representations that are used. The distinction is whether the set of retrieved documents contains only documents whose representations are an exact match with the query, or a partial match with query. For a partial match, the set of retrieved document will include also those that are an exact match with the query. Boolean-logic as one of the exact match retrieval techniques is in current in most of the large operational information retrieval systems despite of its problems and limitatlons. Partial match as an alternative technique has also various problems. Existing information retrieval systems are successful in aSSisting the user whose needs are well- defined (e.g. Boolean-logic), to retrieve relevant documents but it should be successful in providing retrieval assistance to the browser whose information requirements is ill-defined.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.661-670
• /
• 2008

In some applications of software engineering such as the verification of software model or embedded program, SAT solver is used. To practical use a SAT solver, a problem is encoded to a CNF formula, but because the formula has lower expressiveness than software models or source codes, optimal CNF encoding is required. In this paper, we propose optimal encoding techniques for the problem of "Selecting adjacent $k{\leq}n$ among n objects," Through experimental results we show the proposed constraint is efficient and correct to solve Japanese puzzle. As we know, this paper is the first study about CNF encoding for adjacency in BCC.