• Communications for Statistical Applications and Methods
• /
• 제13권3호
• /
• pp.777-786
• /
• 2006

Two factorial designs with quantitative factors are called geometrically equivalent if the design matrix of one can be transformed into the design matrix of the other by row and column permutations, and reversal of symbol order in one or more columns. Clark and Dean (2001) gave a sufficient and necessary condition (which we call the 'gCD condition') for two symmetric factorial designs with quantitative factors to be geometrically equivalent. This condition is based on the absolute value of the Euclidean(or Hamming) distance between pairs of design points. In this paper we extend the gCD condition to asymmetric designs. In addition, a modified algorithm is applied for checking the equivalence of two designs.

• 한국멀티미디어학회논문지
• /
• 제20권10호
• /
• pp.1619-1627
• /
• 2017

Image hashing has been successfully applied for the problems associated with the protection of intellectual property, management of large database and indexation of content. For a reliable hashing system, improving hash matching accuracy is crucial. In order to improve the hash matching performance, we propose an asymmetric hash matching method using the psychovisual threshold, which is the maximum amount of distortion that still allows the human visual system to identity an image. A performance evaluation over sets of image distortions shows that the proposed asymmetric matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

• 한국멀티미디어학회논문지
• /
• 제23권1호
• /
• pp.8-14
• /
• 2020

For a reliable fingerprinting system, improving fingerprint matching accuracy is crucial. In this paper, we try to improve a binary image fingerprint matching performance by utilizing auxiliary information, power mask, which is obtained while constructing fingerprint DB. The power mask is an expected robustness of each fingerprint bit. A caveat of the power mask is the increased storage cost of the fingerprint DB. This paper mitigates the problem by reducing the size of the power mask utilizing spatial correlation of an image. Experiments on a publicly-available image dataset confirmed that the power mask is effective in improving fingerprint matching accuracy.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.306-315
• /
• 1995

This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algorithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.

• 대한수학회보
• /
• 제50권5호
• /
• pp.1513-1521
• /
• 2013

In this paper we will study cyclic codes over some special rings: $\mathbb{F}_q[u]/(u^i)$, $\mathbb{F}_q[u_1,{\ldots},u_i]/(u^2_1,u^2_2,{\ldots},u^2_i,u_1u_2-u_2u_1,{\ldots},u_ku_j-u_ju_k,{\ldots})$, and $\mathbb{F}_q[u,v]/(u^i,v^j,uv-vu)$, where $\mathbb{F}_q$ is a field with $q$ elements $q=p^r$ for some prime number $p$ and $r{\in}\mathbb{N}-\{0\}$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1551-1555
• /
• 1987

This paper proposes a new test generation algorithm to detect stuck-open faults regardless of tine-skews in CMOS circuits. For testing for stuck-open faults regardless of time-skews, in this method, Hamming distance between the initialization pattern and the test pattern is made 1 by considering the responses of the internal gates. Therefore, procedure of the algorithm is simpler than that of the conventional methods because the line justification is unnecessary. Also, this method needs no extra hardware for testability and can be applied to random CMOS circuits in addition to two-level NAND - NAND CMOS circuits.

• ETRI Journal
• /
• 제25권5호
• /
• pp.321-327
• /
• 2003

Testing time and power consumption during the testing of SoCs are becoming increasingly important with an increasing volume of test data in intellectual property cores in SoCs. This paper presents a new algorithm to reduce the scan-in power and test data volume using a modified scan latch reordering algorithm. We apply a scan latch reordering technique to minimize the column hamming distance in scan vectors. During scan latch reordering, the don't-care inputs in the scan vectors are assigned for low power and high compression. Experimental results for ISCAS 89 benchmark circuits show that reduced test data and low power scan testing can be achieved in all cases.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 춘계학술대회 학술발표 논문집 제16권 제1호
• /
• pp.96-98
• /
• 2006

축산폐수는 축사가 대부분 상수원보다 상류지역에 산재하고 있어 이를 효과적으로 관리하기 어려우나, 연속 회분식 반응기(Sequencing Batch Reactor, SBR)는 장치가 간단하고 경제성이 우수하여 축산폐수처리에서 효율적으로 적용될 수 있다. 본 연구에서는 DO(Dissolved Oxygen)과 ORP(Oxidation-Reduction Potential)을 이용하여 지식기반 고장진단 시스템을 제안하였다. 실시간으로 얻어진 ORP, DO값들을 전처리하여, [ORP], [DO]외에 [ORP DO]합성data와 ORP, DO의 특징백터의 합에서 얻어진 fusion data의 총 4개의 data set을 이용하여 각각에 대한 진단과 분류성능을 검토하였다. 이 값을 이용하여 FCM (fuzzy C-mean) 클러스터링 한 후, K-PCA과 LDA로 차원축소시켜 특징백터를 추출하였다. 그리고 Hamming distance로 test data와 특징백터의 거리를 계산하여 각 class를 F1에서 F8까지 분류하였다. 그 결과 데이터를 그대로 이용하는 것 보다 차분데이터형태로 이용하는 것이 우수했으며 그 중 fusion 데이터의 결과가 다른 것들보다 향상된 결과를 보였다. 그리고 K-PCA와 LDA를 결합한 결과가 다른 방법에 비해 우수한 결과를 보였으며 fusion method를 이용한 최고인식율은 98.02%를 나타내었다.

• 정보와 통신
• /
• 제31권2호
• /
• pp.71-82
• /
• 2014

본 논문에서는 물리 계층에서 보안을 고려한 시스템을 제공하기 위해 Gaussian Wiretap Channel 상황에서 보안 전송을 가능하게 하는 보안 전처리 기법의 설계 방법에 대해서 살펴본다. 무선 통신 채널의 경우, 통신 채널이 누구에게나 개방되어 있기 때문에 무엇보다도 보안에 취약하다. 하지만 숨기고자 하는 보안 메시지를 채널 부호화 및 변조 과정 이전에 보안을 위한 전처리 기법을 적용함으로써 물리계층에서 데이터를 보다 안전하게 전송하는 것이 가능해진다. 이를 위해 기존의 Random하게 생성된 Scrambling matrix를 이용하여 물리계층 보안을 유지하는 전처리 기법을 바탕으로 Scrambling matrix의 hamming distance를 이용하여 높은 보안성 및 신뢰도를 가지는 Scrambling matrix 설계 방법을 제안한다. 또한 부호율 1을 가지는 soft decision decoding 기반의 새로운 보안 전처리 기법을 제안함으로써 물리계층에서의 보안성 확보 가능성을 확인하였다.

• 제어로봇시스템학회논문지
• /
• 제17권12호
• /
• pp.1210-1218
• /
• 2011

GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.