• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.571-578
• /
• 2002

In temporal database, extended time dimension for history management brings about complexity of join operation and increased cost. To solve this problem, a method that joins the divided segment time data after partition the time range into fixed time interval is introduced. But existing methods can't solve the ambiguity problem of time border that caused by temporal granularity in the partition point. In this paper, We suggested Fuzzy Minimum Interval Partition (FMIP) method that introduced the possibility distribution of fuzzy theory considered uncertainty time interval border in the partition line.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.9-16
• /
• 2002

Join operation exert a great effect on the performance of system in temporal database as in the relational database. Especially, as for the temporal join, the optimization of interval partition decides the performance of query processing. In this paper, to improve the efficiency of parallel join query in temporal database. I proposed Minimum Interval Partition(MIP) scheme that time interval partitioning. The validity of this MIP algorithm that decides minimum breakpoint of the partition is proved by example scenario and I confirmed improved efficiency as compared with existing partition algorithm.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.28 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.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.

• Journal of Sensor Science and Technology
• /
• v.33 no.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).

• Journal of Auto-vehicle Safety Association
• /
• v.7 no.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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.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.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.3
• /
• pp.97-104
• /
• 2002

In this paper we describe the method which optimizes the partition of the input space by means of measure of fuzziness for fuzzy neural network. It covers its generation of fuzzy rules for input sub space. It verifies the performance of the system depended on the various time interval of the input. This method divides the input space into several fuzzy regions and assigns a degree of each of the generated rules for the partitioned subspaces from the given data using the Shannon function and fuzzy entropy function generating the optimal knowledge base without the irrelevant rules. In this scheme the basic idea of the fuzzy neural network is to realize the fuzzy rule base and the process of reasoning by neural network and to make the corresponding parameters of the fuzzy control rules be adapted by the steepest descent algorithm. According to the input interval the proposed inference procedure proves that the fast convergence of root mean square error (RMSE) owes to the optimal partition of the input space

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.443-450
• /
• 2007

In this paper, we propose a novel threshold selection method based on statistical information on gray-levels of given images and interval-valued fuzzy sets. In the proposed threshold selection method, the interval-valued fuzzy set is used to represent more definitely the relationship between a pixel and its belonging region, that is, the object and the background. Also the statistical information on gray-level is used to determine the rules and partitions of interval-valued fuzzy sets. To show the validity of the proposed method, we compared the performance of the proposed with those of conventional methods such as Otsu's method, Huang and Wang's method applied to 5 test images with various types of histograms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.