• Journal of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.267-298
• /
• 1999

A geometric construction of an exact algebraic formula for graded partition functions, of which a special one is the classical unrestricted partition function p(n), from a diophantine point of view is presented. Moreover, the involved process allows us to compute the value of a graded partition function in an inductive manner with a geometrically built-in self-error-checking ability at each step for correctness of the computed values of the partition function under consideration.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.721-724
• /
• 2006

This paper presents a method of the constructing the digital logic switching functions and realizing the circuit design using partition techniques. First of all, we introduce the necessity, background and concepts of the partition design techniques for the digital logic systems. Next, we discuss the definitions that are used in this paper. For the purpose of the circuit design for the digital logic switching functions, we discuss the extraction of the partition functions. Also we describe the construction method of the building block, that is called the building block, based on each partition functions. And we apply the proposed method to the example, and we compare the results with the results of the earlier methods. In result, we describe the control functions, it means that we obtain the effective cost in the digital logic design for any other earlier methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.793-794
• /
• 2011

This paper presents a method of the circuit design of the multiple-valued digital logic switching functions based on the modular techniques. Fisr of all, we introduce the necessity, background and concepts of the modular design techniques for the digital logic systems. Next, we discuss the definitions that are used in this paper. For the purpose of the circuit design for the multiple-valued digital logic switching functions, we discuss the extraction of the partition functions. Also we describe the construction method of the building block, that is called the modules, based on each partition functions. And we apply the proposed method to the example, we compare the results with the results of the earlier methods. In result, we decrease the control functions, it means that we obtain the effective cost in the digital logic design for any other earlier methods. In the future research, we require the universal module that traet more partition functions and more compact module.

• International journal of advanced smart convergence
• /
• v.1 no.2
• /
• pp.30-33
• /
• 2012

This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.

• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.551-555
• /
• 2011

In this note, we will give a short proof of an identity for cubic partition function.

• Korean Journal of Mathematics
• /
• v.26 no.2
• /
• pp.167-174
• /
• 2018

By acting the dihedral group $D_k$ on the set of k-tuple multi-partitions, we introduce k-gonal partitions for all positive integers k. We give generating functions for these new partition functions and investigate their arithmetic properties.

• Communications of the Korean Mathematical Society
• /
• v.11 no.3
• /
• pp.633-641
• /
• 1996

Let $P_J$ be a standard parabolic subgroup of a Chevalley group G and $U_J$ the unipotent radical of $P_J$. In this paper, we find a certain partition of the set of roots corresponding to root subgroups generating $U_J$ and investigate some properties of the partition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.398-399
• /
• 2019

This paper presents a method of the circuit design of the multiple-valued digital logic switching functions based on the modular techniques. Fisr of all, we introduce the necessity, background and concepts of the modular design techniques for the digital logic systems. Next, we discuss the definitions that are used in this paper. For the purpose of the circuit design for the multiple-valued digital logic switching functions, we discuss the extraction of the partition functions. Also we describe the construction method of the building block, that is called the modules, based on each partition functions. And we apply the proposed method to the example, we compare the results with the results of the earlier methods. In result, we decrease the control functions, it means that we obtain the effective cost in the digital logic design for any other earlier methods. In the future research, we require the universal module that traet more partition functions and more compact module.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.164-172
• /
• 1996

The partitioning of related objects should be performed before clustering for an efficient access in object-oriented databases. In this paper, a horizontal partition of related objects in object-oriented databases is presented. All subclass nodes in a class inheritance hierarchy of a schema graph are shrunk to a class node in the graph that is called condensed schema graph because the aggregation hierarchy has more influence on the partition than the class inheritance hierarchy. A set function and an accessibility function are defined to find a maximal subset of related objects among the set of objects in a class. A set function maps a subset of the domain class objects to a subset of the range class objects. An accessibility function maps a subset of the objects of a class into a subset of the objects of the same class through a composition of set functions. The algorithm derived in this paper is to find the related objects of a condensed schema graph using accessibility functions and set functions. The existence of a maximal subset of the related objects in a class is proved to show the validity of the partition algorithm using the accessibility function.

• 전기의세계
• /
• v.23 no.4
• /
• pp.53-59
• /
• 1974

This paper investigates the theoretical properties of a logic element called the multithreshold threshold element, which is a generalization of the single-threshold threshold element. The primary partition os a systematic method of obtaining the multi-threshold realization of a switching function by the index numbers. The concept of comparable vertices of the same index numbers introduced in this paper is very promising for testing the multi-threshold partition by the initial condition to be defined by the minterms of the same index numbers.