• International journal of advanced smart convergence
• /
• v.2 no.1
• /
• pp.12-17
• /
• 2013

This paper introduces the fuzzy scatter partition-based fuzzy inference system to construct the model for nonlinear process to analyze nonlinear characteristics. The fuzzy rules of fuzzy inference systems are generated by partitioning the input space in the scatter form using Fuzzy C-Means (FCM) clustering algorithm. The premise parameters of the rules are determined by membership matrix by means of FCM clustering algorithm. The consequence part of the rules is represented in the form of polynomial functions and the parameters of the consequence part are estimated by least square errors. The proposed model is evaluated with the performance using the data widely used in nonlinear process. Finally, this paper shows that the proposed model has the good result for high-dimension nonlinear process.

• Bulletin of the Korean Chemical Society
• /
• v.6 no.3
• /
• pp.128-131
• /
• 1985

A series of copolymer membranes of 2-hydroxyethylmethacrylate (HEMA) with selected hydrophobic monomers were prepared without crosslinking agents. The equilibrium water content, the partition coefficient, and the permeability of the solutes such as urea, methylurea, 1,3-di-methylurea, and acetamide via these membranes were measured. The partition coefficient data show that as the hydrophobicity of solutes increased, the partition of solutes were dictated by hydrophobic interaction between solute and polymer matrix. Diffusion coefficients obtained in these experiments decrease as the water content of polymer membrane decreases. This decrease is blunt as the excess heat capacities, ${\phi}C^0_p$ (excess) in aqueous solution at infinite dilution of solute increases. To investigate the relationship between water content and diffusion coefficient, the results of the diffusion experiments were examined in light of a free-volume model of diffusive transport. The remarkable increase of urea mobility in the polymer network containing relatively larger bulk water can be considered as water structure breaking effect.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.44-57
• /
• 1995

In this paper GFI (Generalized Fuzzy Isodata) and FI (Fuzzy Isodata) algorithms are studied and applied to the tire tread pattern classification problem. GFI algorithm which repeatedly grouping the partitioned cluster depending on the fuzzy partition matrix is general form of GI algorithm. In the constructing the binary tree using GFI algorithm cluster validity, namely, whether partitioned cluster is feasible or not is checked and construction of the binary tree is obtained by FDH clustering algorithm. These algorithms show the good performance in selecting the prototypes of each patterns and classifying patterns. Directions of edge in the preprocessed image of tire tread pattern are selected as features of pattern. These features are thought to have useful information which well represents the characteristics of patterns.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1625-1634
• /
• 2008

In this study, a modified Fuzzy C-Means algorithm with Gaussian weights (MFCM_GW) is presented for the problem of nonlinear blind channel equalization. The proposed algorithm searches for the optimal channel output states of a nonlinear channel based on received symbols. In contrast to conventional Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in this method. In the search procedure, all possible sets of desired channel states are constructed by considering the combinations of estimated channel output states. The set of desired states characterized by the maxima] value of the Bayesian fitness is selected and updated by using the Gaussian weights. After this procedure, the Bayesian equalizer with the final desired states is implemented to reconstruct transmitted symbols. The performance of the proposed method is compared with those of a simplex genetic algorithm (GA), a hybrid genetic algorithm (GA merged with simulated annealing (SA):GASA), and a previously developed version of MFCM. In particular, a relative]y high accuracy and a fast search speed have been observed.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.871-881
• /
• 2005

In 1977, Ganter and Teirlinck proved that any $2t\;\times\;2t$ matrix with 2t nonzero elements can be partitioned into four sub-matrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any $mt{\times}nt$ matrix with kt nonzero elements can be partitioned into mn submatrices of order t of which at most k contain nonzero elements. In 1995, Brualdi et al. showed that this conjecture is true if $m = 2,\;k\;\leq\;3\;or\;k\geq\;mn-2$. They also found a counterexample of this conjecture when m = 4, n = 4, k = 6 and t = 2. When t = 2, we show that this conjecture is true if $k{\leq}5$.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.4
• /
• pp.151-158
• /
• 2014

In this paper, we introduce an inference system using hard scatter partition method and model the nonlinear process. To do this, we use the hard scatter partition method that partition the input space in the scatter form with the value of the membership degree of 0 or 1. The proposed method is implemented by C-Means clustering algorithm. and is used for the initial center values by means of binary split. by applying the LBG algorithm to compensate for shortcomings in the sensitive initial center value. Hard-scatter-partitioned input space forms the rules in the rule-based system modeling. The premise parameters of the rules are determined by membership matrix by means of C-Means clustering algorithm. The consequence part of the rules is expressed in the form of polynomial functions and the coefficient parameters of each rule are determined by the standard least-squares method. The data widely used in nonlinear process is used to model the nonlinear process and evaluate the characteristics of nonlinear process.

• Macromolecular Research
• /
• v.11 no.4
• /
• pp.283-290
• /
• 2003

Organic drugs including aspirin, omeprazole, and naproxen with three different levels of octanol/water partition coefficient were examined for their release behavior from the amphiphilic PCL-b-PEO-b-PCL (PCEC) matrix. Scanning electron micrograph (SEM) of PCEC illustrated a well defined two-phase morphology consisted of dispersed poly(ethylene oxide) (PEO) domain and continuous polycaprolactone (PCL) phase. Differential scanning calorimetry (DSC) and X-ray diffractometry (XRD) experiments veri tied that three model drugs are dissolved as a molecular dispersion in PCEC matrix. The release of hydrophilic aspirin closely followed the water absorption profile of the matrix indicating that its major fraction is present in PEO domain. However, substantial amount of aspirin present in less hydrophilic region displayed discontinuous biphasic release pattern. In the case of omeprazole with intermediate hydrophobicity consistent release behavior was observed for a period of 24 hrs after the rapid liberation of ca. 10% of the drug presumably partitioned in PEO phase. It was ascribed to the fact that the progressive hydration of PCEC matrix gradually increased the chance of drug/water exposure to compensate the exhaustion of device. Naproxen with the highest octanol/water distribution coefficient among three model drugs exhibited a limited release of 35% for 24 hrs. Finally, hydroxypropyl methylcellulose phthalate (HPMCP)/PCEC blend matrix demonstrated an accelerated and quantitative release of hydrophobic naproxen by generating high porosity and thereby expanding polymer/water interface.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1857-1868
• /
• 2016

We consider a natural generalization of $h_2(n)$, denoted $h_m(n)$, which is the number of partitions of n into parts which are power of $m{\geq}2$ wherein each power of m is allowed to be used as a part at most m times. In this note, we approach in three different ways using the recurrences, the matrix and the tree to calculate the value of $h_m(n)$.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.494-498
• /
• 1996

Three fuzzy input space partitoining methods, which are grid, tree, and scatter method, are mainly used until now. These partition methods represent good performance in the modeling of the linear system and nonlinear system with independent modeling variables. But in the case of the nonlinear system with the coupled modeling variables, there should be many fuzzy rules for acquiring the exact fuzzy model. In this paper, it shows that the fuzzy model is acquired using transformed modeling vector by linear transformation of the modeling vector.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.685-695
• /
• 2022

The minimum number of complete bipartite subgraphs needed to partition the edges of a graph G is denoted by b(G). A known lower bound on b(G) states that b(G) ≥ max{p(G), q(G)}, where p(G) and q(G) are the numbers of positive and negative eigenvalues of the adjacency matrix of G, respectively. When equality is attained, G is said to be eigensharp and when b(G) = max{p(G), q(G)} + 1, G is called an almost eigensharp graph. In this paper, we investigate the eigensharpness and almost eigensharpness of lexicographic products of some graphs.