• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.123-132
• /
• 2005

A version control system is used in a rapidly changed environment or a program which developed in a complicated environment. And configuration thread information supporting and it's processing method has an important part in version control. Configuration thread tool such as a system model of DSEE, a view of ClearCase, a label of SourceSafe, and the package of CCC/Harvest have applied to formalized configuration rule by user and obtained a desired configuration information of the version. But it is a problem of configuration thread in supporting information that we. in this method. can't know a exactly well-defined configuration rule information and a predefined information. And these information have a demerit that can't supported the close connection along with undefined version and a meta-information. In this paper. we have modeling a system for these problems to solve and a efficiently configuration thread supported. We also proposed a mixed retrieval model included a boolean retrieval model and a vector retrieval model for support efficiently configuration thread information. We applied and designed the libraries using extended facet method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.1
• /
• pp.1-7
• /
• 2007

An MTJ element not only computes Boolean function but also stores the output result in itself. We can make the most use of magneto-logic's merits by employing the magneto-logic in substitution for the sequential logic as well as the combinational logic. This unique feature opens a new horizon for potential application of MTJ as a universal logic element. Magneto-logic circuits using MTJ elements are more integrative and non-volatile. This paper presents novel 3-bit magneto-logic up/down counters and presents simulation results based on the HSPICE macro-model of MTJ that we have developed.

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

• International journal of advanced smart convergence
• /
• v.13 no.3
• /
• pp.259-266
• /
• 2024

One of the most time consuming issues in a city development is the identification of suitable areas for urban infrastructures and proper land uses. Suitability analysis is the process and procedures to find the best available land in given area -that is, the ability of a system to select the needs of users in land use. This paper studied the usage of Geographic Information System technique and methods for the selection of the most appropriate sites for public park in the city of Gwangju. GIS was used as a standard technique to find the best available sites for development in urban areas. For this cause, digital elevation model and spatial data were used to produce different thematic layers by using software Idrisi. Criteria for finding the suitable site for park development were decided to evaluate the land and the followings 4 criteria were selected: on land with less than 3 degrees in slope, outside a 200m buffer around lakes, on land currently designated as forests, and 20ha or greater in size. To meet and measure each criterion, distance and context operators were applied to reclassify the importance of certain weight and Boolean images were generated to meet the criteria. These weights and maps has been combined using ArcGIS tools and the final map was prepared showing the most suitable sites. We may assist city planners and government officials in future development of public facilities including parks and related land use plans at urban level and act as to ensure proper land use planning and management of the urban areas.

• Korean Journal of Cognitive Science
• /
• v.2 no.1
• /
• pp.193-204
• /
• 1990

This paper discusses a reasoning model of information retrieval with a hierarchical thesaurus.The model computes the conceptual distance between a query and an object,both are indexed with weighted terms from a hierarchical thesaurus. The proposed model allows Boolean operators for user queries and edge weights for a hierarchical thesaurus. Experimental results have shown that the proposed model simulates, with surprising accuracy, people in the assessment of conceptual closeness between queries objects.

• The Journal of Society for e-Business Studies
• /
• v.19 no.3
• /
• pp.107-123
• /
• 2014

Current text mining techniques suffer from the problem that the conventional text representation models cannot express the semantic or conceptual information for the textual documents written with natural languages. The conventional text models represent the textual documents as bag of words, which include vector space model, Boolean model, statistical model, and tensor space model. These models express documents only with the term literals for indexing and the frequency-based weights for their corresponding terms; that is, they ignore semantical information, sequential order information, and structural information of terms. Most of the text mining techniques have been developed assuming that the given documents are represented as 'bag-of-words' based text models. However, currently, confronting the big data era, a new paradigm of text representation model is required which can analyse huge amounts of textual documents more precisely. Our text model regards the 'concept' as an independent space equated with the 'term' and 'document' spaces used in the vector space model, and it expresses the relatedness among the three spaces. To develop the concept space, we use Wikipedia data, each of which defines a single concept. Consequently, a document collection is represented as a 3-order tensor with semantic information, and then the proposed model is called text cuboid model in our paper. Through experiments using the popular 20NewsGroup document corpus, we prove the superiority of the proposed text model in terms of document clustering and concept clustering.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.1
• /
• pp.89-99
• /
• 1993

A solid modeller was developed in this paper. Representation scheme of modelling is nonmanifold B-rep. While namy B-rep modellers use edges as basic element of modelling, this modeller is triangle-based. New modelling element, split triangle that is composed of 3 pure half-edges and has no information about the adjoining triangles, was defined to enlarge the range of representation. Corresponding algorithms for Boolean set operations were also developed.

• Journal of the Korean Society for information Management
• /
• v.19 no.1
• /
• pp.47-69
• /
• 2002

The concept based retrieval model has shown a higher performance than those of the simple matching function method or the P-norm retrieval method introduced to compensate the demerits of the Boolean retrieval model. However. it takes too long to create a semantic-net knowledge base, which is essential in concept exploration. In order to solve such demerits. a method was sought out by creating a distributed knowledge base by subjects to reduce construction time without hindering the performance of retrieval.