• 정보처리학회논문지D
• /
• 제9D권4호
• /
• pp.571-578
• /
• 2002

시간 데이터베이스에서 데이터의 이력 관리를 목적으로 확장된 시간 차원은 조인 연산에 대한 복잡도와 연산 비용의 증가를 초래한다. 이와 같은 문제를 해결하기 위해 조인 연산의 대상이 되는 시간 범위를 일정 정도의 시간 간격으로 분할한 후 분할된 세그먼트 단위의 시간 데이터들을 조인하는 방법이 제안되었다. 하지만 기존의 방법들은 분할점 근방에서 분할에 적용된 시간 단위 등의 문제로 인해 발생하는 시간 경계의 모호성 문제를 해결할 수 없다. 이러한 문제를 해결하기 위해 이 논문에서는 분할선 근방의 경계가 불확실한 시간 간격을 고려한 분할 방법으로 퍼지 이론의 가능성 분포를 도입한 퍼지 최소 간격 분할(Fuzzy Minimum Interval Partition : FMIP)기법을 제안하고 이를 기존 기법들과 비교 평가함으로써 FMIP의 타당성을 검증한다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제8권1호
• /
• pp.9-16
• /
• 2002

조인 연산은 관계형 데이타베이스에서와 같이 시간 데이타베이스에서도 시스템 성능에 큰 영향을 미친다. 특히, 시간 조인은 조인 연산 단계 이전에 간격 분할의 최적화가 질의 처리 성능을 결정한다. 이 논문에서는 시간 데이타베이스의 병렬 조인 질의 처리 성능을 개선하기 위해 시간 조인 연산을 위한 시간 간격을 분할하는 최소 분할 기법을 제안하였고, 제안된 간격 분할의 최소 분할점을 결정하는 최소 간격 분할 알고리즘의 유효성은 예제 시나리오를 통해 검증하였으며, 기존 분할 알고리즘에 비해 성능 개선 효과가 있음을 확인하였다.

• 한국조경학회지
• /
• 제28권3호
• /
• pp.97-104
• /
• 2000

Studies on the principle of traditional moulding techniques of architecture or structure are very important in the point of the work could accomplish succession to modern design. As an attempt of these work, this study tried to examine traditional moulding techniques applied in planes of ancient architecture and structure closely. The major findings of this study are summarized as follows; It was verified that planes of ancient Korean architectures and structures analyzed in this study was moulded by its multiple partitions with the six or eight partitions of circumference as the fundamental form. The well unearthed in kyong-bok palace recently was moulded by a concentric circle assumed form of 4 circle which was extended with equal interval and divided into multiple of 8 partition of circumference. Chon-duk-jung in chang-duk palace also was moulded by a concentric circle assumed form of 3 circle extended with equal interval, but circle were divide by 6 partitions. It was also found that 6$^{\circ}$§8 partitions of circumference(or its multiple partition) was applied to not only above structures but also the moulding planes of ancient architecture, and as a results, figures revealed in architectures analyzed is classified into three classes. And, this study analyzed arrangements of two temples. As a results, it is discovered that the Grid used in moulding planes of each building fixed the arrangement of buildings. Therefore, moulding by equal partition of circumference decided the form of each building and the relation of element at the same time.

• 대한수학회보
• /
• 제31권2호
• /
• pp.237-242
• /
• 1994

One of the most well-known geometric lattices is a partition lattice. Every upper interval of a partition lattice is a partition lattice. The whitney numbers of a partition lattices are the Stirling numbers, and the characteristic polynomial is a falling factorial. The set of partitions with a single non-trivial block containing a fixed element is a Boolean sublattice of modular elements, so the partition lattice is supersolvable in the sense of Stanley [6]. In this paper, we rephrase four results due to Heller[1] and Murty [4] in terms of matroids and give several characterizations of partition lattices. Our notation and terminology follow those in [8,9]. To clarify our terminology, let G, be a finte geometric lattice. If S is the set of points (or rank-one flats) in G, the lattice structure of G induces the structure of a (combinatorial) geometry, also denoted by G, on S. The size vertical bar G vertical bar of the geometry G is the number of points in G. Let T be subset of S. The deletion of T from G is the geometry on the point set S/T obtained by restricting G to the subset S/T. The contraction G/T of G by T is the geometry induced by the geometric lattice [cl(T), over ^1] on the set S' of all flats in G covering cl(T). (Here, cl(T) is the closure of T, and over ^ 1 is the maximum of the lattice G.) Thus, by definition, the contraction of a geometry is always a geometry. A geometry which can be obtained from G by deletions and contractions is called a minor of G.

• 센서학회지
• /
• 제33권1호
• /
• pp.1-6
• /
• 2024

This study aims to suggest the partition ratio (Q-factor) of healthy Koreans and the comparison results of breath alcohol concentration (BAC) measurements using two methods (photoacoustic and electrochemical methods) for developing breath alcohol ignition interlock devices (BAIIDs). Given the relationship between BACs and BrACs and the Q-factor, the alcohol metabolism of healthy Koreans (96 males and 91 females) is revealed for understanding the digestion of alcohol and surveying the fundamental data of alcohol-related problems, CO₂ concentrations vs. alcohol concentrations, and the performance of alcohol sensors in the marketplace. The average Q-factor of healthy Korean males and females are 1,913 (95% confidence interval from 1,889-1,937) and 1,991 (95% confidence interval from 1,945-2,036). Photoacoustic measurements could be applied to predict the BACs of drinkers, which is confirmed by the Bland-Altman plots presented in this study. The biases based on the partition ratios (Q=1,913 and Q=1,991) in the Bland-Altman plots were -0.0004% (95% CI from -0.0011 to +0.0003% for males) and -0.0017% (95% CI from -0.020 to +0.017% for females).

• 자동차안전학회지
• /
• 제7권4호
• /
• pp.9-15
• /
• 2015

The relationship between BAC(Blood Alcohol Concentrations) and BrACs(Breath Alcohol Concentrations) and also partition ratio of healthy Korean adult males (96 males) are researched in this paper and its dependency is described according to TBW (total body water), BMI (body mass index), BFM (body fat mass), and PBF (percentage of body fat). Among the above four variables, TBW affects significantly to the partition ratio compared to the other variables. The partition ratio of Korean healthy males showed 1,913 (95 % Confidence Interval (C.I.) from 1,889 to 1,937) for the whole time intervals. However, when Q was averaged after 60 minutes later, its values was 2,011 (95 % C.I. from 1,982 to 2,040). Bland-Altman plots showed the compatibility of measurement methods of multi-gas analyzer, and the biases according to the partition ratios (Q=2,100 and Q=1,913) gave -0.0052 % (95 % CI from -0.0059 to -0.0045%) and -0.0004 % (95 % CI from -0.0011 to +0.0003%), respectively.

• 전기학회논문지
• /
• 제60권11호
• /
• pp.2157-2164
• /
• 2011

In this paper, we introduce a new category of fuzzy inference system based on Type-2 fuzzy c-means clustering algorithm (T2FCM-based FIS). The premise part of the rules of the proposed model is realized with the aid of the scatter partition of input space generated by Type-2 FCM clustering algorithm. The number of the partition of input space is composed of the number of clusters and the individual partitioned spaces describe the fuzzy rules. Due to these characteristics, we can alleviate the problem of the curse of dimensionality. The consequence part of the rule is represented by polynomial functions with interval sets. To determine the structure and estimate the values of the parameters of Type-2 FCM-based FIS we consider the successive tuning method with generation-based evolution by means of real-coded genetic algorithms. The proposed model is evaluated with the use of numerical experimentation.

• 대한전자공학회논문지TE
• /
• 제39권3호
• /
• pp.97-104
• /
• 2002

이 논문에서는 퍼지뉴럴 시스템을 위하여 measure of fuzziness에 의한 입력공간의 분할을 최적화하는 방법을 제안한다. 이에 따라 최적화된 퍼지 부공간에 대하여 퍼지 제어규칙을 자동으로 생성하는 방법을 제안한다. 또한 시계열 예측 문제에서 입력패턴의 간격을 조정하여 그 성능을 검증한다. 이 방법은 샤논 함수와 index of fuzziness를 이용하여 입력공간을 분할하고, 분할된 부 공간에 대해 입력 데이터와 부합할 수 있는 각각의 규칙에 등급을 정하여 불필요한 제어규칙을 제거하여 최적의 규칙베이스를 구성하도록 한다. 적용되는 퍼지 신경망의 기본적인 구조는 퍼지 제어기의 규칙베이스와 추론의 과정을 신경회로망을 이용하여 구현하며 퍼지 제어규칙의 매개변수들은 최대 급경사 강하법에 의해 적응되어진다. 제안된 알고리즘을 토대로 여덟 가지의 입력패턴에 대하여 추론한 결과 입력공간의 최적분할에 의하여 수렴과정에서 초기에 오차(RMSE)가 빠르게 수렴함을 알 수 있었다.

• 한국지능시스템학회논문지
• /
• 제17권4호
• /
• pp.443-450
• /
• 2007

본 논문에서는 주어진 영상의 그레이 레벨에 대한 통계적 정보와 구간값 퍼지집합에 기반을 둔 새로운 임계값 선택 방법을 제안한다. 제안한 임계값 선택 방법에서 구간값 퍼지집합은 영상의 픽셀과 그들이 속하는 영역, 즉 물체와 배경 간의 관계를 더욱 명확하게 나타내기 위해서 사용되고, 통계적 정보는 구간값 퍼지집합의 규칙과 파티션을 결정하기 위해서 이용된다. 제안한 방법의 타당성을 보이기 위해 다양한 형태의 히스토그램을 가진 5개의 테스트 영상들을 기존의 임계값 선택방법인 Otsu 방법과 Huang과 Wang의 방법과 비교하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2761-2781
• /
• 2018

With the continuous growth of data size and the use of compression technology, data reduction has great research value and practical significance. Aiming at the shortcomings of the existing semantic compression algorithm, this paper is based on the analysis of ItCompress algorithm, and designs a method of bidirectional order selection based on interval partitioning, which named An Optimized Iterative Semantic Compression Algorithm (Optimized ItCompress Algorithm). In order to further improve the speed of the algorithm, we propose a parallel optimization iterative semantic compression algorithm using GPU (POICAG) and an optimized iterative semantic compression algorithm using Spark (DOICAS). A lot of valid experiments are carried out on four kinds of datasets, which fully verified the efficiency of the proposed algorithm.