• Journal of applied mathematics & informatics
• /
• 제40권3_4호
• /
• pp.531-543
• /
• 2022

The article proposed a new type of data relationship: Positive Boolean dependencies by groups on block and slice in the database model of block form, where instead of considering value pairs, we consider a group of p values (p ≥ 2). From this new concept, the article stated and demonstrated the equivalence of the three types of deduction, namely: deduction by logic, deduction by block with groups, deduction by block has no more than p elements with groups. Operations on blocks or slices performed for index attributes on blocks, the properties related to this new concept as theorem the equivalen of the three types of deduction, closure of set positive Boolean dependencies by groups and representation and tight representation set of positive Boolean dependencies by groups when the block degenerated into relation are true in the relational database model and also stated and proven in this paper.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.1325-1328
• /
• 2006

본 논문은 기계 가공시 형상의 인지 절차에 대해 기술한다. 주조와 단조 공정의 특성 중 한가지는 기계 가공시 원재료가 최종 형상에 매우 근접하다는 것이다. 이때 가공 형상 추출은 가공될 면을 인지하는 것과 가공면을 군집으로 그룹화 하는 두 단계로 수행될 수 있다. 이중 가공될 면을 인지하기 위한 기존의 방법은 3D Boolean difference operation을 수행하는 것이다. 그러나 3D Boolean difference operation의 계산적 난점 때문에 복잡한 형상에는 실용적이지 못하다. 본 논문의 목적은 가공 면을 인지하는 효율적인 알로리즘을 개발하는 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.5171-5189
• /
• 2016

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• 전기의세계
• /
• 제28권8호
• /
• pp.57-65
• /
• 1979

This paper is concerned with not only the transformation of the logic diagrams to the NAND and the NOR forms but also the inverse transformation deriving the simple Boolean function from a logic diagram. The conversions of the algebraic expression from the AND, OR and NOT operations to the NAND and the NOR operations are usually quite complicated, because they involve a large number of repeated applications of De Morgan's Theorem and the other logic relations. For the derivation of the Boolean function, it becomes difficult because the Boolean function is determined from the De Morgan's theorem in consecutive order until the output is expressed in terms of input variables (9). But, these difficulties are avoided by the use of new techniques, called the TWO-NOTs method and the MOVING-NOT method, that are presented in this paper.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.141-149
• /
• 1998

One of the difficulties in using the current Boolean-based information retrieval systems is that it is hard for a user, especially a novice, to formulate an effective Boolean query. One solution to this problem is to let the system formulate a query for a user from his relevance feedback documents in this research, an intelligent query reformulation mechanism based on ID3 is proposed and the sensitivity of its retrieval effectiveness, i.e., recall, precision, and E-measure, to various input settings is analyzed. The parameters in the input settings is the number of relevant documents. Experiments conducted on the test set of Medlars revealed that the effectiveness of the proposed system is in fact sensitive to the number of the initial relevant documents. The case with two or more initial relevant documents outperformed the case with one initial relevant document with statistical significances. It is our conclusion that formulation of an effective query in the proposed system requires at least two relevant documents in its initial input set.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.419-419
• /
• 1996

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.198-198
• /
• 1996

• 한국CDE학회논문집
• /
• 제1권1호
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Journal of Applied and Pure Mathematics
• /
• 제5권1_2호
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

• 컴퓨터교육학회논문지
• /
• 제15권1호
• /
• pp.65-72
• /
• 2012

일반적으로 논리식은 수많은 인수분해식으로 표현이 가능하다. 논리식에 대한 보다 간략화된 인수분해식을 찾는 것이 논리합성의 기본 기능 중의 하나이며 본 논문에서 논리회로 수업의 교육용 도구로 부울 인수분해식을 산출하는 새로운 방법을 제안한다. 제안하는 방법은 서포트와 함께 2개의 항에 대한 나눗셈을 수행하는 것이다. 인수분해식의 리터럴 개수는 논리식의 간략화 정도를 판단하는 기준이 되는데, 제안하는 방법으로 실험한 결과, 기존의 타 방법들 보다 리터럴 개수를 줄이는 효과를 보였다.