• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.127-135
• /
• 2011

Efficient ordering of decision variables is one of the methods that find solutions quickly in the depth first search using backtracking. At this time, development of variables ordering algorithms considering dynamic and static properties of the problems is very important. However, to exploit optimal variable ordering algorithms appropriate to the problems. In this paper, we propose a problem classifying rule which provides problem type based on variables' properties, and use this rule to predict optimal type of variable ordering algorithms. We choose frequency allocation problem as a DS-type whose decision variables have dynamic and static properties, and estimate optimal variable ordering algorithm. We also show the usefulness of problem classifying rule by applying base station problem as a special case whose problem type is not generated from the presented rule.

• The Korean Journal of Applied Statistics
• /
• v.21 no.5
• /
• pp.875-888
• /
• 2008

Mosaic plots, proposed by Hartigan and Kleiner (1981, 1984), are very useful in visualizing categorical data. In mosaic plot, multi-way classified cell frequencies are represented by rectangles with proportional area. The plot is easy to understand while preserving the information contained in the data. Plot's appearance, however, does change substantially depending on the order of variables and the orders of categories with variable put into the plot. In this study, we propose the algorithms for ordering variables and categories of the categorical data to be explored via mosaic plots. We demonstrate our methods to three well-known datasets: Titanic, Housing and PreSex.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2113-2119
• /
• 1998

The optimization problem of BDDs plays an improtant role in the area of logic synthesis and formal verification. Since the variable ordering has great impacts on the size and form of BDD, finding a good variable order is very important problem. In this paper, a new variable ordering scheme called incremental optimization algorithm is presented. The proposed algorithm reduces search space more than a half of that of the conventional sifting algorithm, and computing time has been greatly reduced withoug depreciating the performance. Moreover, the incremental optimization algorithm is very simple than other variable reordering algorithms including the sifting algorithm. The proposed algorithm has been implemented and the efficiency has been show using may benchmark circuits.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1020-1023
• /
• 2008

멀티스레드 프로그램의 효과적인 디버깅을 위해서는 스레드의 비결정성에 의해 야기되는 다양한 수행 양상의 직관적인 이해가 중요하다. 스레드 수행 양상을 시각화하는 기존의 기법들은 공유 변수의 접근사건들 간의 부분 순서를 표현함으로써 시각적 복잡도가 높거나 이전 수행에서 결정된 락킹 순서를 표현하여 잠재되어 있는 다른 수행 양상에 대한 정보를 제공하지 못 한다. 본 논문은 프로그램 수행의 비결정적인 부분 순서는 락의 종류와 속성을 포함하는 코드 블록으로 시각화하고, 결정적인 부분 순서는 블록들을 연결하는 간선으로 시각화한다. 본 연구의 그래프는 플랫폼에 독립적인 Java Swing으로 구현하고 합성 프로그램을 사용하여 효과성을 실험한다.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

• Journal of Intelligence and Information Systems
• /
• v.7 no.2
• /
• pp.51-63
• /
• 2001

In supervised machine learning, an induction algorithm, which is able to extract rules from data with learning capability, provides a useful tool for data mining. Practical induction algorithms are known to degrade in prediction accuracy and generate complex rules unnecessarily when trained on data containing superfluous features. Thus it needs feature subset selection for better performance of them. In feature subset selection on the induction algorithm, wrapper method is repeatedly run it on the dataset using various feature subsets. But it is impractical to search the whole space exhaustively unless the features are small. This study proposes a heuristic method that uses sensitivity analysis of neural networks to the wrapper method for generating rules with higher possible accuracy. First it gives priority to all features using sensitivity analysis of neural networks. And it uses the wrapper method that searches the ordered feature space. In experiments to three datasets, we show that the suggested method is capable of selecting a feature subset that improves the performance of the induction algorithm within certain iteration.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1937_1938
• /
• 2009

이 논문에서는 1차원 혼돈맵들 중의 하나인 톱니맵을 8비트의 유한정밀도로 이산화시켜 설계하였고, 이 이산화된 톱니맵을 사용한 혼돈 2진 순서 발생기의 회로도도 제시하였다. 설계된 혼돈맵의 실제 구현은 이산화된 진리표로부터 얻어진 출력변수의 간략화된 부울함수에 따른 입력선과 출력선들의 정확한 연결만에 의해 실현하였다. 최대길이를 발생시키는 선형궤환시프트레지스터(mLFSR)에 의해 발생되는 난수성 2진 출력 순서들을 이산화된 톱니맵의 입력순서로 사용함으로써 결과적으로 최소 8배 더 긴 주기를 갖는 혼돈 2진 순서들을 발생시켰다.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.

• The Korean Journal of Applied Statistics
• /
• v.33 no.1
• /
• pp.25-46
• /
• 2020

This paper presents ordinal probit semiparametric regression models using Bayesian Spectral Analysis Regression (BSAR) method. Ordinal probit regression is a way of modeling ordinal responses - usually more than two categories - by connecting the probability of falling into each category explained by a combination of available covariates using a probit (an inverse function of normal cumulative distribution function) link. The Bayesian probit model facilitates posterior sampling by bringing a latent variable following normal distribution, therefore, the responses are categorized by the cut-off points according to values of latent variables. In this paper, we extend the latent variable approach to a semiparametric model for the Bayesian ordinal probit regression with nonparametric functions using a spectral representation of Gaussian processes based BSAR method. The latent variable is decomposed into a parametric component and a nonparametric component with or without a shape constraint for modeling ordinal responses and predicting outcomes more flexibly. We illustrate the proposed methods with simulation studies in comparison with existing methods and real data analysis applied to a Korean National Health and Nutrition Examination Survey (KNHANES) 2016 for investigating nonparametric relationship between smoking behavior and coffee intake.

• 한국정보교육학회:학술대회논문집
• /
• 2010.01a
• /
• pp.347-352
• /
• 2010

현장에서 프로그래밍 교육은 교수 학습 방법 외에도 교육실습 환경을 위한 프로그래밍 교육용 시스템의 준비나 사용면에서도 어려움이 많다. 특히 C언어의 경우 적당한 교육용 시스템이 없어 일반 상업용 개발 툴을 이용하는데 그렇지 않아도 어렵다고 인식되는 C언어 교수 학습에 소프트웨어 도구마저 복잡하여 작지 않은 걸림돌이 되고 있다. 다양한 프로그래밍 언어가 있지만 현재는 구문 교육 및 논리 표현의 수월함과 결과 확인의 편리함에 우위를 가진 로고 계통의 언어 도구가 교육에서 많이 활용되고 있다. 이러한 점에 착안하여 본 연구에서는 기존 C언어 교육 환경을 개선하고 C언어를 효과적으로 교수 학습할 수 있도록 VPL요소로써 순서도 편집 및 자동 구현과 실행 시간 중 각종 흐름과 변수의 실시간 누적 시각화 시스템을 내포한 C언어 인터프리터와 학습 모듈 관리 및 사용자간 및 교수자와 교류하는 기능이 합쳐진 웹 기반 C 프로그래밍 언어 교육을 위한 시스템을 설계하였다.