• 제어로봇시스템학회논문지
• /
• 제16권3호
• /
• pp.264-268
• /
• 2010

The purpose of this paper is to propose new techniques to match measured optical images by using the edge abstraction method and differentiation method based on image processing technology. To do this, we detect the matching template and non-matching template from each optical image. And then, we detect the edge parts of the overlaped image from comer edge abstraction method and remove noise image. At last, these data are related to applied first-order derivative operator. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• Journal of Power Electronics
• /
• 제12권5호
• /
• pp.830-841
• /
• 2012

Active power filters (APF) can be employed for harmonic compensation in power systems. In this paper, a fuzzy based method is proposed for identification of probable APF nodes of a radial distribution system. The modified adaptive particle swarm optimization (MAPSO) technique is used for final selection of the APFs size. A combination of Fuzzy-MAPSO method is implemented to determine the optimal allocation and size of APFs. New fuzzy membership functions are formulated where the harmonic current membership is an exponential function of the nodal injecting harmonic current. Harmonic voltage membership has been formulated as a function of the node harmonic voltage. The product operator shows better performance than the AND operator because all harmonics are considered in computing membership function. For evaluating the proposed method, it has been applied to the 5-bus and 18-bus test systems, respectively, which the results appear satisfactorily. The proposed membership functions are new at the APF placement problem so that weighting factors can be changed proportional to objective function.

• Genomics & Informatics
• /
• 제14권4호
• /
• pp.187-195
• /
• 2016

In genetic association studies with high-dimensional genomic data, multiple group testing procedures are often required in order to identify disease/trait-related genes or genetic regions, where multiple genetic sites or variants are located within the same gene or genetic region. However, statistical testing procedures based on an individual test suffer from multiple testing issues such as the control of family-wise error rate and dependent tests. Moreover, detecting only a few of genes associated with a phenotype outcome among tens of thousands of genes is of main interest in genetic association studies. In this reason regularization procedures, where a phenotype outcome regresses on all genomic markers and then regression coefficients are estimated based on a penalized likelihood, have been considered as a good alternative approach to analysis of high-dimensional genomic data. But, selection performance of regularization procedures has been rarely compared with that of statistical group testing procedures. In this article, we performed extensive simulation studies where commonly used group testing procedures such as principal component analysis, Hotelling's $T^2$ test, and permutation test are compared with group lasso (least absolute selection and shrinkage operator) in terms of true positive selection. Also, we applied all methods considered in simulation studies to identify genes associated with ovarian cancer from over 20,000 genetic sites generated from Illumina Infinium HumanMethylation27K Beadchip. We found a big discrepancy of selected genes between multiple group testing procedures and group lasso.

• 한국지능시스템학회논문지
• /
• 제7권4호
• /
• pp.82-92
• /
• 1997

본 논문에서는, 퍼지 측도와 퍼지 적분을 이용한 상호 작용 시스템의 모델 및 이의 식별볍을 제시한다. 모델 식별은 다음과 같은 세 단계를 거쳐 이루어 지는데, 그 첫번째는 모델의 구조 식별이고 두번째는 식별된 구조를 갖는 모델의 파라메터 식별이다. 그리고 마지막으로는 식별된 구조와 파라메터를 갖는 모델의 최적성을 판단하여, 최적의 모델을 선정하게 된다. 본 논문에서는 최적 모델의 식별을 위하여 유전자 알고리즘 및 통계적 모델 선택 기준을 이용하여, 최적 모델들의 후보군으로부터 최적모델을 선정하는 알고리즘을 제시한다. 본 논문에서 제시된 모델 및 이의 식별법의 타당성을 보이기 위하여, 주관적 평가 데이타 및 시계열 데이타에 적용하여 그 결과를 나타내었으며, 또한 기존의 다른 모델들로부터 얻어진 결과와 비교 검토하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3133-3151
• /
• 2012

The optimal price strategy selection of two bounded rational cognitive mobile virtual network operators (MVNOs) in a duopoly spectrum sharing market is investigated. The bounded rational operators dynamically compete to sell the leased spectrum to secondary users in order to maximize their profits. Meanwhile, the secondary users' heterogeneous preferences to rate and price are taken into consideration. The evolutionary game theory (EGT) is employed to model the dynamic price strategy selection of the MVNOs taking into account the response of the secondary users. The behavior dynamics and the evolutionary stable strategy (ESS) of the operators are derived via replicated dynamics. Furthermore, a reward and punishment mechanism is developed to optimize the performance of the operators. Numerical results show that the proposed evolutionary algorithm is convergent to the ESS, and the incentive mechanism increases the profits of the operators. It may provide some insight about the optimal price strategy selection for MVNOs in the next generation cognitive wireless networks.

• Genomics & Informatics
• /
• 제20권4호
• /
• pp.48.1-48.7
• /
• 2022

Penalized regression has been widely used in genome-wide association studies for joint analyses to find genetic associations. Among penalized regression models, the least absolute shrinkage and selection operator (Lasso) method effectively removes some coefficients from the model by shrinking them to zero. To handle group structures, such as genes and pathways, several modified Lasso penalties have been proposed, including group Lasso and sparse group Lasso. Group Lasso ensures sparsity at the level of pre-defined groups, eliminating unimportant groups. Sparse group Lasso performs group selection as in group Lasso, but also performs individual selection as in Lasso. While these sparse methods are useful in high-dimensional genetic studies, interpreting the results with many groups and coefficients is not straightforward. Lasso's results are often expressed as trace plots of regression coefficients. However, few studies have explored the systematic visualization of group information. In this study, we propose a multi-level polar Lasso (MP-Lasso) chart, which can effectively represent the results from group Lasso and sparse group Lasso analyses. An R package to draw MP-Lasso charts was developed. Through a real-world genetic data application, we demonstrated that our MP-Lasso chart package effectively visualizes the results of Lasso, group Lasso, and sparse group Lasso.

• 대한수학회보
• /
• 제40권4호
• /
• pp.677-683
• /
• 2003

In multi-allelic model $X\;=\;(x_1,\;x_2,\;\cdots\;,\;x_d),\;M_f(t)\;=\;f(p(t))\;-\;{\int_0}^t\;Lf(p(t))ds$ is a P-martingale for diffusion operator L under the certain conditions. In this note, we examine the stochastic differential equation for model X and find the properties using stochastic differential equation.

• Communications for Statistical Applications and Methods
• /
• 제18권6호
• /
• pp.733-739
• /
• 2011

The linear absolute shrinkage and selection operator(Lasso) method improves the low prediction accuracy and poor interpretation of the ordinary least squares(OLS) estimate through the use of $L_1$ regularization on the regression coefficients. However, the Lasso is not robust to outliers, because the Lasso method minimizes the sum of squared residual errors. Even though the least absolute deviation(LAD) estimator is an alternative to the OLS estimate, it is sensitive to leverage points. We propose a robust Lasso estimator that is not sensitive to outliers, heavy-tailed errors or leverage points.

• 한국CDE학회논문집
• /
• 제1권1호
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Genomics & Informatics
• /
• 제14권4호
• /
• pp.149-159
• /
• 2016

With the success of the genome-wide association studies (GWASs), many candidate loci for complex human diseases have been reported in the GWAS catalog. Recently, many disease prediction models based on penalized regression or statistical learning methods were proposed using candidate causal variants from significant single-nucleotide polymorphisms of GWASs. However, there have been only a few systematic studies comparing existing methods. In this study, we first constructed risk prediction models, such as stepwise linear regression (SLR), least absolute shrinkage and selection operator (LASSO), and Elastic-Net (EN), using a GWAS chip and GWAS catalog. We then compared the prediction accuracy by calculating the mean square error (MSE) value on data from the Korea Association Resource (KARE) with body mass index. Our results show that SLR provides a smaller MSE value than the other methods, while the numbers of selected variables in each model were similar.