• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.425-427
• /
• 1997

In this paper, a new approach to modeling and control of nonlinear systems using fuzzy theory is presented. To express the various and complex behavior of nonlinear system, we combine multiple model method with hierachical prioritized structure. The mountain clustering technique is used in partitioning of system, and TSK rule structure is adopted to form the fuzzy rules. Also we soften the paradigm of Mamdani's inference mechanism by using Yager's S-OWA operators.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.389-392
• /
• 2004

The column generation process for the set-partitioning model of the vehicle routing problem requires repeated solutions of column generation subproblems which has a combinatorial structure similar to that of the traveling salesman problem. This limits the size of the problem that can be addressed. We introduce a new modeling approach, termed route-splitting, which splits each vehicle route into segments, and results in more tractable subproblems. A lower bounding scheme that yields an updated bound at each iteration of the column generation process is developed. Implementation issues, including a technique of controlling columns in the master problem, are explored. Lower bounds are computed on standard benchmark problems with up to 199 customers.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2152-2162
• /
• 1997

We developed an approach to automatically synthesize time-stationary controllers for a given pipelined data path of Application Specific Integrated Circuits (ASICs). This work consists of automated production of control specifications and Finite State Machine (FSM) Optimization. A FSM controller is implemented by performing horizontal partitioning so as to minimize the total controller area. We compared our approach to published work on FSM generation and optimization, and the results indicate large savings in total controller area.

• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.4
• /
• pp.473-479
• /
• 2018

Objective: The study was designed to perform a genome-wide association (GWA) and partitioning of genome using Illumina's PorcineSNP60 Beadchip in order to identify variants and determine the explained heritability for the total number of teats in Yorkshire pig. Methods: After screening with the following criteria: minor allele frequency, $MAF{\leq}0.01$; Hardy-Weinberg equilibrium, $HWE{\leq}0.000001$, a pair-wise genomic relationship matrix was produced using 42,953 single nucleotide polymorphisms (SNPs). A genome-wide mixed linear model-based association analysis (MLMA) was conducted. And for estimating the explained heritability with genome- or chromosome-wide SNPs the genetic relatedness estimation through maximum likelihood approach was used in our study. Results: The MLMA analysis and false discovery rate p-values identified three significant SNPs on two different chromosomes (rs81476910 and rs81405825 on SSC8; rs81332615 on SSC13) for total number of teats. Besides, we estimated that 30% of variance could be explained by all of the common SNPs on the autosomal chromosomes for the trait. The maximum amount of heritability obtained by partitioning the genome were $0.22{\pm}0.05$, $0.16{\pm}0.05$, $0.10{\pm}0.03$ and $0.08{\pm}0.03$ on SSC7, SSC13, SSC1, and SSC8, respectively. Of them, SSC7 explained the amount of estimated heritability along with a SNP (rs80805264) identified by genome-wide association studies at the empirical p value significance level of 2.35E-05 in our study. Interestingly, rs80805264 was found in a nearby quantitative trait loci (QTL) on SSC7 for the teat number trait as identified in a recent study. Moreover, all other significant SNPs were found within and/or close to some QTLs related to ovary weight, total number of born alive and age at puberty in pigs. Conclusion: The SNPs we identified unquestionably represent some of the important QTL regions as well as genes of interest in the genome for various physiological functions responsible for reproduction in pigs.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.31-45
• /
• 2007

Large data handling is one of critical issues that the data mining community faces. This is particularly true for computationally intense tasks such as data clustering. Random sampling of instances is one possible means of achieving large data handling, but a pervasive problem with this approach is how to deal with the noise in the evaluation of the learning algorithm. This paper develops a new optimization based clustering approach using an algorithm specifically designed for noisy performance. Numerical results show this algorithm better than the other algorithms such as PAM and CLARA. Also with this algorithm substantial benefits can be achieved in terms of computational time without sacrificing solution quality using partial data.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1607-1616
• /
• 2006

The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.2
• /
• pp.101-110
• /
• 2001

The maximum intersection of spherical convex polygons are to find spherical regions owned by the maximum number of the polygons, which is applicable for determining the feasibility in manufacturing problems such mould design and numerical controlled machining. In this paper, an efficient method for partitioning a sphere with the polygons into faces is presented for the maximum intersection. The maximum intersection is determined by examining the ownerships of partitioned faces, which represent how many polygons contain the faces. We take the approach of edge-based partition, in which, rather than the ownerships of faces, those of their edges are manipulated as the sphere is partitioned incrementally by each of the polygons. Finally, gathering the split edges with the maximum number of ownerships as the form of discrete data, we approximately obtain the centroids of all solution faces without constructing their boundaries. Our approach is analyzed to have an efficient time complexity Ο(nv), where n and v, respectively, are the numbers of polygons and all vertices. Futhermore, it is practical from the view of implementation since it can compute numerical values robustly and deal with all degenerate cases.

• Environmental Analysis Health and Toxicology
• /
• v.12 no.3_4
• /
• pp.43-54
• /
• 1997

Species, doses and routes extrapolation can be sucessfully carried out by using a physiologically-based pharmacokinetic (PBPK) approach. And PBPK approach to assess risk of hazardous chemicals is reasonable whatever the exposure scenarios are happened. Both partitioning coefficients of chemical between tissue and blood and enzymatic metabolic rate constants are key parameters to build up the PBPK model. In this study, we tried to estimate in vitro metabolic rate constants using a special apparatus instead to measure the in vivo constants which are used to PBPK simulation since the in vitro tests are less expensive and more convenient than in vivo tests. For the purpose, we designed and tested the new system to measure continuously the headspace concentration of VOC. The newly designed system is composed with a diffusion chamber which generates gaseous substrate, a reaction vessel with a recirculating pump to establish a closed system, an autbmatic sampler from a gas phase, a gas chromatography to analyze the headspace. In addition, a cold water condenser is attached between the reaction vessel and pump to reduce the content of gaseous moisture which interferes with chemical analysis. To validate the newly developed methodology, in vitro metabolic rate constants of trichloroethylene (TCE) as a prototype VOC were estimated by simulating observed results with an ACSL program. The simulated results are consistent to those estimated by the other research groups. This finding suggests that our newly designed closed system may be a useful apparatus to estimate in vitro metabolic rate constants for VOC.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.1
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.43-54
• /
• 2003

Due to insufficient available bandwidth resources and the continuously growing demand for cellular communication services, the channel assignment problem has become increasingly important. To trace the optimal assignment, several heuristic strategies have been proposed. So far, most of them focus on the small-scale systems containing no more than 25 cells and they use an anachronistic cost model, which does not satisfy the requirements ity. Solving the small-scale channel assignment problems could not be applied into existing large scale cellular networks' practice. This article proposes a decomposition approach to solve the fixed channel assignment problem (FCAP) for large-scale cellular networks through partitioning the whole cellular network into several smaller sub-networks and then designing a sequential branch-and-bound algorithm that is made to solve the FCAP for them sequentially. The key issue of partition is to minimize the dependences of the sub-networks so that the proposed heuristics for solving smaller problems will suffer fewer constraints in searching for better assignments. The proposed algorithms perform well based on experimental results and they were applied to the Taiwan Cellular Cooperation (TCC) in ChungLi city to find better assignments for its network.