• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1374-1385
• /
• 2004

The relevance feedback process uses information obtained from a user about an initially retrieved set of documents to improve subsequent search formulations and retrieval performance. In the extended Boolean model, the relevance feedback Implies not only that new query terms must be identified, but also that the terms must be connected with the Boolean AND/OR operators properly Salton et al. proposed a relevance feedback method for the extended Boolean model, called the DNF (disjunctive normal form) method. However, this method has a critical problem in generating a reformulated queries. In this study, we investigate the problem of the DNF method and propose a relevance feedback method using hierarchical clustering techniques to solve the problem. We show the results of experiments which are performed on two data sets: the DOE collection in TREC 1 and the Web TREC 10 collection.

• Journal of the Korean Society for Library and Information Science
• /
• v.33 no.2
• /
• pp.119-139
• /
• 1999

It Is the purpose of this research to analyse users' understanding how keyword and boolean search work in SELIS(SEoul Women's University Library and Information System) OPAC. Results of analyses of the subject, SELIS OPAC system processing, are: comprehension percentage of keyword extraction is $67(22.48\%)$ out of total 298 persons, no comprehension is $231(77.52\%)$ understanding of boolean OR In keyword search appears $115(22.48\%)$ out of 297, no understanding does $182(77.52\%)$ : comprehension of boolean AND is $98(33.11\%)$ out of 296, no understanding appears $198(66.89\%)$ understanding of using boolean and symbols is $109(36.49\%)$ out of 285, no understanding is $181(63.51\%)$ which Is lower percentage generally. And in SELIS OPAC system, in Intentional analyses to see any difference in understanding of keyword search between experience of keyword search or no, It shows no difference in interrelation $5\%$ level of significance, but In boolean search it does in interrelation $5\%$ level of significance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

• Journal of the Korean Society for information Management
• /
• v.11 no.1
• /
• pp.31-56
• /
• 1994

To evaluate the retrieval effectiveness of the B03lean Request Conversion Mod4 the Relevance Weighted Boolean Model, and the P-NORM Model, the present study has been done with expenmental tests. It is proven that the Relevance Weighted Bdean Model is more effective in precision and the document output ranks than the other ones. The expenmental results indmte a promisii application of relevance mformation and weigh- schemes.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.5
• /
• pp.9-19
• /
• 2011

In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

• 전기의세계
• /
• v.28 no.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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.531-536
• /
• 1998

It is well known that a Boolean algebra is one of the most important algebra for engineering. A fuzzy algebra, which is referred to also as a Kleen algebra, is obtained from a Boolean algebra by replacing the complementary law in the axioms of a Bloolean algebra with the Kleen's law, where the Kleen's law is a weaker condition than the complementary law. Removal of the Kleen's law from a Kleen algebra gives a De Morgan algebra. In this paper, we generate lattice structures of the above related algebraic systems having finite elements by using a computer. From the result, we could find out a hypothesis that the structure excepting for each element name between a Kleene algebra and a De Morgan algebra is the same from the lattice standpoint.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.339-343
• /
• 2005

Boolean networks(BN) construction is one of the commonly used methods for building gene networks from time series microarray data. However, BN has two major drawbacks. First, it requires heavy computing times. Second, the binary transformation of the microarray data may cause a loss of information. This paper propose two methods using liner regression to construct gene regulatory networks. The first proposed method uses regression based BN variable selection method, which reduces the computing time significantly in the BN construction. The second method is the regression based network method that can flexibly incorporate the interaction of the genes using continuous gene expression data. We construct the network structure from the simulated data to compare the computing times between Boolean networks and the proposed method. The regression based network method is evaluated using a microarray data of cell cycle in Caulobacter crescentus.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.715-718
• /
• 2002

This paper describes the Boolean and sectioning operations on pseudo-solid models. A pseudo-solid model is defined as a sheet body that looks like a solid model but cannot comprise a solid model due to tolerance. Most of CAD models imported from the other CAD system are pseudo-solid models and have to be repaired for further stolid modeling operations. However, healing a pseudo-solid model is a very tedious and cumbersome process. To solve this problem, we devised and implemented the Boolean and sectioning operations on pseudo-solid models. Using these operations, mold and die design can be performed more efficiently, as healing work is reduced greatly.