• 대한수학회지
• /
• 제33권2호
• /
• pp.259-268
• /
• 1996

The Data Encryption Standard(DES) [3, 8, 9] was developed by an IBM team aroung 1974 and adopted as a national standard in 1977.

• 한국정밀공학회지
• /
• 제15권7호
• /
• pp.167-174
• /
• 1998

This paper presents an unoccluded cylindrical object pose measurement 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. The elliptical equation parameters of a projected curve edge on a slice are calculated using LSM. The coefficients of standard elliptical equation are compared with these parameters to estimate the object pose. The hamming distances between the estimated coordinates and the calculated ones are extracted as measures to evaluate a local constraint and a smoothing surface curvature. The edges between slices are linked using error function based on the edge types and the hamming distances. The linked edges on slices are compared with the model object's length to recognize the unoccluded object. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as punch press operation or part assembly.

• 정보처리학회논문지A
• /
• 제8A권3호
• /
• pp.279-286
• /
• 2001

본 논문은 상위 레벨 합성 과정에서 DSP와 같은 회로를 대상으로 전력소모를 최소로 하는 스케줄링 및 자원할당 알고리즘을 제안한다. 본 논문에서는 스케줄링 시의 저 전력 설계는 리스트 스케줄링 방법을 이용한다. 그리고 자원공유를 통하여 자원할당 시 입력을 재 사용할 수 있는 가능성을 증가시킨다. 스케줄링 후 자원할당 방법은 두 입력 사이의 평균 해밍 거리와 교환동작을 계산한 결과값을 고려하여 전력 함수를 이용한다. 먼저 두 연산자 사이의 평균 해밍 거리를 계산한 후 입력 값에 대한 교환동작을 구하며, 입력 값의 비트 패턴을 이용하여 전력 값을 구한다. 자원 할당 과정은 제어 단계를 한 단계 씩 증가시키면서 각 제어 단계에서 할당 될 수 있는 모든 경우들에 대하여 평균 해밍 거리가 가장 적고 전력 함수에 의한 전력이 가장 적게 소비되는 연산자를 할당한다. 기존 방법과 비교했을 때 그 수행속도는 사용하는 연산자의 개수와 최다 제어 단계에 따라서 빨라진다. 그리고 소모하는 전력이 6%에서 8%까지 감소효과가 있었다.

• 품질경영학회지
• /
• 제32권3호
• /
• pp.182-197
• /
• 2004

In this paper we propose a new method of evaluating customers' service quality using triangle fuzzy numbers and semantic differential scale. These two parameters are useful for quantifying the customers' linguistic variables and subjective judgements. We define the Service Quality(SQ) as the ratio of the expected and perceived service and address the Agreement Rate(AR) calculated from the hamming distance in order to define the Service Rate(SR) as the geometric mean of the SQ and AR. Using the SR in the analysis of service attributes provides more appropriate to measure the customers' service quality and to establish a creative service policy for competitive service quality improvement.

• 대한수학회보
• /
• 제55권6호
• /
• pp.1627-1638
• /
• 2018

In this paper, we study an special type of cyclic codes called skew cyclic codes over the ring ${\mathbb{F}}_p+v{\mathbb{F}}_p+v^2{\mathbb{F}}_p$, where p is a prime number. This set of codes are the result of module (or ring) structure of the skew polynomial ring (${\mathbb{F}}_p+v{\mathbb{F}}_p+v^2{\mathbb{F}}_p$)[$x;{\theta}$] where $v^3=1$ and ${\theta}$ is an ${\mathbb{F}}_p$-automorphism such that ${\theta}(v)=v^2$. We show that when n is even, these codes are either principal or generated by two elements. The generator and parity check matrix are proposed. Some examples of linear codes with optimum Hamming distance are also provided.

• 한국항행학회논문지
• /
• 제12권5호
• /
• pp.412-419
• /
• 2008

유전자 알고리즘은 효과적으로 최적의 해를 구하는 기법이나 진화연상산자의 선정에 따라 조기에 국부 최적해에 고착되어 전역 최적해로의 탐색을 어렵게 하는 문제점을 가지고 있다. 본 논문에서는 국부 최적해로 수렴하게 되는 원인을 분석하고, 국부 최적해에서 벗어나 전역 최적해로의 천이가 가능하도록 하는 방법을 제안하였다. 본 논문에서 사용한 방법은 평균 해밍거리에 따라 진화연산자를 가변시키는 방법으로서 국부 최적해에 고착되지 않도록 유전자에 다양성을 부여하여 지속적으로 모집단의 진화 특성을 유지하는 방법이다. 제안된 방법은 시뮬레이션을 통하여 효용성을 입증하였다.

• 전기학회논문지
• /
• 제60권5호
• /
• pp.1043-1048
• /
• 2011

Test vector reordering is a very effective way to reduce power consumption during test application. But, it is time-consuming and complicated processes, and it does not consider internal circuit structure, which may limit the effectiveness. In this paper, we order test vectors using fanout count of primary inputs that consider the internal circuit structure, which may reduce the switching activity. Then, we reorder test test vectors again by using Hamming distance between test vectors. We proposed FOVO algorithm to perform these two ideas. FOVO is an effective way to reduce power consumption during test application. The algorithm is applied to benchmark circuits and we get an average of 3.5% or more reduction of the power consumption.

• 대한수학회보
• /
• 제55권1호
• /
• pp.115-137
• /
• 2018

Let $R_{u{^2},v^2,w^2,p}$ be a finite non chain ring ${\mathbb{F}}_p[u,v,w]{\langle}u^2,\;v^2,\;w^2,\;uv-vu,\;vw-wv,\;uw-wu{\rangle}$, where p is a prime number. This ring is a part of family of Frobenius rings. In this paper, we explore the structures of cyclic codes over the ring $R_{u{^2},v^2,w^2,p}$ of arbitrary length. We obtain a unique set of generators for these codes and also characterize free cyclic codes. We show that Gray images of cyclic codes are 8-quasicyclic binary linear codes of length 8n over ${\mathbb{F}}_p$. We also determine the rank and the Hamming distance for these codes. At last, we have given some examples.

• International Journal of Ocean System Engineering
• /
• 제2권1호
• /
• pp.16-23
• /
• 2012

In this paper we discussed a new methodology for Urdu Character Recognition system using Dempster-Shafer theory which can powerfully estimate the similarity ratings between a recognized character and sampling characters in the character database. Recognition of character is done by five probability calculation methods such as (similarity, hamming, linear correlation, cross-correlation, nearest neighbor) with Dempster-Shafer theory of belief functions. The main objective of this paper is to Recognition of Urdu letters and numerals through five similarity and dissimilarity algorithms to find the similarity between the given image and the standard template in the character recognition system. In this paper we develop a method to combine the results of the different distance measurement methods using the Dempster-Shafer theory. This idea enables us to obtain a single precision result. It was observed that the combination of these results ultimately enhanced the success rate.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
• /
• pp.121-124
• /
• 2001

This paper proposed resource allocation algorithm for the minimum switching activity of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. The resource allocation method after scheduling use the power function calculating average hamming distance and switching activity of the between two input. First of all, the switching activity is calculated by the input value after calculating the average hamming distance between operation. In this paper, the proposed method though high If level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To use the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step. As the existing method, the execution time can be fast according to use the number of operator and max control step. And it is the reduction effect from 6% to 8%.